Characterizing the path coverage of random wireless sensor networks

Authors:
Moslem Noori;Sahar Movaghati;Masoud Ardakani
Affiliations:
Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Canada;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Canada;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Canada
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Year:
2010

Citing 5
Cited 1

Barrier coverage with wireless sensors

Proceedings of the 11th annual international conference on Mobile computing and networking
On the Path Coverage Properties of Random Sensor Networks

IEEE Transactions on Mobile Computing
Designing localized algorithms for barrier coverage

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

Survey Paper: Distance distributions in random networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks are widely used in security monitoring applications to sense and report specific activities in a field. In path coverage, for example, the network is in charge of monitoring a path and discovering any intruder trying to cross it. In this paper, we investigate the path coverage properties of a randomly deployed wireless sensor network when the number of sensors and also the length of the path are finite. As a consequence, Boolean model, which has been widely used previously, is not applicable. Using results from geometric probability, we determine the probability of full path coverage, distribution of the number of uncovered gaps over the path, and the probability of having no uncovered gaps larger than a specific size. We also find the cumulative distribution function (cdf) of the covered part of the path. Based on our results on the probability of full path coverage, we derive a tight upper bound for the number of nodes guaranteeing the full path coverage with a desired reliability. Through computer simulations, it is verified that for networks with nonasymptotic size, our analysis is accurate where the Boolean model can be inaccurate.