Skip to main content

Geographic Probabilistic Routing Protocol for Wireless Mesh Network

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4847))

Included in the following conference series:

Abstract

This paper presents GPR (Geographic Probabilistic Routing protocol), an opportunistic routing protocol worked between mesh routers in WMNs (Wireless Mesh Networks). In GPR, nodes detect the link condition by probe packets. In order to send a packet, the sender selects a candidate subset. The nodes who successfully received the packet send ACK according to their priority. If there are no ACKs from other candidates, instead of sending ACK immediately, the candidate broadcasts ACK and transmits the packet at transmission-probability. The extensive simulation results show that GPR is promising to achieve higher throughput and better scalability compared to the reference method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: A survey. Computer Networks Journal  (2005)

    Google Scholar 

  2. Chachulski, S., Jennings, M., Katti, S., Katabi, D.: Trading Structure for Randomness in Wireless Opportunistic Routing. In: Proc. of ACM SIGCOMM, ACM Press, New York (August 2007)

    Google Scholar 

  3. Rozner, E., Seshadri, J., Mehta, Y., Qiu, L.: Simple Opportunistic Routing Protocol for Wireless Mesh Networks. In: Proc of the 2nd IEEE Workshop on WiMesh, IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  4. Biswas, S., Morris, R.: ExOR: Opportunistic multi-hop routing for wireless networks. In: Proc. of ACM SIGCOMM, ACM Press, New York (August 2005)

    Google Scholar 

  5. Biswas, S., Morris, R.: Opportunistic routing in multi hop wireless networks. In: ACM HotNets (August 2003)

    Google Scholar 

  6. Couto, D.D., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: Proc. of ACM MOBICOM, ACM Press, New York (September 2003)

    Google Scholar 

  7. Draves, R., Padhye, J., Zill, B.: Comparison of routing metrics for multi-hop wireless networks. In: Proc. of ACM SIGCOMM, ACM Press, New York (August 2004)

    Google Scholar 

  8. Jain, S., Das, S.: Exploiting path diversity in the link layer in wireless ad hoc networks. In: Proc. of the 6th IEEE WoWMoM Symposium, IEEE Computer Society Press, Los Alamitos (June 2005)

    Google Scholar 

  9. Johnson, D.B., Maltz, D.A., Broch, J.: DSR: The dynamic source routing protocol for multihop wireless ad hoc networks. In: Ad Hoc Networking (2001)

    Google Scholar 

  10. The network simulator – ns-2, http://www.isi.edu/nsnam/ns/

  11. Perkins, C.E., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proc. of ACM SIGCOMM, ACM Press, New York (1994)

    Google Scholar 

  12. Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, IEEE Computer Society Press, Los Alamitos (February 1999)

    Google Scholar 

  13. Mauve, M., Widmer, J., Hartenstein, H.: A Survey on Position Based Routing in Mobile Ad-hoc Networks. IEEE Network Magazine 15(6), 30–39 (2001)

    Article  Google Scholar 

  14. Basagni, S., et al.: A Distance Routing Effect Algorithm for Mobility (Dream). In: Proc. 4th Annual ACM/IEEE Int. Conf. Mobile Computing and Networking, MOBICOM, IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  15. Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: Proc. 11th Canadian Conf. Comp. Geo., Vancouver (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ming Xu Yinwei Zhan Jiannong Cao Yijun Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, N., Ding, L., Li, M., Wu, M. (2007). Geographic Probabilistic Routing Protocol for Wireless Mesh Network. In: Xu, M., Zhan, Y., Cao, J., Liu, Y. (eds) Advanced Parallel Processing Technologies. APPT 2007. Lecture Notes in Computer Science, vol 4847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76837-1_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76837-1_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76836-4

  • Online ISBN: 978-3-540-76837-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics