Robust wireless ad hoc networks

IEEE International Conference on Communications

Volumn 1, Issue , 2003, Pages 453-457

  Li, Xiang Yang ^a   Wang, Yu ^a   Wan, Peng Jun ^a   Yi, Chih Wei ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY EFFICIENCY; GRAPH THEORY; NETWORK PROTOCOLS; POISSON DISTRIBUTION; STATISTICAL METHODS;

AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0037715082     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in IEEE INFOCOM, 2000.
2. M. Sanchez, P. Manzoni, and Z. Haas, "Determination of critical transmission range in ad-hoc networks," in Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT'99), 1999.
3. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W. M. McEneaney, C. Yin, and Q. Zhang (Eds.), 1998.
4. B. Bollobás, Random Graphs, Cambridge University Press, 2001.
5. Mathew Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, pp. 145-164, 1999.
6. H. Dette and N. Henze, "Some peculiar boundary phenomena for extremes of r th nearest neighbor links," Statistics & Probability Letters, vol. 10, pp. 381-390, 1990.
7. Mathew Penrose, "The longest edge of the random minimal spanning tree," Annals of Applied Probability, vol. 7, pp. 340-361, 1997.
8. Mathew Penrose, "Extremes for the minimal spanning tree on normally distributed points," Advances in Applied Probability, vol. 30, pp. 628-639, 1998.
9. Mathew Penrose, "A strong law for the longest edge of the minimal spanning tree," Annals of Probability, vol. 27, pp. 246-260, 1999.
10. Christian Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '02), June 2002.
11. D.M.Blough, M.Leoncini, G.Resta, and P.Santi, "On the symmetric range assignment problem in wireless ad hoc networks," in Proc. 2nd IFIP International Conference on Theoretical Computer Science, 2002.
12. Colin Cooper and Alan Frieze, "On the connectivity of random k-th nearest neighbour graphs,".
13. P. Gupta and P. Kumar, "Capacity of wireless networks," Tech. Rep., University of Illinois, Urbana-Champaign, 1999.
14. P.Santi and D.M.Blough, "An evaluation of connectivity in mobile wireless ad hoc networks," in Proc. IEEE DSN, 2002, pp. 89-98.
15. Feng Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," 2002, Submitted for Wireless Networks.
16. Andrew Goldberg and Satish Rao, "Flows in undirected unit capacity networks," Tech. Rep. 97-103, NEC Research Institute. Inc, 1997.