NDLI: Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach

Content Provider	ACM Digital Library
Author	Shu, Tao Krunz, Marwan
Copyright Year	2010
Abstract	In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network by optimal balancing of power consumption among cluster heads (CHs). Clustering significantly reduces the energy consumption of individual sensors, but it also increases the communication burden on CHs. To investigate this tradeoff, our analytical model incorporates both intra- and intercluster traffic. Depending on whether location information is available or not, we consider optimization formulations under both deterministic and stochastic setups, using a Rayleigh fading model for intercluster communications. For the deterministic setup, sensor nodes and CHs are arbitrarily placed, but their locations are known. Each CH routes its traffic directly to the sink or relays it through other CHs. We present a coverage-time-optimal joint clustering/routing algorithm, in which the optimal clustering and routing parameters are computed using a linear program. For the stochastic setup, we consider a cone-like sensing region with uniformly distributed sensors and provide optimal power allocation strategies that guarantee (in a probabilistic sense) an upper bound on the end-to-end (inter-CH) path reliability. Two mechanisms are proposed for achieving balanced power consumption in the stochastic case: a routing-aware optimal cluster planning and a clustering-aware optimal random relay. For the first mechanism, the problem is formulated as a signomial optimization, which is efficiently solved using generalized geometric programming. For the second mechanism, we show that the problem is solvable in linear time. Numerical examples and simulations are used to validate our analysis and study the performance of the proposed schemes.
Starting Page	202
Ending Page	215
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2009.2022936
Volume Number	18
Issue Number	1
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-02-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Clustering Coverage time Generalized geometric programming Linear programming Sensor networks Signomial optimization Topology control
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

Coverage-Time Optimization for Clustered Wireless Sensor Networks: A Power-Balancing Approach

Power balanced coverage-time optimization for clustered wireless sensor networks

1coverage-time optimization for clustered wireless sensor networks: a power-balancing approach.

A Stochastic Geometric Programming Approach for Power Allocation in Wireless Networks

On the θ-coverage and connectivity of large random networks

On the Planning of Wireless Sensor Networks: Energy-Efficient Clustering under the Joint Routing and Coverage Constraint

Energy-Aware Distributed Topology Control for Coverage-Time Optimization in Clustering-Based Heterogeneous Sensor Networks

Cross-Layer Throughput Optimization With Power Control in Sensor Networks

Coverage properties of clustered wireless sensor networks

Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach

Similar Documents

Coverage-Time Optimization for Clustered Wireless Sensor Networks: A Power-Balancing Approach

Power balanced coverage-time optimization for clustered wireless sensor networks

1coverage-time optimization for clustered wireless sensor networks: a power-balancing approach.

A Stochastic Geometric Programming Approach for Power Allocation in Wireless Networks

On the θ-coverage and connectivity of large random networks

On the Planning of Wireless Sensor Networks: Energy-Efficient Clustering under the Joint Routing and Coverage Constraint

Energy-Aware Distributed Topology Control for Coverage-Time Optimization in Clustering-Based Heterogeneous Sensor Networks

Cross-Layer Throughput Optimization With Power Control in Sensor Networks

Coverage properties of clustered wireless sensor networks

Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach