Connectivity of wireless sensor networks with constant density

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3158, Issue , 2004, Pages 149-157

  Carruthers, Sarah ^a   King, Valerie ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE AD HOC NETWORKS; WIRELESS AD HOC NETWORKS;

CONNECTED COMPONENT; CONSTANT DENSITY; ELEMENTARY TECHNIQUES; HIGH PROBABILITY; RELATIVE SIZES;

WIRELESS SENSOR NETWORKS;

EID: 35048893781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28634-9_12     Document Type: Article

References (8)

1. E.H. Jennings, C.M. Okino. On the Diameter of Sensor Networks. Proceedings of the 2002 IEEE Aerospace Conference, Big Sky, Montana, Mar. 2002.
2. P. Gupta, P. R. Kumar. Critical Power for Asymptotic Connectivity in Wireless Networks, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming (W. M. McEneany, G. Yin, and Q. Zhang, eds), 547-566, Boston, MA: Birkhauser, March 1998.
3. F. Xue and P. R. Kumar. The number of neighbours needed for connectivity of wireless networks. Manuscript, 2002.
4. S. Shakkottai, R. Srikant, N. Shroff. Unreliable Sensor Grids: Coverage, Connectivity and Diameter. In IEEE INFOCOM 2003.
5. M. D. Penrose. Single Linkage Clustering and Continuum Percolation. Journal of Multivariate Analysis 53, 94-109, 1995.
6. J. Diaz, M. D. Penrose, J. Petit, M. Seina. Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs. Combinatorics, Probability and Computing 9, 489-511, 2000.
7. M. D. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
8. R. Motwani, P. Raghavan. Randomized Algorithms, p 70, Cambridge Press, 1995.