Can I read Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks on EtoBox?

Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks by Qun Zhao; M. Gurusamy is a Computer Science article available to read on EtoBox.

What is Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks about?

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 + ) ( ^) approximation algorithm to solve it, where is an arbitrarily small number, ( ^) = 1 ^(1 ) and ^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 a

Who reads Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks?

Author

Qun Zhao; M. Gurusamy

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Published

2008

Language

EN

Field

Computer Science (Physical Sciences)