Extremal properties of three-dimensional sensor networks with applications

We analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase transitions. For a given property of the network, there is a critical threshold, corresponding to the minimum amount of the communication effort or power expenditure by individual nodes, above (respectively, below) which the property exists with high (respectively, a low) probability. For sensor networks, properties of interest include simple and multiple degrees of connectivity/coverage. First, we investigate the network topology according to the region of deployment, the number of deployed sensors, and their transmitting/sensing ranges. More specifically, we consider the following problems: assume that n nodes, each capable of sensing events within a radius of r, are randomly and uniformly distributed in a 3-dimensional region R of volume V, how large must the sensing range R/sub SENSE/ be to ensure a given degree of coverage of the region to monitor? For a given transmission range R/sub TRANS/, what is the minimum (respectively, maximum) degree of the network? What is then the typical hop diameter of the underlying network? Next, we show how these results affect algorithmic aspects of the network by designing specific distributed protocols for sensor networks.

[1]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[2]  P. R. Kumar,et al.  Internets in the sky: The capacity of three-dimensional wireless networks , 2001, Commun. Inf. Syst..

[3]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[4]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[5]  Deborah Estrin,et al.  Center for Embedded Networked Sensing , 2006 .

[6]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[7]  Roberto Battiti,et al.  Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.

[8]  B. Reed.  Graph Colouring and the Probabilistic Method , 2001 .

[9]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[10]  Philippe Piret.  On the connectivity of radio networks , 1991, IEEE Trans. Inf. Theory.

[11]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[12]  B. Bollobás.  The evolution of random graphs , 1984 .

[13]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[14]  N. D. Bruijn.  Asymptotic methods in analysis , 1958 .

[15]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[18]  Paul G. Spirakis,et al.  Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks , 2005, Mob. Networks Appl..

[19]  Nitin H. Vaidya,et al.  A Power Control MAC Protocol for Ad Hoc Networks , 2002, MobiCom '02.

[20]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[21]  Colin McDiarmid,et al.  Random channel assignment in the plane , 2003, Random Struct. Algorithms.

[22]  Reuven Bar-Yehuda,et al.  Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection , 1989, WDAG.

[23]  Milica Stojanovic,et al.  Shallow water acoustic networks , 2001, IEEE Commun. Mag..

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

[25]  G. Kalai,et al.  Every monotone graph property has a sharp threshold , 1996 .

[26]  Jerzy Kocinski.  Phase transition phenomena , 1983 .

[27]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[28]  N. Temme.  Uniform asymptotic expansions of the incomplete gamma functions and the incomplete beta function , 1975 .

[29]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[30]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[31]  Béla Bollobás,et al.  Random Graphs , 1985 .

[32]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[33]  Alessandro Panconesi,et al.  An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms , 2002, SODA '02.

[34]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[35]  Stephen B. Wicker,et al.  Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[36]  Xiaoyan Hong,et al.  Load balanced, energy-aware communications for Mars sensor networks , 2002, Proceedings, IEEE Aerospace Conference.

[37]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[38]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[39]  Giampietro Allasia,et al.  Tricomi's ideas and contemporary applied mathematics , 1998 .

[40]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[41]  M. R. Pearlman,et al.  Critical Density Thresholds in Distributed Wireless Networks , 2003 .

[42]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[43]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[44]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

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

[46]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[47]  Limin Hu.  Distributed code assignments for CDMA Packet Radio Network , 1993, TNET.

[48]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[49]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[50]  Reuven Bar-Yehuda,et al.  Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.

[51]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[52]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[53]  R. E. Miles.  On the homogeneous planar Poisson point process , 1970 .

[54]  N. Temme.  The asymptotic expansion of the incomplete gamma functions : (preprint) , 1977 .

[55]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[56]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[57]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

[58]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[59]  Bhaskar Krishnamachari,et al.  Sharp thresholds For monotone properties in random geometric graphs , 2003, STOC '04.