The Community for Technology Leaders
Green Image
Issue No. 04 - April (2011 vol. 10)
ISSN: 1536-1233
pp: 465-478
Changlei Liu , The Pennsylvania State University, University Park
Guohong Cao , The Pennsylvania State University, University Park
Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while meeting the lifetime constraint at the same time. Sometimes, coverage has to be traded for network lifetime. In this paper, we study how to schedule sensors to maximize their coverage during a specified network lifetime. Unlike sensor deployment, where the goal is to maximize the spatial coverage, our objective is to maximize the spatial-temporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, we first present a centralized heuristic whose approximation factor is proved to be {1\over 2}, and then, propose a distributed parallel optimization protocol (POP). In POP, nodes optimize their schedules on their own but converge to local optimality without conflict with one another. Theoretical and simulation results show that POP substantially outperforms other schemes in terms of network lifetime, coverage redundancy, convergence time, and event detection probability.
Wireless sensor network, coverage, sensor scheduling, distributed protocol, parallel algorithm.

C. Liu and G. Cao, "Spatial-Temporal Coverage Optimization in Wireless Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 10, no. , pp. 465-478, 2010.
93 ms
(Ver 3.3 (11022016))