Research ArticleOpen AccessGoogle Scholar indexed
Opportunistic Unicast and Multicast Routing Protocol for VANET
Computer School, Wuhan University, Wuhan, China
Computer School, Wuhan University, Wuhan, China
Computer School, Wuhan University, Wuhan, China
Computer School, Wuhan University, Wuhan, China
Computer School, Wuhan University, Wuhan, China
Computer School, Wuhan University, Wuhan, China
- 1 Computer School, Wuhan University, Wuhan, China
- 2 Computer School, Wuhan University, Wuhan, China
- 3 Computer School, Wuhan University, Wuhan, China
- 4 Computer School, Wuhan University, Wuhan, China
- 5 Computer School, Wuhan University, Wuhan, China
- 6 Computer School, Wuhan University, Wuhan, China
Journal of Software Engineering and Applications·Volume 06 (2013)·Pages 319–327·Published 18 June 2013·DOI10.4236/jsea.2013.66040
Copy link · social · email
Abstract
Vehicular Ad Hoc Network (VANET) is a new paradigm of wireless network. Reliable and efficient unicast and multi cast routing protocols are critical for VANETs. As a possible solution, opportunistic routing (OR) has received much attention recently. This paper focuses on the aspect of soft security by building trust opportunistic forwarding model in VANET. It incorporates the trust mechanism into OR to enhance the security of routing in resisting malicious attacks. In this paper, we proposed a trusted minimum cost opportunistic unicast routing protocol (TMCOR) and a multicast routing protocol (TMCOM). The simulation results show TMCOR and TMCOM have good throughput, average delay and security gains compared with existing protocols.
KeywordsForwardingDegree of TrustTrusted Opportunistic RoutingVANET
- M. Li, K. Zeng and W. J. Lou, “Opportunistic Broadcast of Event-Driven Warning Messages in Vehicular Ad Hoc Networks with Lossy Links,” Computer Networks, Vol. 55, No. 10, 2011, pp. 2443-2464. doi:10.1016/j.comnet.2011.04.005
- X. Yu, H. Q. Guo and W.-C. Wong, “A Reliable Routing Protocol for VANET Communications,” 7th International Wireless Communications and Mobile Computing Conference (IWCMC), Istanbul, 4-8 July 2011, pp. 1748-1753.
- M. L. Zhang and R. S. Wolff, “A Border Node Based Routing Protocol for Partially Connected Vehicular Ad Hoc Networks,” Journal of Communications, Vol. 5, No. 2, 2010, pp. 130-143.
- S. Biswas and R. Morris, “ExOR: Opportunistic MultiHop Routing for Wireless Networks,” ACM SIGCOMM, Vol. 35, No. 4, 2005, pp. 133-144.
- Z. Zhong, J. Wang and S. Nelakuditi, “Opportunistic AnyPath Forwarding in Multi-Hop Wireless Mesh Networks,” Technical Report TR-2006-015, 2006.
- H. Dubois-Ferriere, M. Grossglauser and M. Vetterli, “LeastCost Opportunistic Routing,” Proceedings of 2007 Allerton Conference on Communication, Control, and Computing.
- K. Zeng, W. J. Lou, J. Yang and D. R. Brown III, “On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks,” Mobile Networks and Applications, Vol. 12, No. 5, 2007, pp. 347-357.
- E. Rozner, J. Seshadri, Y. A. Mehta and L. L. Qiu, “SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks,” IEEE Transactions on Mobile Computing, Vol. 8, No. 12, 2009, pp. 1622-1635.
- M. M. Lu, F. Li and J. Wu, “Efficient Opportunistic Routing in Utility-Based Ad Hoc Networks,” IEEE Transactions on Reliability, Vol. 58, No. 3, 2009, pp. 485-495.
- M. M. Lu and J. Wu, “Opportunistic Routing Algebra and its Applications,” Proceedings of INFOCOM, 2009, pp. 2374-2382.
- K. Zeng, W. Luo and H. Zhai, “On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks,” IEEE INFOCOM’08, Phoenix, 13-18 April 2008, pp. 816-824.
- K. Zeng, W. Lou and Y. Zhang, “Multi-Rate Geographic Opportunistic Routing in Wireless Ad Hoc Networks,” IEEE Milcom, Orlando, October 2007.
- Z. Zhong and S. Nelakuditi, “On the Efficacy of Opportunistic Routing,” Proceedings of SECON ’07, San Diego, 18-21 June 2007, pp. 441-450.
- K. Zeng, Z. Y. Yang and W. J. Lou, “Opportunistic Routing in Multi-Radio Multi-Channel Multi-Hop Wireless Networks,” IEEE Transactions on Wireless Communications, Vol. 9, No. 11, 2010, pp. 3512-3521.