Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks

In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally constructed by using only one hop information if the transmission radius is set no less than the largest edge length of the RNG. The largest RNG edge length is called the critical transmission radius for the RNG. In this paper, we consider the RNG over a Poisson point process with mean density in a unit-area disk. Let 0 = 1/ ( 2 3 3 2 )

• Type: Journal
• Year: 2010
• Where: TWC
• Authors: Chih-Wei Yi, Peng-Jun Wan, Lixin Wang, Chao-Min Su
• Keywords: Artificial Intelligence, RNG Edge Length, Transmission Radius, TWC 2010, Wireless Ad Hoc Networks