Search

VANET (Vehicular Ad-hoc Network) is an emerging offshoot of MANETs (Mobile Ad-hoc Networks) with highly mobile nodes. It is envisioned to play a vital role in providing safety communications and commercial applications to the on-road public. Establishing an optimal route for vehicles to send packets to their respective destinations in VANETs is challenging because of quick speed of vehicles, dynamic nature of the network, and intermittent connectivity among nodes. This paper presents a novel position based routing technique called Dynamic Multiple Junction Selection based Routing (DMJSR) for the city environment. The novelty of DMJSR as compared to existing approaches comes from its novel dynamic multiple junction selection mechanism and an improved greedy forwarding mechanism based on one-hop neighbors between the junctions. To the best of our knowledge, it is the first ever attempt to study the impact of multiple junction selection mechanism on routing in VANETs. We present a detailed depiction of our protocol and the improvements it brings as compared to existing routing strategies. The simulation study exhibits that our proposed protocol outperforms the existing protocols like Geographic Source Routing Protocol (GSR), Enhanced Greedy Traffic Aware Routing Protocol (E-GyTAR) and Traffic Flow Oriented Routing Protocol (TFOR) in terms of packet delivery ratio, end-to-end delay, and routing overhead. [ABSTRACT FROM AUTHOR]

Vehicular Ad hoc Networks have gained high popularity for their interesting applications. However, routing in mobile networks is a challenging task and requires specialized routing protocols, which are designed to address mobile environment factors, such as inconsistent connectivity, high mobility, and communication obstacles. In this paper, we present a qualitative comparative study of well-known position based routing protocols for highway and city environment. Moreover, we investigate impact of different forwarding strategies on the behavior of routing protocols using extensive simulations and detailed analysis. The results show that greedy forwarding and improved greedy forwarding outperform directional and predictive forwarding strategies. It is also observed that dynamic junction selection is more suitable for routing in city environment. [ABSTRACT FROM AUTHOR]

Using vehicles as sensors allows to collect high amount of information on large areas without the need to deploy extensive infrastructures. Although cellular technologies are presently the only solution to upload data from vehicles to control centers, in the next future short range wireless technologies could be used to offload part of this data traffic through vehicle to vehicle and vehicle to roadside communications. In such scenario, the greedy forwarding (GF) position based routing is an interesting algorithm to efficiently route packets from vehicles to the destination. However, GF suffers from the well known problem of local minima, which causes part of the packets to remain blocked in certain areas of the scenario. To deal with this issue, we propose two novel routing algorithms, specifically designed for crowd sensing vehicular networks (CSVNs): GF with available relays (GFAVR), fully distributed and independent of the scenario, and GF with virtual roadside units (GFVIR), exploiting a preliminary design phase where local minima are located. Through extensive simulations performed in different realistic urban scenarios, results demonstrate that both algorithms allow to improve data delivery by 10–40%, with negligible overhead and limited increase of complexity. [ABSTRACT FROM AUTHOR]

Vehicular Ad-hoc network is an emerging technique for the Ad-hoc networks and Intelligent Transport System (ITS).VANET is mainly used for avoiding the accident and shares the traffic information among the vehicles. For sharing the information among the vehicles many challenges are faced, because the VANET has dynamic topology and high mobility model. To resolve this problem, VANET has many types of routing methods and various routing protocols, but those routing protocols do not fully resolve the problem during the communication. In this paper we discussed, Position based routing method and Non-delay tolerant routing protocols, its advantages and issues. [ABSTRACT FROM AUTHOR]

The objective of the paper is to analysis the connectivity performance of wireless network with new centralized and distributed network architecture. The problems in the wireless networks are finding a path to destination, connectivity maintenance and estimation of node positions. To solve these issues two algorithms are proposed, namely becon and bounding box algorithms in this work. The performance of the proposed approach is witnessed by analyzing the parameters like packet delivery ratio, throughput, delay and energy conservation ratio. [ABSTRACT FROM AUTHOR]