Vehicular ad hoc networks have emerged as a promising research area. Designing a realistic coverage protocol for RSU deployment in vehicular networks presents a challenge due to different service area, assorted mobility patterns, and resource constraints. In order to resolve these problems, this paper proposes a geometry-based sparse coverage protocol GeoCover , which aims to consider the geometrical attributes of road networks, movement patterns of vehicles and resource limitations. By taking the dimensions of road segments into account, GeoCover provides a buffering operation to suit different types of road topology. By discovering hotspots from trace files, GeoCover is able to depict the mobility patterns and to discover the most valuable road area to be covered. To solve the resource-constrained coverage problem, we provide two variants of sparse coverage which take into consideration budget constraints and quality constraints, respectively. The coverage problem is resolved by both genetic algorithm and greedy algorithm. The simulation results verify that our coverage protocol is reliable and scalable for urban vehicular networks.

GeoCover: An efficient sparse coverage protocol for RSU deployment over urban VANETs

Vehicular ad hoc networks have emerged as a promising field in wireless networking research. Unlike traditional wireless sensor networks, vehicular networks demand more consideration due to their assorted road topology, the high mobility of vehicles and the irregularly placed feasible region of deployment. As one of the most complex issues in vehicular networks, coverage strategy has been researched extensively, especially in complex urban scenarios. However, most existing coverage approaches are based on an ideal traffic map consisting of straight lines and nodes. These simplifications misrepresent the road networks. In order to provide more realistic vehicular networks deployment, this paper proposes a geometry-based coverage strategy to handle the deployment problem over urban scenarios. By taking the shape and area of road segments into account, our scheme suits different kinds of road topology and effectively solves the maximum coverage problem. To evaluate the effectiveness of our scheme, we compare this coverage strategy with α-coverage algorithm. The simulation result verifies that geometry-based coverage strategy culminates in a higher coverage ratio and a lower drop rate than α-coverage under the same constraints. The results also show that the deployment of Road Side Units (RSUs) in regions with high traffic flow is able to cover the majority of communication, so that less RSUs are able to provide better communication performance.

A geometry-based coverage strategy over urban VANETs

Vehicular Ad-hoc Network (VANET) is a self-organized network that connects vehicle and RSUs. The RSUs can intern be connect to a background network so that many other network applications and services including internet access can be provide to the vehicle for obtaining different services by the user or driver. The considerable attention goes in this field due to the high demands of new innovations in the vehicular industry. The primary purpose of VANET is to improve public safety and save lives as well as to improve vehicular traffic flow. VANET has very dynamic topology large network size and constrained mobility, these characteristic led to the need for efficient routing and resource saving protocol. It is a new research area which tends lots of emphasis towards services provided through the network. In this paper, we give the review of various routing protocols by using some parameters: digital map, scenario, position verification, clustering, routing mechanism, forwarding strategy and control overhead.

/pdf/a-review-of-various-routing-protocols-in-vanet-k6gml9xix5.pdf

A Review of Various Routing Protocols in VANET

—VANET (Vehicular Ad Hoc Network) is an emerging technology to achieve intelligent inter vehicle communications, it is the specialized derivation of pure multi hop ad hoc networking and are already going through industrial prototyping; the dreamed idea of general purpose vehicular ad hoc network is still away from reality. Vehicular communication has been one of the hottest topics for the last few years. The vision for VANETs is road safety and commercial comfort applications enabled by shortrange wireless technology. Many routing protocol have been purposed for such kind of networks, most of them try to exploit the information, which may be available at the vehicle by the time a routing decision must be made. In this paper we have perform analysis the AODV & GPSR routing protocol used in VANET and conclude them.

/pdf/performance-analysis-of-aodv-gpsr-routing-protocol-in-vanet-2txmhu8zc3.pdf

Performance analysis of AODV &GPSR routing protocol in VANET

Recent advances in development of Wireless Communication in Vehicular Adhoc Network (VANET) has provided emerging platform for industrialists and researchers. Vehicular Ad hoc networks are multi-hop networks with no fixed infrastructure. It comprises of moving vehicles communicating with each other. Inter vehicular communication lies at the core of a number of industry and academic research initiatives that aim at enhancing the safety and efficiency of transportation systems. Vehicular ad hoc networks (VANETs) enable vehicles to communicate with each other and with roadside units (RSU). In a previous study [1], the authors have proposed a Distributed multi-hop clustering algorithm for VANETs based on neighborhood follow (DMCNF) in which the new vehicle initially broadcast hello packet (location, speed, position, direction) to all 1-hop distance neighbors and wait for the replies. The each 1-hop neighbor will reply in the form of hello packet and also there is a chance of uncertainty in replies which leads to increase hello packet overheads and also increases the cluster selection time. Hence our new protocol "enhanced distributed multi-hop clustering algorithm for VANETs based on neighborhood follow (EDMCNF) collaborated with Road Side Unit" overcome this problems. Here, the new vehicles will directly communication with RSU to take information about the stable cluster for it which will reduce the hello packet overhead and also reduces the time taken for cluster selection. The reduction of hello packet overheads and reduction of time taken for cluster selection jointly results in the reduction of average overheads.

Enhanced Distributed Multi-Hop Clustering Algorithm for VANETs Based on Neighborhood Follow (EDMCNF) Collaborated with Road Side Units

Vehicular Ad hoc Networks is a kind of special wireless ad hoc network, which has the characteristics of high node mobility and fast topology changes. The Vehicular Networks can provide wide variety of services, range from safety-related warning systems to improved navigation mechanisms as well as information and entertainment applications. These additional features make the routing and other services more challenging and cause vulnerability in network services. These problems include network architecture, vanet protocols, routing algorithms, as well as security issues. In this paper, we provide a review for the researches related to Vehicular Ad Hoc Networks and also try to propose solution for related issues and challenges.

/pdf/an-insight-overview-of-issues-and-challenges-in-2e3isdvrex.pdf

An insight overview of issues and challenges in vehicularadhoc network

VANETS is the most popular network which is called Vehicular Ad Hoc Network. The researchers make a lot of work in this network. Several unexpected disastrous situations are encountered on road networks daily, many of which may lead to congestion and safety hazards. If vehicles can be provided with information about such incidents or traffic conditions in advance, the quality of driving can be improved significantly in terms of time, distance, and safety. One of the main challenges in Vehicular adhoc network is of searching and maintaining an effective route for transporting data information. In this paper, the author will make an attempt for identifying major issues and challenges associated with different vanet protocols and to select the optimal vanet protocol for the prediction of future.

Monika Khatri

Papers

An insight overview of issues and challenges in vehicularadhoc network

Behavioural study of vanet protocols