Characterizing the Path Coverage of Random Wireless Sensor Networks

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.

[1]  D. Manjunath,et al.  On the Path Coverage Properties of Random Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[2]  A Dvoretzky,et al.  ON COVERING A CIRCLE BY RANDOMLY PLACED ARCS. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[3]  D. Manjunath,et al.  On the Path Tracking Properties of Random Sensor Networks , 2005 .

[4]  Lars Holst.  On Convergence of the Coverage by Random Arcs on a Circle and the Largest Spacing , 1981 .

[5]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[6]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[7]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[8]  M. Basta,et al.  An introduction to percolation , 1994 .

[9]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[10]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[11]  Thierry Huillet.  Random covering of the circle: the size of the connected components , 2003, Advances in Applied Probability.

[12]  Andrew F. Siegel,et al.  Covering the Circle with Random Arcs of Random Sizes. , 1982 .

[13]  Dong Xuan,et al.  Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks , 2008, MobiHoc '08.

[14]  L. Flatto.  A limit theorem for random coverings of a circle , 1973 .

[15]  Shigeo Shioda,et al.  Path Coverage Property of Randomly Deployed Sensor Networks with Finite Communication Ranges , 2008, 2008 IEEE International Conference on Communications.

[16]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[17]  L. Shepp.  Covering the circle with random ARCS , 1972 .

[18]  M. Yadin,et al.  Random coverage of a circle with applications to a shadowing problem , 1982 .