Rest with eyes open: stochastic target coverage in wireless sensor networks with data fusion Online publication date: Wed, 20-Jan-2016
by Pan Wu; Xiaobing Wu; Guihai Chen
International Journal of Sensor Networks (IJSNET), Vol. 20, No. 1, 2016
Abstract: Target coverage and network lifetime are two conflicting system metrics in wireless sensor networks (WSNs). In this paper, we explore the tradeoff between coverage and lifetime from three perspectives: randomness of the target appearance, requirement of system reliability, and utilisation of data fusion. In previous studies targets are mainly assumed to appear in a deterministic way and the requirement of system reliability and the use of data fusion have been largely overlooked. In particular, given a specific requirement of system reliability, we consider how to maximise the network lifetime subject to the constraint of stochastic coverage of random targets with data fusion. We first prove the NP-completeness of the problem. Then we present a probabilistic set covering (PSC) based algorithm for small scale networks. But this algorithm does not scale well. We thus propose an effective algorithm for large scale networks. Finally extensive simulations validate the effectiveness of our algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook