Skip to main content

Crossroads Optimal Geographic Routing for Vehicular Ad Hoc Networks in City Scenario

  • Conference paper
Internet of Vehicles – Technologies and Services (IOV 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8662))

Included in the following conference series:

Abstract

As it is a big challenge to adapt routing protocol to different applications and dynamic network topology in Mobile Ad Hoc Networks, geographic routing protocols such as Greedy Perimeter Stateless Routing protocol (GPSR) have attracted significant attention. However, unintelligent routing path selecting strategy and outdated neighbor information lead to unwanted performance decline. In this paper, we propose a routing protocol called Crossroads Optimal Geographic Routing protocol (COGR) for vehicular ad hoc networks (VANET) in city scenario, which features on intelligent routing path planning, efficient recovery strategy from dead holes and feasible neighbor position distribution protocol without map information ahead. Through simulation experiments, we prove that COGR does substantially improve performance such as packet delivery ratio, delay and throughput in highly dynamic network environment as VANET in city scenario.

* This work was partly supported byNSFC (61272515, 61372108, 61121061), Ph.D Programs Foundation of Ministry of Education of China (No. 20110005110011), Fundamental Research Funds for the Central Universities (No. 2014RC1102), and Beijing Higher Education Young Elite Teacher Project (YETP0474).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Funke, S., Milsavljevic, N.: Guaranteed-delivery Geographic Routing under uncertain node locations. In: 26th IEEE International Conference on Computer Communications, pp. 1244–1252 (May 2007)

    Google Scholar 

  2. Xiaojing, X., Zehua, Z., Xin, W.: Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks. In: IEEE International Conference on Computer Communications, pp. 2296–2300. IEEE (2007)

    Google Scholar 

  3. Lochert, C., Mauve, M., Füßler, H.: Geographic Routing in City Scenarios. ACM SIGMOBILE Mobile Computing and Communications 9(1), 69–72 (2005)

    Google Scholar 

  4. Liansheng, H., Weibing, L., Nanxiang, L.: Research and improvement of greedy geographical routing protocol. Computer Engineering and Applications 43, 160–162 (2007)

    Google Scholar 

  5. Guoming, T., Yi, X., Jiuyang, T., Weidong, X.: Regional perimeter routing for GPSR based on left & right-hand rules. Application Research of Computers 38(3), 1109–1101 (2011)

    Google Scholar 

  6. Quan, J.C., Kanhere, S.S., Mahbub, H., Kun, C.L.: Adaptive Position Update in Geographic Routing. In: IEEE International Conference, vol. 9, pp. 4046–4051 (June 2006)

    Google Scholar 

  7. Zhenyuan, W., Musheng, T.: Nonlinear equations of the Newton iteration. Electric Information and Control Engineering (ICEICE), 3380–3383 (April 2011)

    Google Scholar 

  8. Caizzone, G., Erangoli, W., Giacomazzi, P., Verticale, G.: An enhanced GPSR Routing Algorithm for TDMA-based Ad-Hoc Networks. In: IEEE Global Telecommunication Conference, pp. 2616–2621 (January 2005)

    Google Scholar 

  9. Ma, X., Sun, M.-T., Liu, X., Zhao, G.: Improving Geographical Routing for Wireless Networks with an Efficient Path Pruning Algorithm. Sensor and Ad Hoc Communications and Networks 1, 246–255 (2007)

    Google Scholar 

  10. Kar, B., Kung, H.T.: GPSR Greedy Perimeter Stateless Routing for Wireless Networks. In: Proc. the ACM/IEEE International Conf. on Mobile Computing and Networking (MobiCom), pp. 243–254 (August 2000)

    Google Scholar 

  11. Biao, Z., YengZhong, L., Gerla, M.: ’Direction’ assisted Geographic Routing for mobile ad hoc networks. In: Military Communication Conference IEEE, pp. 1–7 (January 2009)

    Google Scholar 

  12. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: ACM DIALM Wordkshop, pp. 48–55. ACM Press, Seattle (1999)

    Google Scholar 

  13. Kunhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Gemetric ad hoc routing: of theory and practice. In: Proceedings of PODC 2003, pp. 63–72. ACM Press, Boston (2003)

    Google Scholar 

  14. Jing, Z., Guohong, C.: VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks. IEEE Transactions on Vehicular Technology 57(3), 1910–1922 (2008)

    Article  Google Scholar 

  15. Lenders, V., May, M., Plattner, B.: Density-Based Anycast: A Robust Routing Strategy for Wireless Ad Hoc Networks. IEEE/ACM Transactions on Networking 16(4), 852–863 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, Z., Chen, K., Zheng, J., Hao, Y., Yang, Y., Qiu, X. (2014). Crossroads Optimal Geographic Routing for Vehicular Ad Hoc Networks in City Scenario. In: Hsu, R.CH., Wang, S. (eds) Internet of Vehicles – Technologies and Services. IOV 2014. Lecture Notes in Computer Science, vol 8662. Springer, Cham. https://doi.org/10.1007/978-3-319-11167-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11167-4_20

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11166-7

  • Online ISBN: 978-3-319-11167-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics