On the longest RNG edge of wireless ad hoc networks

Peng Jun Wan*, Lixin Wang, Frances Yao, Tsi-Ui Ik

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
Pages329-336
Number of pages8
DOIs
StatePublished - 22 Sep 2008
Event28th International Conference on Distributed Computing Systems, ICDCS 2008 - Beijing, China
Duration: 17 Jul 200820 Jul 2008

Publication series

NameProceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Conference

Conference28th International Conference on Distributed Computing Systems, ICDCS 2008
CountryChina
CityBeijing
Period17/07/0820/07/08

Fingerprint Dive into the research topics of 'On the longest RNG edge of wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this