The Number of Neighbors Needed for Connectivity of Wireless Networks

Wireless Networks

Volumn 10, Issue 2, 2004, Pages 169-181

  Xue, Feng ^a   Kumar, P R ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Ad hoc networks; Connectivity; Transmission range control; Wireless networks

Indexed keywords

COMPUTER SIMULATION; DATA TRANSFER; GRAPH THEORY; NETWORK PROTOCOLS; PROBABILITY; RADIO INTERFERENCE; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

AD HOC NETWORKS; CONNECTIVITY; TRANSMISSION RANGE CONTROL; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 1042289031     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:WINE.0000013081.09837.c0     Document Type: Article

References (19)

1. L. Kleinrock and J.A. Silvester, Optimum transmission radii for packet radio networks or why six is a magic number, in: Proc. of IEEE Nat. Telecommun. Conf. (December 1978) pp. 4.3.1-4.3.5.
2. R. Mathar and J. Mattfeldt, Analyzing routing strategy NFP in multihop packet radio network on a line, IEEE Transactions on Communications 43(2-4) (1995) 977-988.
3. J. Ni and S. Chandler, Connectivity properties of a random radio network, Proceedings of the IEE - Communications 141 (August 1994) 289-296.
4. J.A. Silvester, On the spatial capacity of packet radio networks, Eng. Rep. UCLA-ENG-8021, Dept. Comput. Sci., School Eng. Appl. Sci., Univ. California, Los Angeles (March 1980).
5. H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. Commun. 32 (1984) 246-257.
6. T. Hou and V. Li, Transmission range control in multihop packet radio networks, IEEE Trans. Commun. 34 (January 1986) 38-44.
7. B. Hajek, Adaptive transmission strategies and routing in mobile radio networks, in: Proceedings of the Conference on Information Sciences and Systems (March 1983) pp. 373-378.
8. P. Gupta and P. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46 (March 2000) 388-404.
9. T.K. Philips, S.S. Panwar and A.N. Tantawi, Connectivity properties of a packet radio network model, IEEE Transactions on Information Theory 35 (September 1989) 1044-1047.
10. P. Gupta and 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, eds W.M. McEneany, G. Yin and Q. Zhang (Birkhäuser, Boston, MA, 1998) pp. 547-566.
11. M.D. Penrose, The longest edge of the random minimal spanning tree, The Annals of Applied Probability 7(2) (1997) 340-361.
12. B. Bollobás, Random Graphs (Academic Press, Orlando, FL, 1985).
13. R. Meester and R. Roy, Continuum Percolation (Cambridge University Press, Cambridge, UK, 1996).
14. H. Kesten, Percolation Theory for Mathematicians (Birkhäuser, Boston, MA, 1982).
15. L. Booth, J. Bruck, M. Franceschetti and R. Meester, Covering algorithms, continuum percolation and the geometry of wireless networks, Preprint, http://www.paradise.caltech.edu/ETR.html (2001).
16. M. Franceschetti, M. Cook and J. Bruck, A geometric theorem for approximate disk covering algorithms, Preprint, http://www.paradise.caltech.edu/ETR.html (2001).
17. F. Avram and D. Bertsimas, On central limit theorems in geometrical probability, Annals of Applied Probability 3(4) (1993) 1033-1046.
18. O. Häggström and R. Meester, Nearest neighbor and hard sphere models in continuum percolation, Random Structures and Algorithms 9 (1996) 295-315.
19. S. Narayanaswamy, V. Kawadia, R.S. Sreenivas and P.R. Kumar, Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol, in: European Wireless Conference - Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, Florence, Italy (25-28 February 2002).