Game-theoretical design of an adaptive distributed dissemination protocol for VANETs

Road safety applications envisaged for Vehicular Ad Hoc Networks (VANETs) depend largely on the dissemination of warning messages to deliver information to concerned vehicles. The intended applications, as well as some inherent VANET characteristics, make data dissemination an essential service and a challenging task in this kind of networks. This work lays out a decentralized stochastic solution for the data dissemination problem through two game-theoretical mechanisms. Given the non-stationarity induced by a highly dynamic topology, diverse network densities, and intermittent connectivity, a solution for the formulated game requires an adaptive procedure able to exploit the environment changes. Extensive simulations reveal that our proposal excels in terms of number of transmissions, lower end-to-end delay and reduced overhead while maintaining high delivery ratio, compared to other proposalsPeer ReviewedPostprint (published version

A Review on Forwarding Strategies in NDN based Vehicular Networks

Named Data Networking (NDN) is a model that has been proposed by many researchers to alter the long-established IP based networking model. It derives the content centric approach rather than host-based approach. This is gaining even more traction in the wireless network and is able to replace the conventional IP-based networking. Up to now, NDN has proven to be fruitful when used with certain limitations in vehicular networks. Vehicular networks deal with exchanging information across fast moving complex vehicle network topology. The sending and receiving of information in such a scenario acts as a challenge and thus requires an effective forwarding strategy to address this problem. Different research work has provided with multiple forwarding strategy that solves the current problem up to some limit but further research work is still longed for to get an optimum solution. This paper provides a brief survey on current existing forwarding strategies related to vehicular networks using NDN as well as providing information on various resources and technologies used in it

Named Data Networking in Vehicular Ad hoc Networks: State-of-the-Art and Challenges

International audienceInformation-Centric Networking (ICN) has been proposed as one of the future Internet architectures. It is poised to address the challenges faced by today's Internet that include, but not limited to, scalability, addressing, security, and privacy. Furthermore, it also aims at meeting the requirements for new emerging Internet applications. To realize ICN, Named Data Networking (NDN) is one of the recent implementations of ICN that provides a suitable communication approach due to its clean slate design and simple communication model. There are a plethora of applications realized through ICN in different domains where data is the focal point of communication. One such domain is Intelligent Transportation System (ITS) realized through Vehicular Ad hoc NETwork (VANET) where vehicles exchange information and content with each other and with the infrastructure. To date, excellent research results have been yielded in the VANET domain aiming at safe, reliable, and infotainment-rich driving experience. However, due to the dynamic topologies, host-centric model, and ephemeral nature of vehicular communication, various challenges are faced by VANET that hinder the realization of successful vehicular networks and adversely affect the data dissemination, content delivery, and user experiences. To fill these gaps, NDN has been extensively used as underlying communication paradigm for VANET. Inspired by the extensive research results in NDN-based VANET, in this paper, we provide a detailed and systematic review of NDN-driven VANET. More precisely, we investigate the role of NDN in VANET and discuss the feasibility of NDN architecture in VANET environment. Subsequently, we cover in detail, NDN-based naming, routing and forwarding, caching, mobility, and security mechanism for VANET. Furthermore, we discuss the existing standards, solutions, and simulation tools used in NDN-based VANET. Finally, we also identify open challenges and issues faced by NDN-driven VANET and highlight future research directions that should be addressed by the research community

Geographical Forwarding Methods in Vehicular Ad hoc Networks

Vehicular ad hoc networks are new and emerging technology and special class of mobile ad hoc networks that provide wireless communication between vehicles without any fixed infrastructure. Geographical routing has appeared as one of the most scalable and competent routing schemes for vehicular networks. A number of strategies have been proposed for forwarding the packets in geographical direction of the destination, where information of direct neighbors is gained through navigational services. Due to dynamically changing topologies and high mobility neighbor information become outdated. To address these common issues in network different types of forwarding strategies have been proposed. In this review paper, we concentrate on beaconless forwarding methods and their forwarding methods in detail

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

Mitigating Broadcast Storm on Metro Ethernet Network Using PVST+

Broadcast storm attack on the layer 2 networks included looping and duplicate packets that are transmitted continuously in order to prevent the service of the network, thus, it is the type of attack that is against availability. In this research, a Spanning Tree Protocol method, namely PVST+ (Per VLAN Spanning Tree Plus), is used to overcome the problem caused by the broadcast storm attack on Metro Ethernet Network. The PVST+ serves as a redundant network management and it prevented looping on the network. The result obtained from this research is PVST+ is able to mitigate broadcast strom that is shown by the decrease of number of packets and the decrease of the average packet per-second. The average packets per-second on VLAN 1 decrease to 274,041 and the average packets on VLAN 10 decrease to 267,794 packets per-second

SRB: A Selective Reliable Broadcast Protocol for Safety Applications in VANETs

In this paper we present a novel vehicular communication protocol, which aims to reduce the effect of broadcast storm problem in VANETs. When the traffic density is above a certain value (e.g., when vehicles are in congested traffic scenarios), one of the most serious problems is the increase of packet collisions and medium contentions among vehicles which attempt to communicate. Our proposed technique, namely Selective Reliable Broadcast protocol (SRB), is intended to limit the number of packet transmissions, by means of opportunistically selecting neighboring nodes, acting as relay nodes. As a result, the number of forwarder vehicles is strongly reduced, while network performance is preserved. SRB belongs to the class of broadcast protocols, and exploits the traditional vehicular partitioning behavior to select forwarders. Each cluster is automatically detected as a zone of interest, whenever a vehicle is approaching, and packets will be forwarded only to selected vehicles, opportunistically elected as cluster-heads. In respect of traditional broadcast approaches, the main strengths of SRB are the efficiency of detecting clusters and selecting forwarders in a fast way, in order to limit the broadcast storm problem. Simulation results have been carried out both in urban and highway scenarios, in order to validate the effectiveness of SRB, in terms of cluster detection and reduction of number of selected forwarders

Reliable Broadcasting in VANET

Vehicular Adhoc NETwork (VANET) is a rapid growing wireless ad-hoc network model where the vehicles play the nodes role in a network. Major application of VANET including hazard warning application requires effective broadcast mechanism. Typically, selection of the next relaying hop is the major problem in VANET broadcasting. To get the smallest propagational delay, the number of relaying hops must be minimize. Meanwhile, the transmission reliability must also be preserved. Both of these two constrains must be taken into consideration. However, these two aspects often collide to each other since increasing one of them always result in decreasing of another. In this paper, I will suggest a new protocol that can satisfy great reliability without sacrificing message propagational speed. The protocol is based on RTB/CTB [1] scheme which guarantees the successful reception of a report broadcasting. However, unlike the original RTB/CTB approach where the process is slow, the proposed scheme can work much faster, yet providing broadcasting reliability due to many enhancements added in the design such as fixed short length jamming duration, non-CTB iteration, non-wasting contention slot and protocol messages reduction. As we could observed from the simulation result that the proposed protocol performed better in term of bytes usage, reliability and propagational time when compared with Slotted p persistence and RTB/CT

Efficient route discovery for reactive routing

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Information on the location of mobile nodes in Mobile Ad-hoc Networks (MANETs) has the potential to significantly improve network performance. This thesis uses node location information to develop new techniques for route discovery in on-demand routing protocols such as the Ad-hoc On-Demand Distance Vector (AODV), thus making an important contribution to enhancing the experience of using mobile networks. A Candidate Neighbours to Rebroadcast the Route Request (CNRR) approach has been proposed to reduce the deleterious impact, known as the broadcast storm, of RREQ packets flooding in traditional on-demand routing protocols. The main concept behind CNRR is specifying a set of neighbours which will rebroadcast the received RREQ. This is a departure from the traditional approach of all receiving nodes rebroadcasting RREQs and has the effect of reducing the problem of redundancy from which mobile networks suffer. The proposed protocol has been developed in two phases: Closest-CNRR and Furthest-CNRR. The simulation results show that the proposed algorithms have a significant effect as they reduce the routing overhead of the AODV protocol by up to 28% compared to the C-CNRR, and by up to 17.5% compared to the F-CNRR. Notably, the proposed algorithms simultaneously achieve better throughput and less data dropping. The Link Stability and Energy Aware protocol (LSEA) has been developed to reduce the overhead while increasing network lifetimes. The LSEA helps to control the global dissemination of RREQs in the network by eliminating those nodes that have a residual energy level below a specific threshold value from participation in end-to-end routes. The proposed LSEA protocol significantly increases network lifetimes by up to 19% compared with other on-demand routing protocols while still managing to obtain the same packet delivery ratio and network throughput levels. Furthermore, merging the LSEA and CNRR concepts has the great advantage of reducing the dissemination of RREQs in the network without loss of reachability among the nodes. This increases network lifetimes, reduces the overhead and increases the amount of data sent and received. Accordingly, a Position-based Selective Neighbour (PSN) approach has been proposed which combines the advantages of zoning and link stability. The results show that the proposed technique has notable advantages over both the AODV and MAAODV as it improves delivery ratios by 24.6% and 18.8%, respectively.Funded by National Council for Training - Sudan and the Sudan Academy of Science

U2RV: UAV-assisted reactive routing protocol for VANETs

When it comes to keeping the data routing robust and effective in Vehicular Ad hoc Networks (VANETs), stable and durable connectivity constitutes the keystone to ensure successful point-to-point communication. Since VANETs can comprise all kinds of mobile vehicles moving and changing direction frequently, this may result in frequent link failures and network partitions. Moreover, when VANETs are deployed in a city environment, another problem arises, that is, the existing obstructions (e.g., buildings, trees, hoppers, etc.) preventing the line-of-sight between vehicles, thus degrading wireless transmissions. Therefore, it is more complicated to design a routing technique that adapts to frequent changes in the topology. In order to settle all these problems, in this work, we design a flooding scheme that automatically reacts at each topology variation while overcoming the present obstacles while exchanging data in ad hoc mode with drones that are commonly called Unmanned Aerial Vehicles (UAVs). Also, the aim of this work is to explore well-regulated routing paths providing a long lifetime connectivity based on the amount of traffic and the expiration time of each discovered path, respectively. A set of experiments is carried out using simulation, and the outcomes are confronted with similar protocols based on a couple of metrics. The results clearly show that the assistance of UAVs to vehicles is capable to provide high delivery ratios and low delivery delays while efficiently extending the network connectivity