- Published 2010 in EURASIP J. Wireless Comm. and Networking

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.

@article{Noori2010CharacterizingTP,
title={Characterizing the Path Coverage of Random Wireless Sensor Networks},
author={Moslem Noori and Sahar Movaghati and Masoud Ardakani},
journal={EURASIP J. Wireless Comm. and Networking},
year={2010},
volume={2010}
}