Improving Performance of Opportunistic Routing Protocol using Fuzzy Logic for Vehicular Ad-hoc Networks in Highways

Vehicular ad hoc networks are an emerging technology with an extensive capability in various applications including vehicles safety, traffic management and intelligent transportation systems. Considering the high mobility of vehicles and their inhomogeneous distributions, designing an efficient routing protocol seems necessary. Given the fact that a road is crowded at some sections and is not crowded at the others, the routing protocol should be able to dynamically make decisions. On the other hand, VANET networks environment is vulnerable at the time of data transmission. Broadcast routing, similar to opportunistic routing, could offer better efficiency compared to other protocols. In this paper, a fuzzy logic opportunistic routing (FLOR) protocol is presented in which the packet rebroadcasting decision-making process is carried out through the fuzzy logic system along with three input parameters of packet advancement, local density, and the number of duplicated delivered packets. The rebroadcasting procedures use the value of these parameters as inputs to the fuzzy logic system to resolve the issue of multicasting, considering the crowded and sparse zones. NS-2 simulator is used for evaluating the performance of the proposed FLOR protocol in terms of packet delivery ratio, the end-to-end delay, and the network throughput compared with the existing protocols such as: FLOODING, P-PERSISTENCE and FUZZBR. The performance comparison also emphasizes on effective utilization of the resources. Simulations on highway environment show that the proposed protocol has a better QoS efficiency compared to the above published methods in the literature

Adaptive Beacon Broadcast in Opportunistic Routing for VANETs

Broadcast of beacon messages including geographic coordinates, node speeds, and directions are among the most commonly used methods in routing protocols of VANETs to obtain neighboring positions. Broadcast of periodic beacon messages in fixed time intervals will reduce network performance due to increased channel load and contention. In this paper, an adaptive update strategy for sending beacon messages according to the VANETs’ characteristics (position, speed, and direction) and the nature of broadcast wireless channel in an opportunistic routing strategy is studied. It is based on two rules: 1) an estimation of the lifetime of the links between vehicles’ beacon messages are sent after the expiration of the estimated time to inform their local topology and 2) if the forwarding set of consecutively received data packets is changed, a beacon message is sent to maintain the accuracy of the topology. The simulation results show that the proposed strategy significantly reduces the cost of routing and improves network performance in terms of packet-delivery ratios, average end-to-end delay, and routing overhead

A 3-Parameter Routing Cost Function for Improving Opportunistic Routing Performance in VANETs

Dynamic topology and unstable wireless links make efficient data delivery in vehicular ad-hoc networks (VANETs) a challenging issue. To tackle this issue, several routing strategies for finding a route with high reliability and low latency in VANETs have been proposed. One of theme is Opportunistic routing (OR) paradigm which can improve the reliability of routing in vehicular ad-hoc networks (VANETs) by broadcasting transmission features and employing additional backup links from other neighboring nodes. In this paradigm a node sends the packet to a number of its neighbors called forwarding set. The way transmission priority is assigned to the nodes in the forwarding set can highly affect the performance of opportunistic routing. In this Paper a new measure composed of three parameters is proposed for selecting the best forwarding node. Simulations on highway environment indicate that the proposed method improves the routing performance in all grounds of QoS compared to the other published methods in the literature