Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment (original) (raw)

Enhanced Junction Selection Mechanism for Routing Protocol in VANETs

Routing in infrastructure less vehicular ad hoc networks is challenging because of the dynamic network, predictable topology, high speed of nodes, and predictable mobility patterns. This paper presents an enhanced routing protocol specifically designed for city environments. It uses vehicular speed and directional density for dynamic junction selection. Simulation results exhibit increased packet delivery ratio while decreased end-to-end delay when compared with state of the art protocols.

A Survey on Junction Selection based Routing Protocols for VANETs

International Journal of Advanced Computer Science and Applications

To compare significant position-based routing protocols based on their underlying techniques such as junction selection mechanisms that provide vehicle-to-vehicle communications in city scenarios. Background: Vehicular Adhoc Network is the most significant offshoot of Mobile Adhoc Networks which is capable of organizing itself in an infrastructure-less environment. The network builds smart transportation which facilitates deriving in-terms of traffic safety by exchanging timely information in a proficient manner. Findings: The main features of vehicular adhoc networks pertaining to the city environment like high mobility, network segmentation, sporadic interconnections, and impediments are the key challenges for the development of an effective routing protocol. These features of the urban environment have a great impact on the performance of a routing protocol. This study presents a brief survey on the most substantial position-based routing schemes premeditated for urban inter-vehicular communication scenarios. These protocols are provided with their operational techniques for exchanging messages between vehicles. A comparative analysis is also provided, which is based on various important factors such as the mechanisms of intersection selection, forwarding strategies, vehicular traffic density, local maximum conquering methods, mobility of vehicular nodes, and secure message exchange. Application/Improvements: the outcomes observed from this paper motivate us to improve routing protocol in terms of security, accuracy, and reliability in vehicular adhoc networks. Furthermore, it can be employed as a foundation of references in determining literature that are worth mentioning to the routing in vehicular communications.

An Improved Vehicular Ad Hoc Routing Protocol for City Environments

2007 IEEE International Conference on Communications, 2007

The fundamental component for the success of VANET (Vehicular Ad hoc NETworks) applications is routing since it must efficiently handle rapid topology changes and a fragmented network. Current MANET (Mobile Ad hoc NETworks) routing protocols fail to fully address these specific needs especially in a city environments (nodes distribution, constrained but high mobility patterns, signal transmissions blocked by obstacles, etc.). In our current work, we propose an inter-vehicle ad-hoc routing protocol called GyTAR (improved Greedy Traffic Aware Routing protocol) suitable for city environments. GyTAR consists of two modules: (i) dynamic selection of the junctions through which a packet must pass to reach its destination, and (ii) an improved greedy strategy used to forward packets between two junctions. In this paper, we give detailed description of our approach and present its added value compared to other existing vehicular routing protocols. Simulation results show significant performance improvement in terms of packet delivery ratio, end-to-end delay, and routing overhead.

A traffic flow-oriented routing protocol for VANETs

EURASIP Journal on Wireless Communications and Networking, 2014

This paper presents a novel position-based routing protocol for vehicular ad hoc networks (VANETs) to enhance traffic safety and traffic organization and facilitate driving through a smart transportation system. The protocol is referred to as the traffic flow-oriented routing (TFOR) protocol for VANETs. It considers a real-time urban scenario with multi-lane and bi-directional roads. It chooses junction optimally considering vehicular traffic flows to accomplish robust routing paths and thereby forwarding the data packets. The new junction selection mechanism and routing between the junctions is based on two-hop neighbor information, which increases packet-delivery ratio and decreases end-to-end delay. We designed, implemented, and compared TFOR against existing routing protocols of VANETs (greedy-perimeter stateless routing (GPSR), geographic source routing (GSR), and enhanced greedy traffic-aware routing (E-GyTAR)). Simulation outcomes in urban scenarios show that TFOR minimizes average end-to-end delay and routing overhead by on average 15.3% and 19.5%, respectively, compared to GPSR. It reduces routing overhead up to 17% compared to GSR. TFOR maximizes packet-delivery ratio on an average of 17.5%, 10.7%, and 7.2% compared to GPSR, GSR, and E-GyTAR, respectively.

Research Article Neighboring and Connectivity-Aware Routing in VANETs

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered longdistance packets with reasonable packet delay than A-STAR.

Routing in VANET’s City Scenario using Back-bone Node Hop Greedy Algorithm

international journal of engineering trends and technology, 2014

Using advanced WLAN technologies; vehicular ad hoc networks (VANETs) have become useful and valuable for their wide variety of unique applications, such as safety on roads, multimedia content sharing, etc. VANETs are constrained by the high mobility of vehicles and the frequent connectivity problems. Destination positions can be found using flooding in most of the protocols in city environments. Further, in the case of sparse and void regions, recovery strategies are used which increases hop count. The minimum weighted algorithm based on distance or connectivity to select intermediate intersections are adopted in some geographic routing protocols. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. The path with higher hop counts has maximum hop counts. In this paper, we hereby propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity...

Towards efficient routing in vehicular ad hoc networks

2007

Multi-hop data delivery through Vehicular Adhoc Networks is challenging since it must efficiently handle rapid topology changes and a fragmented network. This paper proposes a new intersection-based geographical routing protocol called GyTAR (improved Greedy Traffic Aware Routing protocol) and capable to find robust routes within city environments. GyTAR consists of two modules: (i) dynamic selection of the junctions through which a packet must pass to reach its destination, and (ii) an improved greedy strategy used to forward packets between two junctions. GyTAR assumes the existence of an accurate traffic-information system that it requires to select paths with high connectivity. To address this issue, we also propose a completely decentralized mechanism for the estimation of traffic density in city-roads called IFTIS for Infrastructure-Free Traffic Information System. The proposed routing protocol shows significant performance improvement in a comparative simulation study with other routing approaches.

Neighboring and Connectivity-Aware Routing in VANETs

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no roadside units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

Article A Multimetric, Map-Aware Routing Protocol for VANETs in Urban Areas

2014

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery.

A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges

Journal of Digital Information Management, 2019

The Vehicle ad hoc Networks (VANET) are attracting more and more manufacturers and researchers' attention. Many challenges must be addressed before VANETs can be successfully deployed. The most challenging issue in VANETs is designing of routing mechanisms and efficient medium access control protocols so that safety related and other application messages can be timely and reliably disseminated through VANETs. The aim of VANET routing protocols is establishing of an efficient route between network nodes that should adapt to the rapid changes in the network topology. However, routing protocols in VANET is a challenging issue, mainly due to the rapidly changing topology of vehicles and frequent fragmentation in the network. In this work, we review the most frequent routing protocols for VANETs and then we provide a taxonomy of these protocols based on the used relay selection technique. We compare and discuss these routing protocols according to different criteria. Moreover, we discuss several issues and prerequisite that should be considered when designing VANETs routing. Finally, we highlight the most important aspects and future directions that could be explored in the design of a new Geocast routing solution for vehicular routing algorithms as a contribution for further work.