Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks

A geometrically random network of sensors is obtained by modeling sensors as random points in the unit disc equipped with a local sensing capability and the ability to communicate with other sensors in their vicinity. Node extinctions in the network representing the finite battery lifetimes of the sensors are modeled as a sequence of independent random variables governed by a common probability distribution parametrized by the sensing and communication radii of the sensor nodes. Following its establishment, the devolution of the network with time is characterized by the appearance first of isolated nodes, then the growth of sensory lacunae or dead spots in the sensor field, and, eventually, a breakdown in connectivity between survivors. It is shown that these phenomena occur very sharply in time, these phase transitions occurring at times characteristic of the underlying probability law governing lifetimes. More precisely, it is shown that as the number of sensors grows there exists a critical point in time determined solely by the lifetime distribution at which the number of emergent lacunae of a given size is asymptotically Poisson

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

[2]  B. Harshbarger An Introduction to Probability Theory and its Applications, Volume I , 1958 .

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

[4]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  R. Rozovsky,et al.  Protocols for media access control and power control in wireless networks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[6]  Gregory J. Pottie,et al.  Self-organizing distributed sensor networks , 1999, Defense, Security, and Sensing.

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

[8]  W. Rabiner,et al.  Design considerations for distributed microsensor systems , 1999, Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327).

[9]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[10]  J. Karamata,et al.  Sur un mode de croissance régulière. Théorèmes fondamentaux , 1933 .

[11]  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).

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

[13]  William J. Kaiser,et al.  Low power signal processing architectures for network microsensors , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

[14]  Deborah Estrin,et al.  ASCENT : Adaptive Self-Configuring sEnsor Networks Topologies . , 2002 .

[15]  Chih-Wei Yi Peng-Jun Wan Xiang-Yang Li Ophir Frieder Fault Tolerant Sensor Networks with Bernoulli Nodes , 2002 .

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

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

[19]  øöö Blockinø The Number of Neighbors Needed for Connectivity of Wireless Networks , 2002 .

[20]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[21]  Santosh S. Venkatesh,et al.  Network Devolution and the Growth of Sensory Lacunae in Sensor Networks , 2004 .

[22]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  D. V. Lindley,et al.  An Introduction to Probability Theory and Its Applications. Volume II , 1967, The Mathematical Gazette.

[24]  Santosh S. Venkatesh,et al.  Sensor network devolution and breakdown in survivor connectivity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

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