This Article 
 Bibliographic References 
 Add to: 
Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem
October 2008 (vol. 57 no. 10)
pp. 1423-1434
Habib M. Ammari, The University of Texas at Arlington, Arlington
Sajal K. Das, The University of Texas at Arlington, Arlington
Abstract: While sensing coverage reflects the surveillance quality provided by a wireless sensor network (WSN), network connectivity enables data gathered by sensors to reach a central node, called the sink. Given an initially uncovered field and as more and more sensors are continuously added to a WSN, the size of partial covered areas increases. At some point, the situation abruptly changes from small fragmented covered areas to a single large covered area. We call this abrupt change as the sensing-coverage phase transition (SCPT). Also, given an originally disconnected WSN and as more and more sensors are added, the number of connected components changes such that the WSN suddenly becomes connected at some point. We call this sudden change as the network-connectivity phase transition (NCPT). The nature of such phase transitions is a central topic in percolation theory of Boolean models. In this paper, we propose a probabilistic approach to compute the covered area fraction at critical percolation for both of the SCPT and NCPT problems. Because sensing coverage and network connectivity are not totally orthogonal, we also propose a model for percolation in WSNs, called correlated disk model, which provides a basis for solving the SCPT and NCPT problems together.

[1] J. Ai and A. Abouzeid, “Coverage by Directional Sensors in Randomly Deployed Wireless Sensor Networks,” J. Combinatorial Optimization, vol. 11, no. 1, pp. 21-41, Feb. 2006.
[2] S. Adlakha and M. Srivastava, “Critical Density Threshold for Coverage in Wireless Sensor Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 1615-1620, 2003.
[3] H.M. Ammari and S.K. Das, “Coverage, Connectivity, and Fault Tolerance Measures of Wireless Sensor Networks,” Proc. Eighth Int'l Symp. Stabilization, Safety and Security of Distributed Systems, A.K.Datta and M. Gradinariu, eds., pp. 35-49, 2006.
[4] E. Bertin, J.-M. Billot, and R. Drouilhet, “Continuum Percolation in the Gabriel Graph,” Advances in Applied Probability, vol. 34, no. 4, pp. 689-701, 2002.
[5] L. Booth, J. Bruck, M. Franceschetti, and R. Meester, “Covering Algorithms, Continuum Percolation and the Geometry of Wireless Networks,” The Annals of Applied Probability, vol. 13, no. 2, pp. 722-741, 2003.
[6] S.R. Broadbent and J.M. Hammersley, “Percolation Processes: I.Crystals and Mazes,” Proc. Cambridge Philosophical Soc., vol. 53, pp.629-641, 1957.
[7] J. Cortes, S. Martinez, T. Karatas, and F. Bullo, “Coverage Control for Mobile Sensing Networks,” IEEE Trans. Robotics and Automation, vol. 20, no. 2, pp. 243-255, Apr. 2004.
[8] N.A.C. Cressie, Statistics for Spatial Data. John Wiley & Sons, 1991.
[9] X. Du and F. Lin, “Maintaining Differentiated Coverage in Heterogeneous Sensor Networks,” EURASIP J. Wireless Comm. and Networking, vol. 5, no. 4, pp. 565-572, 2005.
[10] J.W. Essam, “Percolation Theory,” Reports on Progress in Physics, vol. 43, pp. 833-912, 1980.
[11] D.H. Fremlin, “The Clustering Problem: Some Monte-Carlo Results,” J. de Physique, vol. 37, pp. 813-817, 1976.
[12] K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, no. 3, pp. 259-278, Sept. 1969.
[13] A. Ghosh and S.K. Das, “Coverage and Connectivity Issues in Wireless Sensor Networks,” Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions, R. Shorey et al., eds., pp. 221-256, Wiley Press, 2006.
[14] E.N. Gilbert, “Random Plane Networks,” J. SIAM, vol. 9, no. 4, pp.533-543, Dec. 1961.
[15] I. Glauche, W. Krause, R. Sollacher, and M. Greiner, “Continuum Percolation of Wireless Ad Hoc Communication Networks,” Physica A, vol. 325, pp. 577-600, 2003.
[16] R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, 1994.
[17] G. Grimmett, Percolation. Springer Verlag, 1989.
[18] P. Hall, Introduction to the Theory of Coverage Processes. John Wiley & Sons, 1988.
[19] C.-F. Huang and Y.-C. Tseng, “The Coverage Problem in a Wireless Sensor Network,” Proc. Second ACM Int'l Conf. Wireless Sensor Networks and Applications, pp. 115-121, 2003.
[20] A. Jiang and J. Bruck, “Monotone Percolation and the Topology Control of Wireless Networks,” Proc. IEEE INFOCOM '05, pp. 327-338, 2005.
[21] L. Lazos and R. Poovendran, “Coverage in Heterogeneous Sensor Networks,” Proc. Fourth Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006.
[22] X.-Y. Li, P.-J. Wan, and O. Frieder, “Coverage in Wireless Ad-Hoc Sensor Networks,” IEEE Trans. Computers, vol. 52, no. 6, pp. 753-763, June 2003.
[23] B. Liu and D. Towsley, “A Study of the Coverage of Large-scale Sensor Networks,” Proc. First IEEE Int'l Conf. Mobile Ad-hoc and Sensor Systems, pp. 475-483, 2004.
[24] R. Meester and R. Roy, Continuum Percolation. Cambridge Univ. Press, 1996.
[25] S. Megerian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Worst and Best-Case Coverage in Sensor Networks,” IEEE Trans. Mobile Computing, vol. 4, no. 1, Jan./Feb. 2005.
[26] S. Megerian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc. IEEE INFOCOM '01, pp. 1380-1387, 2001.
[27] V. Ravelomanana, “Extremal Properties of Three-Dimensional Sensor Networks with Applications,” IEEE Trans. Mobile Computing, vol. 3, no. 3, July-Sept. 2004.
[28] G.E. Pike and C.H. Seager, “Percolation and Conductivity: A Computer Study,” Physical Rev. B, vol. 10, pp. 1421-1434, 1974.
[29] F.D.K. Roberts, “A Monte Carlo Solution of a Two-Dimensional Unstructured Cluster Problem,” Biometrika, vol. 54, nos. 3/4, pp.625-628, Dec. 1967.
[30] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable Sensor Grids: Coverage, Connectivity and Diameter,” Proc. IEEE INFOCOM '03, pp. 1073-1083, 2003.
[31] D. Tian and N. Georganas, “Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks,” Ad Hoc Networks, vol. 3, pp. 744-761, 2005.
[32] T. Vicsek and J. Kertesz, “Monte Carlo Renormalization-Group Approach to Percolation on a Continuum: Test of Universality,” J.Physics A: Math. and General, vol. 14, pp. L31-L37, 1981.
[33] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, Aug. 2005.
[34] H. Zhang and J. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Ad Hoc and Sensor Wireless Networks, vol. 1, nos. 1-2, pp. 89-124, Mar. 2005.
[35] http://mathworld.wolfram.comBetaFunction.html , 2008.
[36] http://mathworld.wolfram.comErf.html, 2008.

Index Terms:
Sensor networks, Algorithm/protocol design and analysis
Habib M. Ammari, Sajal K. Das, "Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem," IEEE Transactions on Computers, vol. 57, no. 10, pp. 1423-1434, Oct. 2008, doi:10.1109/TC.2008.68
Usage of this product signifies your acceptance of the Terms of Use.