A Collision Aware Opportunistic Routing Protocol for VANETs in Highways

A reliable and effective packet delivery system is challenging issue due to VANET’s intense characteristics. Broadcast nature of opportunistic routing makes it more effective than the traditional routing in packet delivery and improves the efficiency of sending packets. One of the main problems in VANETs is the packet loss due to collision. Because of the rapid movement of vehicles, frequent changes in topology and the occupancy of the channel by beacon packets, high number of collisions occur in VANETs. In this paper, a new collision-aware opportunistic routing protocol called SCAOR is proposed for highways. To reduce collisions, the design of the SCAOR protocol is composed of two phases. In the first phase, a new metric called QAD, is presented and it contains three parameters of link quality, packet advancement, and node density. In the second phase, a cluster-based scheduling algorithm called CSA is provided for sending periodic beacon packets to reduce the occupancy time of the channel. The QAD metric along with the CSA scheduling algorithm alleviate collisions and improve the efficiency of the SCAOR protocol with respect to the specific features of the VANETs. The performance of the SCAOR routing protocol is compared to the EXOR and LSGO opportunistic routing protocols. Experimental results show improved network performance in terms of packet delivery, end-to-end delay, packet loss and throughput.

[1]  F. P. Fontan,et al.  Node Density Estimation in VANETs Using Received Signal Power , 2015 .

[2]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[3]  Ozan K. Tonguz,et al.  On the Routing Problem in Disconnected Vehicular Ad-hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  W. Enkelmann.  FleetNet - applications for inter-vehicle communication , 2003, IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No.03TH8683).

[5]  Srihari Nelakuditi,et al.  On the Efficacy of Opportunistic Routing , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[6]  Eduardo Cerqueira,et al.  Context-aware opportunistic routing in mobile ad-hoc networks incorporating node mobility , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[7]  Olaf Landsiedel,et al.  Let the tree Bloom: scalable opportunistic routing with ORPL , 2013, SenSys '13.

[8]  Zhenyu Yang,et al.  Location-Aided Opportunistic Forwarding in Multirate and Multihop Wireless Networks , 2009, IEEE Transactions on Vehicular Technology.

[9]  Qiang Ni,et al.  An Evolving Graph-Based Reliable Routing Scheme for VANETs , 2013, IEEE Transactions on Vehicular Technology.

[10]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[11]  Wenjing Lou,et al.  On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks , 2007, Mob. Networks Appl..

[12]  Changle Li,et al.  LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs , 2014, EURASIP Journal on Wireless Communications and Networking.