Asymptotic critical transmission radii for greedy forward routing in wireless ad hoc networks

IEEE Transactions on Communications

Volumn 57, Issue 5, 2009, Pages 1433-1443

  Wan, Peng Jun ^a   Yi, Chih Wei ^b   Wang, Lixin ^a   Yao, Frances ^c   Jia, Xiaohua ^c  

^a Illinois Institute of Technology   (United States)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Critical transmission radii; Greedy forward routing; Random deployment; Wireless ad hoc networks

Indexed keywords

BOUNDARY CURVATURE; CRITICAL TRANSMISSION RADII; GEOGRAPHIC ROUTING; GREEDY FORWARD; GREEDY FORWARD ROUTING; NETWORK NODE; POISSON POINT PROCESS; RANDOM DEPLOYMENT; SOURCE-DESTINATION PAIRS; TRANSMISSION RADIUS;

AD HOC NETWORKS; ASYMPTOTIC ANALYSIS; ROUTING ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS AD HOC NETWORKS;

EID: 66849109039     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.05.070307     Document Type: Article

References (11)

1. H. Takagi and L. Kleinrock, "Optimal transmission ranges for randomly distributed packet radio terminals," IEEE Trans. Commun., vol. COM-32, no. 3, pp. 246-257, Mar. 1984.
2. G. Xing, C. Lu, R. Pless, and Q. Huang, "On greedy geographic routing algorithms in sensing-covered networks," in Proc. 5th ACM International Symp. Mobile Ad Hoc Networking Computing, May 2004, pp. 31-42.
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer-Verlag, Mar. 2008.
4. G. Finn, "Routing and addressing problems in large metropolitan-scale internetworks," University of Southern California, Marina del Rey. Information Sciences Institute, Tech. Rep. ISI/RR-87-180, Mar. 1987.
5. B. Karp and H. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in Proc. 6th Annual International Conf. Mobile Computing Networking (MobiCom 2000), pp. 243-254.
6. M. D. Penrose, "The longest edge of the random minimal spanning tree," Annals Applied Probability, vol. 7, no. 2, pp. 340-361, May 1997.
7. M. D. Penrose, "A strong law for the longest edge of the minimal spanning tree," Annals Probability, vol. 27, no. 1, pp. 246-260, Jan. 1999.
8. 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, G. Yin, and Q. Zhang, eds. Birkhauser, Mar. 1998, pp. 547-566.
9. F. Baccelli and C. Bordenave, "The radial spanning tree of a poisson point process," Annals Applied Probability, vol. 17, no. 1, pp. 305-359, Feb. 2007.
10. P.-J.Wan, C.-W. Yi, F. Yao, and X. Jia, "Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks," in Proc. 7th ACM International Symp. Mobile Ad Hoc Networking Computing, May 2006, pp. 25-36.
11. F. Baccelli and P. Bremaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences. Springer, 2003.