The multi-copy diversity for routing in sparse vehicular ad hoc networks

The need for routing based on store-and-carry forwarding has been motivated in sparse vehicular ad hoc networks (VANETs), since the traditional end-to-end unicast routing is infeasible due to the network disconnection problem. In store-and-carry based routing, the end-to-end message delivery delay is dominated by the store-and-carry procedure rather than the wireless transmission. Therefore, the end-to-end delay in such sparse VANETs can be further reduced by replicating multiple copies of the message to other nodes when possible, i.e., multi-copy routing, to increase the chance of finally finding the destination, which we call this gain as multi-copy diversity. In this paper, we present an analytic framework to evaluate the performance of routing by assessing the multi-copy diversity gain in sparse VANETs. By using this model, we first derive an upper and lower-bound of end-to-end routing delay in sparse VANETs. Our analytic results show that a high level of multi-copy diversity gain is achieved when the network is partially connected, which is in contrast to the conventional expectation that multi-copy routing performs better in severely disconnected networks. Second, we propose a new adaptive multi-copy VANET routing scheme called AMR by exploiting these analytic results. AMR adapts to the local network connectivity and increases the level of multi-copy diversity at significantly reduced routing overhead compared to the well known epidemic routing. We validate the accuracy of our analytic model and the performance of AMR via simulation studies.     

Connectivity Requirements for Self-Organizing Traffic Information Systems

To facilitate the dissemination of a time-critical information in a vehicular ad hoc network (VANET), immediate network connectivity is needed. In other words, a time-critical message from a source should be able to propagate and reach all of the vehicles on the road segment without any delay due to the unavailability of the vehicles to forward the message. Clearly, this requires the road segment to have a certain number of vehicles equipped with communication devices. It is the task of a system designer to determine the minimum number of vehicles (i.e., the minimum penetration) necessary to form a connected network as well as the critical transmission range required to provide such connectivity. In this paper, we present an analytical framework for determining the connectivity requirements in distributing the traffic information in a self-organizing vehicular network. One- and two-way street scenarios are considered. In addition to the conventional perspective on connectivity, where the characteristics of the wireless channel are often neglected, our analysis offers a new view by taking important physical-layer parameters, such as fading, propagation path loss, transmit power, and transmission data rate, into consideration.      

Attack Resilient and Efficient Protocol based on Greedy Perimeter Coordinator Routing—Mobility Awareness for Preventing the Attack in the VANET

Wireless Personal Communications - A Greedy Perimeter Coordinator Routing and Mobility Awareness (GPCR-MA) vehicular routing is a widely accepted routing protocol for VANET (Vehicular Ad hoc...     

Analytical model for connectivity of vehicular ad hoc networks in the presence of channel randomness

A vehicular ad hoc network (VANET) is a highly mobile wireless ad hoc network formed by vehicles equipped with communication facilities. Developing multihop communication in VANETs is a challenging problem because of rapidly changing network topology and frequent network disconnections. This paper investigates the network connectivity probability of one‐dimensional VANET in the presence of channel randomness. Network connectivity is one of the most important issues in VANETs, because the dissemination of time‐critical information requires, as a preliminary condition, the network to be fully connected. We present an analytical procedure for the computation of network connectivity probability, taking into account the underlying wireless channel. Three different fading models are considered for the connectivity analysis: Rayleigh, Rician, and Weibull. A distance‐dependent power law model is employed for the pathloss in a vehicle‐to‐vehicle channel. Furthermore, the speed of each vehicle on the highway is assumed to be a Gaussian distributed random variable. The analysis provides a general framework for investigating the dependence of various parameters such as vehicle arrival rate, vehicle density, vehicle speed, highway length, and various physical layer parameters such as transmit power, receive signal‐to‐noise ratio threshold, path loss exponent, and fading factors (Rician and Weibull) on VANET connectivity. Copyright © 2011 John Wiley & Sons, Ltd.     

Routing protocols for vehicular Ad Hoc networks in rural areas

Research on vehicular ad hoc networks has focused mainly on efficient routing protocol design under conditions where there are relatively large numbers of closely spaced vehicles. These routing protocols are designed principally for urban areas with high node density and fully connected networks and are not suitable for packet delivery in a sparse, partially connected VANET. In this article, we examine the challenges of VANETs in sparse network conditions, review alternatives including epidemic routing, and propose a border node-based routing protocol for partially connected VANETs. The BBR protocol can tolerate network partition due to low node density and high node mobility. The performance of epidemic routing and BBR are evaluated with a geographic and traffic information- based mobility model that captures typical highway conditions. The simulation results show that under rural network conditions, a limited flooding protocol such as BBR performs well and offers the advantage of not relying on a location service required by other protocols proposed for VANETs.     

SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.     

Reactive routing evaluation using modified 802.11a with realistic vehicular mobility

Realistic mobility dynamics and underlying PHY/MAC layer implementation affect real deployment of routing protocols in vehicular ad hoc network (VANET). Currently, dedicated short range communication devices are using wireless access in vehicular environment (WAVE) mode of operation, but now IEEE is standardizing 802.11p WAVE. This work presents an in-depth simulation-based analysis of two reactive routing protocols, i.e., dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV) with modified IEEE 802.11a PHY/MAC layers (comparable to 802.11p) in modified VANET mobility models (freeway, stop sign, and traffic sign) in terms of load, throughput, delay, number of hops, and retransmission attempts. Results obtained using OPNET simulator show that in urban/highway mobility scenarios, AODV??s performance with forthcoming 802.11p at high bit rate would be better than DSR in terms of high throughput, less delay, and retransmission attempts. Moreover, this comprehensive evaluation will assist to address challenges associated with future deployment of routing protocols integrated upon devices with upcoming IEEE 802.11p, concerning specific macro-/micro-mobility scenarios.     

An improved distance‐based ant colony optimization routing for vehicular ad hoc networks

Vehicular ad hoc network (VANET) has earned tremendous attraction in the recent period due to its usage in a wireless intelligent transportation system. VANET is a unique form of mobile ad hoc network (MANET). Routing issues such as high mobility of nodes, frequent path breaks, the blind broadcasting of messages, and bandwidth constraints in VANET increase communication cost, frequent path failure, and overhead and decrease efficiency in routing, and shortest path in routing provides solutions to overcome all these problems. Finding the shortest path between source and destination in the VANET road scenario is a challenging task. Long path increases network overhead, communication cost, and frequent path failure and decreases routing efficiency. To increase efficiency in routing a novel, improved distance‐based ant colony optimization routing (IDBACOR) is proposed. The proposed IDBACOR determines intervehicular distance, and it is triggered by modified ant colony optimization (modified ACO). The modified ACO method is a metaheuristic approach, motivated by the natural behavior of ants. The simulation result indicates that the overall performance of our proposed scheme is better than ant colony optimization (ACO), opposition‐based ant colony optimization (OACO), and greedy routing with ant colony optimization (GRACO) in terms of throughput, average communication cost, average propagation delay, average routing overhead, and average packet delivery ratio.     

Link efficiency and quality of experience aware routing protocol to improve video streaming in urban VANETs

In a vehicular ad‐hoc network (VANET), vehicles can play an essential role in monitoring areas of a smart city by transmitting data or multimedia content of environmental circumstances like disasters or road conditions. Multimedia content communication with quality of experience (QoE) guarantees is a challenging undertaking in an environment such as that of a VANET. Indeed, a VANET is characterized by numerous varying conditions, significantly impacting its topology, quality of communication channels, and paths with respect to bandwidth, loss, and delay. This paper introduces a link efficiency and quality of experience aware routing protocol (LEQRV) to improve video streaming provisioning in urban vehicular ad‐hoc networks. LEQRV uses an enhanced greedy forwarding‐based approach to create and maintain stable high quality routes for video streaming delivery. It improves the performance of the quality of experience by increasing the achieved QoE scores and reducing the forwarding end‐to‐end delay and frame loss.     

Mitigation and Performance Analysis of Routing Protocols Under Black-Hole Attack in Vehicular Ad-hoc Network (VANET)

Vehicular Ad-hoc network (VANET) is a self-organized ad hoc network. VANET becomes a most challenging research area as it has several issues related to routing protocols, quality of service, security, etc. Vehicular communication is critically unsafe to several kinds of active and passive routing attacks. This paper analyzes the impact of a compromised node (vehicle) on zone routing protocol and ad-hoc on-demand distance vector, and recommends a suitable solution called secure vehicular on demand routing to find out and mitigate the black hole attack. The given study analyses the effect of vehicle density on the average throughput, packet delivery ratio, end-to-end delay, normalized routing load and average path length.     

GeoDTN<Emphasis Type="Bold">+</Emphasis>Nav: Geographic DTN Routing with Navigator Prediction for Urban Vehicular Environments

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions fail. These protocols could forward packets efficiently given that the underlying network is fully connected. However, the dynamic nature of vehicular network, such as vehicle density, traffic pattern, and radio obstacles could create unconnected networks partitions. To this end, we propose GeoDTN+Nav, a hybrid geographic routing solution enhancing the standard greedy and recovery modes exploiting the vehicular mobility and on-board vehicular navigation systems to efficiently deliver packets even in partitioned networks. GeoDTN+Nav outperforms standard geographic routing protocols such as GPSR and GPCR because it is able to estimate network partitions and then improves partitions reachability by using a store-carry-forward procedure when necessary. We propose a virtual navigation interface (VNI) to provide generalized route information to optimize such forwarding procedure. We finally evaluate the benefit of our approach first analytically and then with simulations. By using delay tolerant forwarding in sparse networks, GeoDTN+Nav greatly increases the packet delivery ratio of geographic routing protocols and provides comparable routing delay to benchmark DTN algorithms.     

ACAR: Adaptive Connectivity Aware Routing for Vehicular Ad Hoc Networks in City Scenarios

Multi-hop vehicle-to-vehicle communication is useful for supporting many vehicular applications that provide drivers with safety and convenience. Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem due to the rapidly changing topology and frequent network disconnections, which cause failure or inefficiency in traditional ad hoc routing protocols. We propose an adaptive connectivity aware routing (ACAR) protocol that addresses these problems by adaptively selecting an optimal route with the best network transmission quality based on statistical and real-time density data that are gathered through an on-the-fly density collection process. The protocol consists of two parts: 1) select an optimal route, consisting of road segments, with the best estimated transmission quality, and 2) in each road segment of the chosen route, select the most efficient multi-hop path that will improve the delivery ratio and throughput. The optimal route is selected using our transmission quality model that takes into account vehicle densities and traffic light periods to estimate the probability of network connectivity and data delivery ratio for transmitting packets. Our simulation results show that the proposed ACAR protocol outperforms existing VANET routing protocols in terms of data delivery ratio, throughput and data packet delay. Since the proposed model is not constrained by network densities, the ACAR protocol is suitable for both daytime and nighttime city VANET scenarios.     

Connectivity Analysis of Vehicular Ad Hoc Networks from a Physical Layer Perspective

This paper investigates the network connectivity properties of a vehicular ad hoc network (VANET) from a physical layer perspective. Specifically, we investigate the minimum transmit power used by all vehicles, sufficient to guarantee network connectivity. As opposed to the conventional graph-theoretic approach, in this paper, the network connectivity problem is analyzed according to a physical layer-based quality of service constraint. Under this approach, a multi-hop path joining a pair of vehicles in a VANET is said to be connected if and only if the average route BER meets a target requirement. We derive closed form analytical expression for the minimum transmit power sufficient to ensure network connectivity. We also derive analytical expression for the maximum number of hops, a packet can traverse satisfying the route BER constraint, for a given transmit power. The validity of our theoretical analysis is verified by extensive simulation studies. The analysis provides a framework for investigating the impact of traffic dependent parameters such as vehicle arrival rate, vehicle density, mean and standard deviation of vehicle speed, highway length and physical layer-based parameters such as path loss exponent, fading factor, Doppler spread, and data rate on VANET connectivity characteristics.     

Road Oriented Traffic Information System for Vehicular Ad hoc Networks

Over the last few years, vehicular ad hoc networks (VANETs) have gained popularity for their interesting applications. To make efficient routing decisions, VANET routing protocols require road traffic density information for which they use density estimation schemes. This paper presents a distributed mechanism for road vehicular density estimation that considers multiple road factors, such as road length and junctions. Extensive simulations are carried out to analyze the effectiveness of the proposed technique. Simulation results suggested that, the proposed technique is more accurate compared to the existing technique. Moreover, it facilitate VANET routing protocols to increase packet delivery ratio and reduce end-to-end delay.     

Effective crowdsensing and routing algorithms for next generation vehicular networks

The vehicular ad hoc network (VANET) has recently emerged as a promising networking technique attracting both the vehicular manufacturing industry and the academic community. Therefore, the design of next generation VANET management schemes becomes an important issue to satisfy the new demands. However, it is difficult to adapt traditional control approaches, which have already proven reliable in ad-hoc wireless networks, directly. In this study, we focus on the development of vehicular crowdsensing and routing algorithms in VANETs. The proposed scheme, which is based on reinforcement learning and game theory, is designed as novel vertical and horizontal game models, and provides an effective dual-plane control mechanism. In a vertical game, network agent and vehicles work together toward an appropriate crowdsensing process. In a horizontal game, vehicles select their best routing route for the VANET routing. Based on the decentralized, distributed manner, our dual-plane game paradigm captures the dynamics of the VANET system. Simulations and performance analysis verify the efficiency of the proposed scheme, showing that our approach can outperform existing schemes in terms of RSU’s task success ratio, normalized routing throughput, and end-to-end packet delay.

     

Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey

A vehicular ad hoc network (VANET) is a type of wireless ad hoc network that facilitates ubiquitous connectivity between vehicles in the absence of fixed infrastructure. Beaconing approaches is an important research challenge in high mobility vehicular networks with enabling safety applications. In this article, we perform a survey and a comparative study of state-of-the-art adaptive beaconing approaches in VANET, that explores the main advantages and drawbacks behind their design. The survey part of the paper presents a review of existing adaptive beaconing approaches such as adaptive beacon transmission power, beacon rate adaptation, contention window size adjustment and Hybrid adaptation beaconing techniques. The comparative study of the paper compares the representatives of adaptive beaconing approaches in terms of their objective of study, summary of their study, the utilized simulator and the type of vehicular scenario. After implementing the representatives of beaconing approaches, we analysed the simulation results and discussed the strengths and weaknesses of these beaconing approaches with regard to their suitability to vehicular networks. Finally, we discussed the open issues and research directions related to VANET adaptive beaconing approaches.     

Review of vehicular ad hoc network communication models including WVANET (Web VANET) model and WVANET future research directions

The most ever growing research field is vehicular ad hoc network. This prominent research field has the widely known communication models such as RoadSide Unit Communication, Vehicle to Vehicle Communication, and Cluster based Communication models. In addition to that M. Milton Joe and B. Ramakrishnan et al. have proposed a new communication model known as WVANET (Web VANET) for vehicular ad hoc network communication. The authors portray that WVANET will be the everlasting research field in future. This WVANET (Web VANET) communication model is fundamentally different from other communication models as it makes use of web signals to disseminate the messages among vehicles. Of course, each communication model in VANET will have its own various pros and cons. This paper provides the overall review of all the existing communication models in VANET and in addition to that WVANET (Web VANET) communication model is also presented. Further this paper discusses the various future research that can be done in WVANET (Web VANET) communication model.     

Consortium Blockchain-Based Secure Software Defined Vehicular Network

Mobile Networks and Applications - The vehicular ad hoc network (VANET) is a promising technology that can provide Internet access services for vehicles. With the development of VANET, tremendous...     

AODVCS,a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).     

车载自组网的现状与发展

简要介绍了车载自组网的发展历史、特点和应用领域。使用分析和比较的方法，讨论各种无线通信技术用于车载自组网的优缺点，并针对车载自组网的应用及特性提出搭建车间通信系统的设计思想和突破方向。为了便于读者跟踪国外先进的研究成果，还介绍了一些在这一领域比较活跃的研究机构以及他们的主要工作。