Skip to main content
Log in

BIIR: A Beacon Information Independent VANET Routing Algorithm with Low Broadcast Overhead

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Most of the existing VANET routing protocols rely on information collected from beacons for making routing decisions such as next neighbor selection. Beacons are very small size hello messages that each vehicle broadcasts periodically. Owing to very small payload size of beacons as compared to the payload size of a data message, they can easily pass through even very weak links, through which a data message could never pass. Therefore, the use of beacon information for making routing decisions in a highly dynamic scenario such as VANETs may cause selection of routes through which data message can never be sent. Several researchers have given solutions that do not use beacon information for making routing decisions. But most of these solutions incorporate a large number of broadcasts to forward the data packets, causing wastage of bandwidth. In this paper, we present a beacon information independent geographic routing algorithm called BIIR, which reduces the number of broadcasts to forward the data packets by making intelligent use of information collected by the vehicle during previous route discovery attempts for a destination. Our simulation results have shown that the proposed algorithm outperforms the existing beacon less routing protocols in terms of the average number of broadcasts per data packet forwarding, packet delivery ratio and end to end delay experienced by the data messages.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Toor, Y., Muhlethaler, P., & Laouiti, A. (2008). Vehicle ad hoc networks: Applications and related technical issues. IEEE Communication Surveys and Tutorials, 10(3), 74–88.

    Article  Google Scholar 

  2. Sharef, B. T., Alsaqour, R. A., & Ismail, M. (2014). Vehicular communication ad hoc routing protocols: A survey. Elsevier’s Journal of Network and Computer Applications, 40, 363–396.

    Article  Google Scholar 

  3. Gerla, M., & Kleinrock, L. (2011). Vehicular networks and the future of the mobile internet. Elsevier’s Computer Networks, 55(2), 457–469.

    Article  Google Scholar 

  4. Li, F., & Wang, Y. (2007). Routing in vehicular ad hoc networks: A survey. IEEE Vehicular Technology Magazine, 2(2), 12–22.

    Article  Google Scholar 

  5. Sanchez, J. A., Ruiz, P. M., & Perez, R. M. (2009). Beacon less geographic routing made practical: Challenges, design guidelines and protocols. IEEE Communications Magazine, 47(8), 85–91.

    Article  Google Scholar 

  6. Ruiz, P.M., Cabrera V., Martinez, J.M., & Ros, F.J. (2010). BRAVE: Beacon less routing algorithm in vehicular environments. In IEEE 7th International Conference on Mobile Ad hoc and Sensor System (ICMASS’10), (pp. 709–714).

  7. Füßler, H., Hannes, H., Jörg, W., Martin, M., Wolfgang, E., et al. (2004). Contention based forwarding for street scenarios. In Proceedings of International Workshop on Intelligent Transport (IWIT), (pp. 155–160), Humburg, Germany.

  8. Heissenbuttel, M., Braun, T., Bernoulli, T., & Walchli, M. (2004). BLR: Beacon less routing algorithm for mobile ad-hoc networks. Elsevier’s Computer Communications, 27(11), 1076–1086.

    Article  Google Scholar 

  9. Braun, T., Heissenbüttel, M., & Roth, T. (2010). Performance of the beacon-less routing protocols in realistic scenarios. Elsevier’s Ad Hoc Networks, 8(1), 96–107.

    Article  Google Scholar 

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

  11. Lee, K. C., Cheng, P. C., & Gerla, M. (2010). GeoCross: A geographic routing protocol in the presence of loops in urban scenarios. Elsevier’s Ad Hoc Networks, 8(8), 474–488.

    Article  Google Scholar 

  12. Carnejo, A., Newport, C., Gollakota, S., Rao, J., & Giulli, T. J. (2013). Priortized gossip in vehicular ad hoc networks. Elsevier’s Ad Hoc Networks, 11(1), 397–409.

    Article  Google Scholar 

  13. Behrisch, M., Bieker, L., Erdmann,J., & Krajzewicz, D. (2011). SUMO-Simulation of urban mobility: An overview. In 3rd International Conference on Advances in System Simulation ICASS’11, (pp. 63–69).

  14. Sommer, C., German, R., & Dressler, F. (2011). Bidirectionally coupled network and road traffic simulation for improved IVC analysis. IEEE Transcations on Mobile Computing, 10(1), 3–15.

    Article  Google Scholar 

  15. Stanica, R., Chaput, E., & Beylot, A. L. (2011). Simulation of vehicular ad hoc networks: Challenges, review of tools and recommendations. Elsevier’s Computer Networks, 55(14), 3179–3188.

    Article  Google Scholar 

  16. http://www.omnetpp.org/. Accessed 30 Nov 2014.

  17. http://veins.car2x.org/. Accessed 30 Nov 2014.

Download references

Acknowledgments

The authors would like to thank all the anonymous reviewers and associate editor for their detailed comments and suggestions to improve the presentation of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Neeraj Kumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, N., Dave, M. BIIR: A Beacon Information Independent VANET Routing Algorithm with Low Broadcast Overhead. Wireless Pers Commun 87, 869–895 (2016). https://doi.org/10.1007/s11277-015-2620-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2620-y

Keywords

Navigation