Threshold functions, node isolation, and emergent lacunae in sensor networks

IEEE Transactions on Information Theory

Volumn 52, Issue 12, 2006, Pages 5352-5372

  Kunniyur, Srisankar S ^a,b,c   Venkatesh, Santosh S ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c MOTOROLA INC   (United States)

Author keywords

Graph connectivity; Inclusion exclusion; Phase transitions; Poisson paradigm; Random graphs; Sensor networks; Threshold functions

Indexed keywords

GRAPH CONNECTIVITY; INCLUSION-EXCLUSION; POISSON PARADIGM; RANDOM GRAPHS; THRESHOLD FUNCTIONS;

GRAPH THEORY; PHASE TRANSITIONS; POISSON DISTRIBUTION; RANDOM PROCESSES; TELECOMMUNICATION LINKS; THRESHOLD LOGIC;

SENSOR NETWORKS;

EID: 33947420768     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.885503     Document Type: Article

References (18)

1. A. Chandrakasan, R. Amirtharajah, S. Cho, J. Goodman, G. Konduri, J. Kulik, W. Rabiner, and A. Wang, "Design considerations for distributed microsensor systems," in Proc. IEEE 1999 Custom Integr. Circuits Conf. (CICC), May 1999, pp. 279-286.
2. L. P. Clare, G. Pottie, and J. Agre, "Self-organizing distributed sensor networks," in Proc. SPIE Conf. Unattended Ground Sensor Technol. Appl., Apr. 1999, pp. 229-237.
3. M. Dong, K. Yung, and W. Kaiser, "Low power signal processing architectures for network microsensors," in Proc. 1997 Int. Symp. Low Power Electron. Design, Aug. 1997, pp. 173-177.
4. P. Erdös and A. Renyi, "On the evolution of random graphs," Magyar Tud. Akad. Mat. Kut. Int. Kozl, vol. 5, pp. 17-61, 1960.
5. W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1965, vol. I.
6. M. Francheschetti, private communication.
7. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stock. Anal., Contr., Optim. Appl., ser. A Volume in Honor of W. H. Fleming, pp. 547-566, 1998.
8. P. Hall, Introduction to the Theory of Coverage Processes. New York: Wiley, 1988.
9. J. Karamata, "Sur un mode de croissance reguliere," Mathematics (Cluj), vol. 4, pp. 38-53, 1930.
10. S. S. Kunniyur and S. S. Venkatesh, "Network devolution and the growth of sensory lacunae in sensor networks," in Proc. WiOpt'04: Modeling and Optim. Mobile, Ad Hoc Wireless Netw., Cambridge, U.K., Mar. 2004, Univ. Cambridge.
11. S. S. Kunniyur and S. S. Venkatesh, "Sensor network devolution and breakdown in survivor connectivity," in Proc. 2004 Int. Symp. Inf. Theory, Chicago, IL, Jun. 27-Jul. 2 2004.
12. R. Meester and R. Roy, Continuum Percolation. Cambridge, U.K.: Cambridge University Press, 1996.
13. M. Penrose, "The longest edge of the random minimal spanning tree," Ann. Appl. Prob., vol. 7, pp. 340-361, 1997.
14. M. Penrose, Random Geometric Graphs. Cambridge, U.K.: Oxford University Press, 2003.
15. S. Shakkottai, R. Srikant, and N. Shroff, "Unreliable sensor grids: coverage, connectivity and diameter," in Proc. IEEE INFOCOM, San Francisco, CA, 2003.
16. Connectivity in Geometric Random Graphs 2004 [Online]. Available: http://www.seas.upenn.edu/~venkates/publications_new.html, S. S. Venkatesh, preprint
17. S. S. Venkatesh, "Connectivity, devolution, and lacunae in geometric random digraphs," in Proc. Inaug. Worksh. Inf. Theory Appl., San Diego, CA, Feb. 2006 [Online]. Available: http://ita.ucsd.edu/workshop/papers/ 165.pdf
18. C.-W. Yi, P.-J. Wan, X.-Y. Li, and O. Frieder, "Fault tolerant sensor networks with Bernoulli nodes," in Proc. IEEE Wireless Commun. Networking Conf. (WCNC), New Orleans, LA, Mar. 2003.