NDLI: Exact and heuristic algorithms for data-gathering cluster-based wireless sensor network design problem

Content Provider	ACM Digital Library
Author	Üster, Halit Lin, Hui
Copyright Year	2014
Abstract	Data-gathering wireless sensor networks (WSNs) are operated unattended over long time horizons to collect data in several applications such as those in climate monitoring and a variety of ecological studies. Typically, sensors have limited energy (e.g., an on-board battery) and are subject to the elements in the terrain. In-network operations, which largely involve periodically changing network flow decisions to prolong the network lifetime, are managed remotely, and the collected data are retrieved by a user via internet. In this paper, we study an integrated topology control and routing problem in cluster-based WSNs. To prolong network lifetime via efficient use of the limited energy at the sensors, we adopt a hierarchical network structure with multiple sinks at which the data collected by the sensors are gathered through the clusterheads (CHs). We consider a mixed-integer linear programming (MILP) model to optimally determine the sink and CH locations as well as the data flow in the network. Our model effectively utilizes both the position and the energy-level aspects of the sensors while selecting the CHs and avoids the highest-energy sensors or the sensors that are well-positioned sensors with respect to sinks being selected as CHs repeatedly in successive periods. For the solution of the MILP model, we develop an effective Benders decomposition (BD) approach that incorporates an upper bound heuristic algorithm, strengthened cuts, and an ε-optimal framework for accelerated convergence. Computational evidence demonstrates the efficiency of the BD approach and the heuristic in terms of solution quality and time.
Starting Page	903
Ending Page	916
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2013.2262153
Volume Number	22
Issue Number	3
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Benders decomposition (BD) Network design Wireless sensor networks (WSNs)
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exact and Heuristic Algorithms for Data-Gathering Cluster-Based Wireless Sensor Network Design Problem

Minimum data-latency-bound k-sink placement problem in wireless sensor networks

Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks

Optimization-Based Distributed Algorithms for Mobile Data Gathering in Wireless Sensor Networks

The Exact and BD Algorithm for Data-Gathering Cluster-Based Wireless Sensor Network

Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks

Data Gathering in Wireless Sensor Networks Using Unmanned Aerial Vehicles

Design and performance of wireless data gathering networks based on unicast random walk routing

Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation

Exact and heuristic algorithms for data-gathering cluster-based wireless sensor network design problem

Similar Documents

Exact and Heuristic Algorithms for Data-Gathering Cluster-Based Wireless Sensor Network Design Problem

Minimum data-latency-bound k-sink placement problem in wireless sensor networks

Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks

Optimization-Based Distributed Algorithms for Mobile Data Gathering in Wireless Sensor Networks

The Exact and BD Algorithm for Data-Gathering Cluster-Based Wireless Sensor Network

Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks

Data Gathering in Wireless Sensor Networks Using Unmanned Aerial Vehicles

Design and performance of wireless data gathering networks based on unicast random walk routing

Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation

Exact and heuristic algorithms for data-gathering cluster-based wireless sensor network design problem