skip to main content
10.1145/1132905.1132909acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
Article

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

Published: 22 May 2006 Publication History

Abstract

Greedy forward routing (abbreviated by GFR)in wireless ad hoc networks is a localized geographic routing in which each node discards a packet if one 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 of the packet. If all nodes have the same transmission radii, the critical transmission radius for GFR is the smallest transmission radius which ensures that packets can be delivered between any source-destination pairs. In this paper, we study the asymptotic critical transmission radius for GFR in randomly deployed wireless ad hoc networks. We assume that the network nodes are represented by a Poisson point process of density n over a convex compact region of u it area with bounded curvature.Let ß0 = 1/ (⅔√3 over 2π) ≈ 1.62. We show that √ß0 1n n over πn is asymptotically almost surely (abbreviated by a.a.s.) the threshold of the critical transmission radius for GFR.I other words,for ß > ß0 if the trasmission radius is √ß 1n n over πn, it is a.a.s. packets can be delivered between any source-destination pairs; for any ß < ß0 if the transmission radius is √ß 1n noverπn, it is a.a.s. packets can't be delivered between some source-destination pair.

References

[1]
F. Baccelli and P. Bremaud. Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences Springer, February 12 2003.
[2]
G. Finn. Routing and addressing problems in large metropolitan-scale internetworks, March 1987. Techical Report ISI Research Report ISU/RR-87-180.
[3]
J. Geißler and H.vo Weizsäcker. Geometric measure theory. Script.
[4]
B. Karp and H. Kung. Gpsr: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom '00), pages 243--254, 2000.
[5]
F. Lin and X. Yang, editors. Geometric Measure Theory: An Introduction International Press, 2003.
[6]
H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications COM-32(3):246--257, March 1984.
[7]
G. Xing, C. Lu, R. Pless, and Q. Huang. On greedy geographic routing algorithms in sensing-covered networks. I Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing pages 31--42, May 24-26 2004.

Cited By

View all
  • (2020)Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional SpacesSensor Technology10.4018/978-1-7998-2454-1.ch069(1459-1493)Online publication date: 2020
  • (2018)Characterizing Data Deliverability of Greedy Routing in Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2017.273700517:3(543-559)Online publication date: 1-Mar-2018
  • (2017)Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional SpacesHandbook of Research on Wireless Sensor Network Trends, Technologies, and Applications10.4018/978-1-5225-0501-3.ch013(317-352)Online publication date: 2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MobiHoc '06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
May 2006
378 pages
ISBN:1595933689
DOI:10.1145/1132905
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. greedy forward routing
  2. random deployment
  3. wireless ad hoc networks

Qualifiers

  • Article

Conference

MobiHoc06
Sponsor:

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional SpacesSensor Technology10.4018/978-1-7998-2454-1.ch069(1459-1493)Online publication date: 2020
  • (2018)Characterizing Data Deliverability of Greedy Routing in Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2017.273700517:3(543-559)Online publication date: 1-Mar-2018
  • (2017)Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional SpacesHandbook of Research on Wireless Sensor Network Trends, Technologies, and Applications10.4018/978-1-5225-0501-3.ch013(317-352)Online publication date: 2017
  • (2016)Critical Range for Wireless NetworksEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_95(471-475)Online publication date: 22-Apr-2016
  • (2015)On asymptotic statistics for geometric routing schemes in wireless ad hoc networksIEEE/ACM Transactions on Networking10.1109/TNET.2014.230347723:2(559-573)Online publication date: 1-Apr-2015
  • (2015)Characterizing data deliverability of greedy routing in wireless sensor networks2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2015.7338328(292-300)Online publication date: Jun-2015
  • (2014)Large Overlaid Cognitive Radio Networks: From Throughput Scaling to Asymptotic Multiplexing GainIEEE Transactions on Wireless Communications10.1109/TWC.2014.042814.13096313:6(3042-3055)Online publication date: Jun-2014
  • (2013)Three-dimensional greedy routing in large-scale random wireless sensor networksAd Hoc Networks10.1016/j.adhoc.2010.10.00311:4(1331-1344)Online publication date: 1-Jun-2013
  • (2013)Deliverability analysis of greedy routing in the spherical cap 3D sensor networksScience China Information Sciences10.1007/s11432-013-4811-z56:7(1-12)Online publication date: 21-May-2013
  • (2012)On the impact of transmission radius on routing efficiencyProceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications10.1145/2248326.2248329(7-12)Online publication date: 11-Jun-2012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media