Sensor scheduling for p-percent coverage in wireless sensor networks

Authors:
Yingshu Li;Chunyu Ai;Zhipeng Cai;Raheem Beyah
Affiliations:
Computer Science Department, Georgia State University, Atlanta, USA 30303;Computer Science Department, Georgia State University, Atlanta, USA 30303;Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8;Computer Science Department, Georgia State University, Atlanta, USA 30303
Venue:
Cluster Computing
Year:
2011

Citing 7
Cited 2

The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Maximizing network lifetime in energy-constrained wireless sensor network

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Telos: enabling ultra-low power wireless research

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Coverage by randomly deployed wireless sensor networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
p-Percent Coverage in Wireless Sensor Networks

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications
Sensor density for complete information coverage in wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks

Adaptive energy and location aware routing in wireless sensor network

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Partial sensing coverage with connectivity in lattice wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored area may have different coverage requirements. Centralized p-Percent Coverage Algorithm (CPCA) we proposed is a centralized algorithm which selects the least number of nodes to monitor p-percent of the monitored area. Distributed p-Percent Coverage Protocol (DPCP) we represented is a distributed algorithm which can determine a set of nodes in a distributed manner to cover p-percent of the monitored area. Both of the algorithms can guarantee network connectivity. The simulation results show that our algorithms can remarkably prolong network lifetime, have less than 5% un-required coverage for large networks, and employ nodes fairly for most cases.