@inproceedings{8e642aeacd6242b1ba7378e9b421aa2d,
title = "On the longest RNG edge of wireless ad hoc networks",
abstract = "Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requirement on the maximum transmission radius by those applications of RNG. In this paper, we derive the precise asymptotic probability distribution of the maximum edge length of the RNG on a Poisson point process over a unit-area disk. Since the maximum RNG edge length is a lower bound on the critical transmission radius for greedy forward routing, our result also leads to an improved asymptotic almost sure lower bound on the critical transmission radius for greedy forward routing.",
author = "Wan, {Peng Jun} and Lixin Wang and Frances Yao and Tsi-Ui Ik",
year = "2008",
month = sep,
day = "22",
doi = "10.1109/ICDCS.2008.16",
language = "English",
isbn = "9780769531724",
series = "Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008",
pages = "329--336",
booktitle = "Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008",
note = "null ; Conference date: 17-07-2008 Through 20-07-2008",
}