Skip to main content
Log in

An improved spatially aware routing algorithm for mobile ad hoc network in inter-vehicle communication

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

A new algorithm called spatially aware routing algorithm with enhanced learning (SAREL) is proposed to guarantee the rationality of route selecting in inter-vehicle communication scenario. Firstly, the traffic model is discussed and set up by using Poisson distribution. Then we analyze the process of traffic evaluation with enhanced learning, and exploit movement estimation to assist state memorization. The improvement of algorithm is provided at last compared with our previous work. Simulation results show that SAREL algorithm could achieve better performance in packet delivery ratio, especially when network connection ratio is average.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Corson S, Macker J. Mobile Ad Hoc Network (MANET): Routing Protocol Preformance Issues and Evaluation Considerations (RFC 2501).http://www.ietf.org/rfc/rfc2501.txt, 1999-01-05.

  2. Johnson D, Maltz D, Hu Y. The Dynamic Source Routing Protocol for Mobile Ad hoc Networks.http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-09.txt, 2003-04-15.

  3. Perkins C, Royer E, Das S. Ad Hoc On-Demand Distance Vector Routing.Proceedings of 2 nd IEEE Workshop on Mobile Computing Systems and Applications. LA: IEEE Press, 1999,2: 90–100.

    Google Scholar 

  4. Karp B, Kung H T GRSP. Greedy Perimeter Stateless Routing for Wireless Networks.Proceedings of ACM-IEEE MobiCom'00. MA: ACM/IEEE Press, 2000,8: 243–254.

    Google Scholar 

  5. Tian J, Han L, Rothermel K,et al. Spatially Aware Packet Routing for Mobile Ad hoc Inter-Vehicle Radio Networks.http://www. informatik. uni-stuttgart. de/ipvr/vs/en/people/tianjg/itsc03.pdf, 2003-10-12.

  6. Blazevic L, Boudec J L, Giordano S. A Scalable Routing Method for Irregular Mobile Ad Hoc Network.http://icwww.epfl.ch/publications/documents/ICTECH_REPORT_200268.pdf, 2002-09-17.

  7. Li J, Jannoti J, Decouto D,et al. A Scalable Location Service for Geographic Ad Hoc Routing.Proceedings of ACM/IEEE MobiCom'00. MA: ACM Press, 2000,8: 120–130.

    Google Scholar 

  8. Tian J, Haehner J, Becker C,et al. Graph-Based Mobility Model for Mobile Ad Hoc Network Simulation.Proceedings of 35th Annual Simulation Symposium, CA: ANSS, 2002,4: 337–344.

    Google Scholar 

  9. Stepanov I. Integrating Realistic Mobility Models in Mobile Ad Hoc Network Simulation [Master Thesis], Stuttgart: University of Stuttgart, 2002.

    Google Scholar 

  10. Kubach U, Rothermel K. Exploiting Location Information for Infostation-Based Hoarding.Proceedings ACM SIGMO-BILE MobiCom'01. MOBICOM, 2001,7: 15–27.

    Google Scholar 

  11. Su W, Lee S, Gerla M. Mobility Prediction and Routing in Ad Hoc Wireless Network.International Journal of Network Management, 2001,11(1): 3–30.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhou Man-li.

Additional information

Foundation item: Supported by Open Laboratory Foundation by China Ministry of Education (TKLJ9903), Project CarTALK 2000 by the European Commission (IST-2000-28185) and Project FleetNet-Internet on the Road by the German Ministry of Education and Research (01AK025)

Biography: HAN Lu (1974-), male, Ph. D candidate, research direction; distributed artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, H., Man-li, Z., Jing, T. et al. An improved spatially aware routing algorithm for mobile ad hoc network in inter-vehicle communication. Wuhan Univ. J. Nat. Sci. 9, 931–934 (2004). https://doi.org/10.1007/BF02850802

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02850802

Key words

CLC number

Navigation