Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks

IEEE Transactions on Wireless Communications

Volumn 9, Issue 2, 2010, Pages 614-623

  Yi, Chih Wei ^a   Wan, Peng Jun ^b   Wang, Lixin ^b   Su, Chao Min ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b Illinois Institute of Technology   (United States)

Author keywords

Critical transmission radii; Poisson point processes; Relative neighborhood graphs; Thresholds; Wireless ad hoc networks

Indexed keywords

EDGE LENGTH; MEAN DENSITY; POISSON POINT PROCESS; RELATIVE NEIGHBORHOOD GRAPHS; SHARP THRESHOLD; THRESHOLDS; TOPOLOGY CONTROL; TRANSMISSION RADIUS; UNIT-AREA DISK;

ASYMPTOTIC ANALYSIS; POISSON DISTRIBUTION; POISSON EQUATION; TELECOMMUNICATION NETWORKS; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 76949083347     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2010.5403542     Document Type: Article

References (15)

1. M. Penrose, Random Geometric Graphs. Oxford University Press, 2003.
2. E. N. Gilbert, "Random plane networks," J. Society Industrial Applied Mathematics, vol.9, no.4, pp. 533-543, Dec. 1961.
3. B. Karp and H. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in Proc. 6th Annual International Conf. Mobile Computing Netw. (MobiCom '00), Aug. 2000, pp. 243-254.
4. P. Bose, P. Morin, I. Stojmenovíc, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," Wireless Netw., vol.7, no.6, pp. 609-616, Nov. 2001. (Pubitemid 33091058)
5. G. T. Toussaint, "The relative neighbourhood graph of a finite planar set," Pattern Recognition, vol.12, no.4, pp. 261-268, 1980.
6. H. Dette and N. Henze, "The limit distribution of the largest nearestneighbour link in the unit d-cube," J. Applied Probability, vol.26, no.1, pp. 67-80, 1989.
7. T. K. Philips, S. S. Panwar, and A. N. Tantawi, "Connectivity properties of a packet network radio model," IEEE Trans. Inf. Theory, vol.35, no.5, pp. 1044-1047, Sept. 1989.
8. M. D. Penrose, "The longest edge of the random minimal spanning tree," Annals Applied Probability, vol.7, no.2, pp. 340-361, May 1997.
9. P. Santi and D. M. Blough, "The critical transmitting range for connectivity in sparse wireless ad hoc networks," IEEE Trans. Mobile Computing, vol.2, no.1, pp. 25-39, Jan.-Mar. 2003.
10. G. Kozma, Z. Lotker, M. Sharir, and G. Stupp, "Geometrically aware communication in random wireless networks," in Proc. Twenty-Third Annual ACM Symp. Principles Distributed Computing, July 2004, pp. 310-319.
11. A. Goel, S. Rai, and B. Krishnamachari, "Sharp thresholds for monotone properties in random geometric graphs," in Proc. 36th ACM Symp. Theory Computing (STOC 2004), June 2004, pp. 580-586.
12. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization Applications: A Volume in Honor of W. H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang, Eds. Birkhauser, Mar. 1998, pp. 547-566.
13. P.-J. Wan and C.-W. Yi, "Asymptotic critical transmission ranges for connectivity in wireless ad hoc networks with Bernoulli nodes," in IEEE Wireless Commun. Netw. Conf. (WCNC 2005), Mar. 2005.
14. 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 Netw. Computing, May 2006, pp. 25-36.
15. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, "On the spanning ratio of gabriel graphs and beta-skeletons," in Proc. Latin American Theoretical Infocomatics (LATIN), 2002.