Energy Efficient Fractional Coverage Schemes for Low Cost Wireless Sensor Networks

Authors:
Mao YE;Edward CHAN;Guihai CHEN;Jie WU
Affiliations:
City University of Hong Kong, China;City University of Hong Kong, China;Nanjing University, China;Florida Atlantic University
Venue:
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Year:
2006

Citing 0
Cited 4

On perimeter coverage in wireless sensor networks

IEEE Transactions on Wireless Communications
Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range

EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
On perimeter coverage in wireless sensor networks with minimum cost

International Journal of Sensor Networks
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. Depending on different types of applications, the network lifetime may be much more critical than covering the entire monitored area at every data reporting round. This paper presents a competition based distributed scheme called FCS to address the fractional coverage problem in wireless sensor networks with tiny, lowcost sensors. Through localized, energy-aware competition, the proposed scheme achieves the desired fractional coverage with a minimum number of active sensors. By taking account of both residual battery energy and recent reporting latency, an enhanced version of FCS which uses a novel competition metric to constrain the maximum reporting latency throughout the network is also proposed. These two schemes also contain the desirable property that it can be extended easily to handle the more general k-coverage problem.