Improving VANET Protocols via Network Science

Developing routing protocols for Vehicular Ad Hoc Networks (VANETs) is a significant challenge in these large, self- organized and distributed networks. We address this challenge by studying VANETs from a network science perspective to develop solutions that act locally but influence the network performance globally. More specifically, we look at snapshots from highway and urban VANETs of different sizes and vehicle densities, and study parameters such as the node degree distribution, the clustering coefficient and the average shortest path length, in order to better understand the networks' structure and compare it to structures commonly found in large real world networks such as small-world and scale-free networks. We then show how to use this information to improve existing VANET protocols. As an illustrative example, it is shown that, by adding new mechanisms that make use of this information, the overhead of the urban vehicular broadcasting (UV-CAST) protocol can be reduced substantially with no significant performance degradation.Comment: Proceedings of the 2012 IEEE Vehicular Networking Conference (VNC), Korea, November 201

A Simple and Robust Dissemination Protocol for VANETs

Several promising applications for Vehicular Ad-hoc Networks (VANETs) exist. For most of these applications, the communication among vehicles is envisioned to be based on the broadcasting of messages. This is due to the inherent highly mobile environment and importance of these messages to vehicles nearby. To deal with broadcast communication, dissemination protocols must be defined in such a way as to (i) prevent the so-called broadcast storm problem in dense networks and (ii) deal with disconnected networks in sparse topologies. In this paper, we present a Simple and Robust Dissemination (SRD) protocol that deals with these requirements in both sparse and dense networks. Its novelty lies in its simplicity and robustness. Simplicity is achieved by considering only two states (cluster tail and non- tail) for a vehicle. Robustness is achieved by assigning message delivery responsibility to multiple vehicles in sparse networks. Our simulation results show that SRD achieves high delivery ratio and low end-to-end delay under diverse traffic conditions

Dynamic speed adaptive classified (D-SAC) data dissemination protocol for improving autonomous robot performance in VANETs

In robotics, mechanized and computer simulation for accurate and fast crash detection between general geometric models is a fundamental problem. The explanation of this problem will gravely improve driver safety and traffic efficiency, vehicular ad hoc networks (VANETs) have been employed in many scenarios to provide road safety and for convenient travel of the people. They offer self-organizing decentralized environments to disseminate traffic data, vehicle information and hazardous events. In order to avoid accidents during roadway travels, which are a major burden to the society, the data, such as traffic data, vehicle data and the road condition, play a critical role. VANET is employed for disseminating the data. Still the scalability issues occur when the communication happens under high-traffic regime where the vehicle density is high. The data redundancy and packet collisions may be high which cause broadcast storm problems. Here the traffic regime in the current state is obtained from the speed of the vehicle. Thus the data reduction is obtained. In order to suppress the redundant broadcast D-SAC data, dissemination protocol is presented in this paper. Here the data are classified according to its criticality and the probability is determined. The performance of the D-SAC protocol is verified through conventional methods with simulation

SCALABLE MULTI-HOP DATA DISSEMINATION IN VEHICULAR AD HOC NETWORKS

Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly simultaneously. The broadcast storm problem is still challenging in the context of VANET, due to the rapid changes in the network topology, which are difficult to predict and manage. Existing solutions either do not scale well under high density scenarios, or require extra communication overhead to estimate traffic density, so as to manage data dissemination accordingly. In this dissertation, we specifically aim at providing an efficient solution for the broadcast storm problem in VANETs, in order to support different types of applications. A novel approach is developed to provide scalable broadcast without extra communication overhead, by relying on traffic regime estimation using speed data. We theoretically validate the utilization of speed instead of the density to estimate traffic flow. The results of simulating our approach under different density scenarios show its efficiency in providing scalable multi-hop data dissemination for VANETs

Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

TrAD: Traffic Adaptive Data Dissemination Protocol for Both Urban and Highway VANETs

Vehicular Ad hoc Networks (VANETs) aim to improve transportation activities that include traffic safety, transport efficiency and even infotainment on the wheels, in which a great number of traffic event-driven messages are needed to disseminate in a region of interest timely. However, due to the nature of VANETs, highly dynamic mobility and frequent disconnection, data dissemination faces great challenges. Inter-Vehicle Communication (IVC) protocols are the key technology to mitigate this issue. Therefore, we propose an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol that considers road traffic and network traffic status for both highway and urban scenarios. TrAD is flexible to fit the irregular road topology and owns double broadcast suppression techniques. Three state-of-the-art IVC protocols have been compared with TrAD by means of realistic simulations. The performance of all protocols is quantitatively evaluated with different real city maps and traffic routes. Finally, TrAD gets an outstanding overall performance in terms of several metrics, even though under the worse condition of GPS drift.Comment: Accepted by the 30-th IEEE International Conference on Advanced Information Networking and Applications (AINA-2016

A Bandwidth-Efficient Dissemination Scheme of Non-Safety Information in Urban VANETs

The recent release of standards for vehicular communications will hasten the development of smart cities in the following years. Many applications for vehicular networks, such as blocked road warnings or advertising, will require multi-hop dissemination of information to all vehicles in a region of interest. However, these networks present special features and difficulties that may require special measures. The dissemination of information may cause broadcast storms. Urban scenarios are especially sensitive to broadcast storms because of the high density of vehicles in downtown areas. They also present numerous crossroads and signal blocking due to buildings, which make dissemination more difficult than in open, almost straight interurban roadways. In this article, we discuss several options to avoid the broadcast storm problem while trying to achieve the maximum coverage of the region of interest. Specifically, we evaluate through simulations different ways to detect and take advantage of intersections and a strategy based on store-carry-forward to overcome short disconnections between groups of vehicles. Our conclusions are varied, and we propose two different solutions, depending on the requirements of the application.This work was partially founded by the Spanish Ministry of Science and Innovation within the framework of projects TEC2010-20572-C02-01 “CONSEQUENCE” and TEC2014-54335-C4-2-R “INRISCO” and by the Regional Government of Madrid within the “eMadrid” project under Grants S2009/TIC-1650 and S2013/ICE-2715, including the costs to publish in open access

Multi-directional Warning Message Dissemination Protocol Based on Motion Vector Clustering for VANETs

Problem. Most broadcast suppression protocols in vehicular ad hoc networks (VANET) mainly focus on one-dimensional message dissemination model for both highway and urban scenarios. Due to the non-line-of-sight (NLOS) problem occuring frequently in urban scenario, protocols mostly rely on either infrastructure or the vehicle that is passing through the intersection to forward the message in multiple directions manner. However, these one-dimensional message dissemination models fail to take into account realistic road topologies and traffic distribution. As a result, they tend to miss some possible dissemination directions. Method. Vehicles travelling on the same road share similar motion pattern due to the constraint of road topology. Each motion pattern represents a road topology as well as a potential dissemination direction. By identifying motion pattern of one-hop neighbors, the proposed motion vector protocol (MVP) enables a vehicle not only to identify potential dissemination directions without the support from infrastructure or a road map but also to make suppression decisions without any additional information from periodic beacons. Results. The total number of transmissions for simple flooding (each node broadcasts once) compared with MVP ranges respectively as follows: 90.2-269.7 and 40.6-72.3. Also, the number of saved rebroadcasts for simple flooding compared with MVP ranges respectively as follows: 0%-0% and 57%-73%. In the case of reachability, the simple flooding compared with MVP ranges 100%-100% and 100%-100% respectively. Finally, the average latency of the entire dissemination for simple flooding and MVP ranges 0.01446-0.01286s and 0.1127-0.1565s respectively. Conclusions. The experimental results show that MVP achieves high reachability, while still significantly reducing rebroadcast redundancy. One distinctive feature of MVP is that it is capable of operating on complex road topology such as a roundabout, curve road, branch road, etc., with multi-directional traffic in it

A distributed position-based protocol for emergency messages broadcasting in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) can help reduce traffic accidents through broadcasting emergency messages among vehicles in advance. However, it is a great challenge to timely deliver the emergency messages to the right vehicles which are interested in them. Some protocols require to collect nearby real-time information before broadcasting a message, which may result in an increased delivery latency. In this paper, we proposed an improved position-based protocol to disseminate emergency messages among a large scale vehicle networks. Specifically, defined by the proposed protocol, messages are only broadcasted along their regions of interest, and a rebroadcast of a message depends on the information including in the message it has received. The simulation results demonstrate that the proposed protocol can reduce unnecessary rebroadcasts considerably, and the collisions of broadcast can be effectively mitigated