Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks

In this paper, we consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity among all the active sensors and the sink. We model the CTC problem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking Jg. 16; H. 6; S. 1378 - 1391
Hauptverfasser: Qun Zhao, Gurusamy, M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Approximation
Approximation algorithms
Costs
coverage
Graphs
Heuristic
Heuristic algorithms
Heuristic methods
Job shop scheduling
Mathematical analysis
Maximization
Monitoring
network lifetime
Networks
NP-complete
Protocols
Scheduling algorithm
sensor activity scheduling
Sensors
Studies
Upper bound
Upper bounds
Wireless communication
Wireless sensor networks
ISSN:1063-6692, 1558-2566
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity among all the active sensors and the sink. We model the CTC problem as a maximum cover tree (MCT) problem and prove that the MCT problem is NP-Complete. We determine an upper bound on the network lifetime for the MCT problem and then develop a (1+ w ) H (M circ) approximation algorithm to solve it, where w is an arbitrarily small number, H (M circ)= 1 lesilesM circ (1/i) and M circ is the maximum number of targets in the sensing area of any sensor. As the protocol cost of the approximation algorithm may be high in practice, we develop a faster heuristic algorithm based on the approximation algorithm called Communication Weighted Greedy Cover (CWGC) algorithm and present a distributed implementation of the heuristic algorithm. We study the performance of the approximation algorithm and CWGC algorithm by comparing them with the lifetime upper bound and other basic algorithms that consider the coverage and connectivity problems independently. Simulation results show that the approximation algorithm and CWGC algorithm perform much better than others in terms of the network lifetime and the performance improvement can be up to 45% than the best-known basic algorithm. The lifetime obtained by our algorithms is close to the upper bound. Compared with the approximation algorithm, the CWGC algorithm can achieve a similar performance in terms of the network lifetime with a lower protocol cost.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.911432