A new distributed routing protocol using partial traffic information for vehicular ad hoc networks
- 373 Downloads
In vehicular ad hoc networks, road traffic information can be used to support efficient routing. However, dissemination of up-to-date global road traffic information usually consumes considerable network resources and may also lead to the scalability issue. On the other hand, the highly dynamic nature of road traffic information makes it difficult to collect and disseminate such information in a timely fashion. Outdated information can lead to inefficient routing decisions and thus degraded routing performance. This paper proposes a distributed routing protocol using partial accurate routing information (RPPI). In RPPI, each node uses accurate local traffic information in its local zone and statistical traffic information in remote areas for route selection, which can significantly reduce the communication overhead. Simulation results show that RPPI can achieve better routing performance in terms of end-to-end packet delivery ratio and end-to-end packet delivery delay as compared with existing work.
KeywordsDistributed routing Partial traffic information Vehicular ad hoc network
This work was supported by the NSF of China (NSFC) under Grant Nos. 61101133, 61173158, 61372105, and 61271041, the Natural Science Foundation of Jiangsu Province of China under Grant No. BK2012125, the Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20110092110007, and the Research Fund of National Mobile Communications Research Laboratory, Southeast University, China, under Grant No. 2014A02.
- 1.Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2011). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press.Google Scholar
- 2.Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of ACM SIGCOMM’03 (pp. 27–34).Google Scholar
- 4.Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Technical Report CS-200006, Department of Computer Science, Duke University, Durham, NC.Google Scholar
- 5.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking (pp. 252–259).Google Scholar
- 6.Burns, B., Brock, O., & Levine B. N. (2006). MV routing and capacity building in disruption tolerant networks. In Proceedings of IEEE INFOCOM’06 (pp. 398–408).Google Scholar
- 7.Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proceedings of IEEE INFOCOM’06 (pp. 1–11).Google Scholar
- 9.Leontiadis, I., & Mascolo, C. (2007). GeOpps: Geographical opportunistic routing for vehicular networks. In Proceedings of IEEE WOWMOM’07 (pp. 1–6).Google Scholar
- 10.Zhao, J., & Cao, G. (2006). VADD: Vehicle-assisted data delivery in vehicular ad hoc networks. In Proceedings of IEEE INFOCOM’06 (pp. 1–12).Google Scholar
- 11.Jeong, J., Guo, S., Gu, Y., He, T., & Du, D. (2009). TBD: Trajectory-based data forwarding for light-traffic vehicular networks. In Proceedings of IEEE ICDCS’09 (pp. 231–238).Google Scholar
- 12.Guo, S., Jeong, J., Gu, Y., Cao, Q., Liu, M., & He, T. (2011). Utilizing shared vehicle trajectories for data forwarding in vehicular networks. In Proceedings of IEEE INFOCOM’11 (pp. 441–445).Google Scholar
- 13.Wu, H., Fujimoto, R., Guensler, R., & Hunter, M. (2004). MDDV: A mobility-centric data dissemination algorithm for vehicular networks. In Proceedings of ACM VANET’04 (pp. 47–56).Google Scholar
- 14.Agarwal, A., Starobinski, D., & Little, T. D. C. (2012). Phase transition of message propagation speed in delay-tolerant vehicular networks. IEEE Transition on Intelligent Transportation Systems, 13(1), 249–263.Google Scholar
- 15.Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques (SIMUTools) 2009 (pp. 56–74).Google Scholar
- 17.Liu, Y., Xiong, N., Zhao, Y., Vasilakos, A. V., Gao, J., & Jia, Y. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810–816.Google Scholar
- 18.ETH Zurich Vehicular Network Traces. http://lst.inf.ethz.ch/ad-hoc/car-traces/.
- 19.Baumann, R., Naumov, V., & Gross, T. (2006). An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces. In Proceeidngs of ACM Mobihoc’06 (pp. 108–119).Google Scholar
- 20.Ekman, F., Keränen, A., Karvo, J., & Ott, J. (2008). Working day movement model. In Proceedings of the ACM MobilityModels’08 (pp. 33–40).Google Scholar