Skip to main content

Congestion Control in a Location Service for VANETs

  • Conference paper
  • First Online:
  • 621 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11005))

Abstract

Vehicular ad-hoc networks are self-organized networks to provide communication between the vehicles. It is challenging to determine a routing protocol for the communication between the vehicles since the vehicles are moving in different speeds and directions, which causes a rapidly changing network topology. Other approaches in literature assign traffic to the best available path, possibly causing congestion in the network. In this paper, we determine the optimal route of intersections based on a penalty function to obtain load balancing in the network.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Ahmed, A.I.A., Gani, A., Ab Hamid, S.H., Khan, S., Guizani, N., Ko, K.: Intersection-based distance and traffic-aware routing (IDTAR) protocol for smart vehicular communication. In: 2017 13th International on Wireless Communications and Mobile Computing Conference (IWCMC), pp. 489–493. IEEE (2017)

    Google Scholar 

  2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  3. Jerbi, M., Senouci, S.M., Rasheed, T., Ghamri-Doudane, Y.: Towards efficient geographic routing in urban vehicular networks. IEEE Trans. Veh. Technol. 58(9), 5048–5059 (2009)

    Article  Google Scholar 

  4. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254. ACM (2000)

    Google Scholar 

  5. Lochert, C., Hartenstein, H., Tian, J., Fussler, H., Hermann, D., Mauve, M.: A routing strategy for vehicular ad hoc networks in city environments. In: IEEE Proceedings of the Intelligent Vehicles Symposium, 2003, pp. 156–161. IEEE (2003)

    Google Scholar 

  6. Nebbou, T., Fouchal, H., Lehsaini, M., Ayaida, M.: An urban location service for VANETs. In: Concurrency and Computation: Practice and Experience, pp. 1–14. Wiley (2017)

    Google Scholar 

  7. Seet, B.-C., Liu, G., Lee, B.-S., Foh, C.-H., Wong, K.-J., Lee, K.-K.: A-STAR: a mobile ad hoc routing strategy for metropolis vehicular communications. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 989–999. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24693-0_81

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Phillipson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

van Gulik, K., Phillipson, F., Fouchal, H. (2019). Congestion Control in a Location Service for VANETs. In: Renault, É., Boumerdassi, S., Bouzefrane, S. (eds) Mobile, Secure, and Programmable Networking. MSPN 2018. Lecture Notes in Computer Science(), vol 11005. Springer, Cham. https://doi.org/10.1007/978-3-030-03101-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03101-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03100-8

  • Online ISBN: 978-3-030-03101-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics