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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to √ lnn/πn is asymptotically almost surely equal to √1/(2/3 - √3 /2π) ≈ 1.6.

Original languageEnglish
Pages (from-to)1433-1443
Number of pages11
JournalIEEE Transactions on Communications
Issue number5
StatePublished - 16 Jun 2009


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

Fingerprint Dive into the research topics of 'Asymptotic critical transmission radii for greedy forward routing in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this