Vehicular Routing Research Articles

A Top-down Multi-layer Routing Architecture for Vehicular Ad-Hoc Networks

The actual proposed routing protocols for VANETs (Vehicular Ad-hoc Networks) present different features for communication among hosts/vehicles considering the strong topology change, but most of these features are needed for routing in these specific networks. These routing protocols support vehicle traffic on a large scale, intense mobility of vehicles, connections without link breakage, etc. But as they are different protocols the routers (nodes) have to switch to a routing protocol in a certain moment, which is a problem. This paper presents a routing architecture for VANETs to face it. The most important technical features for routing in VANETs were grouped in the Routing Architecture. To validate the proposed architecture several existing protocols were unified in the architecture producing a new routing protocol for VANETs. The produced protocol is the Generic Vehicular Dynamic Source Routing (GVDSR). Simulations of the GVDSR protocol have been made on the Malaga city showing the contributions and advantages for routing performance. The proposed architecture and protocol were simulated in the Network Simulator 2 featuring better performance than the compared protocolsThe actual proposed routing protocols for VANETs (Vehicular Ad-hoc Networks) present different features for communication among hosts/vehicles considering the strong topology change, but most of these features are needed for routing in these specific networks. These routing protocols support vehicle traffic on a large scale, intense mobility of vehicles, connections without link breakage, etc. But as they are different protocols the routers (nodes) have to switch to a routing protocol in a certain moment, which is a problem. This paper presents a routing architecture for VANETs to face it. The most important technical features for routing in VANETs were grouped in the Routing Architecture. To validate the proposed architecture several existing protocols were unified in the architecture producing a new routing protocol for VANETs. The produced protocol is the Generic Vehicular Dynamic Source Routing (GVDSR). Simulations of the GVDSR protocol have been made on the Malaga city showing the contributions and advantages for routing performance. The proposed architecture and protocol were simulated in the Network Simulator 2 featuring better performance than the compared protocols.

Vehicular Ad Hoc network routing protocol and its research progress

In recent years,with the rapid development of Vehicular Ad-hoc NETwork(VANET),well-classified routing protocol and comparative analysis are important for future study.This paper dealt with the ambiguous classification and deficient analysis of the routing protocol in VANET,classifying and summarizing the routing protocols on the basis of topology,geography and hybrid route in turn.Mainly introducing some classical routing protocols,it analyzed their characteristics and performance,and put forward the advantages and disadvantages as well as improvements.Special stress was put on the comparative analysis of Delay Tolerant Network(DTN) and opportunity routing protocol which would become hot spots for future geographic routing study.Besides,the major challenges and potential opportunities that VANET was facing were pointed out,which had laid the foundation of future protocol study and suggested the path to research clearly.

A Sequential Patterns Data Mining Approach Towards Vehicular Route Prediction in VANETs

Behavioral patterns prediction in the context of Vehicular Ad hoc Networks (VANETs) has been receiving increasing attention due to the enabling of on-demand, intelligent traffic analysis and real-time responses to traffic issues. One of these patterns, sequential patterns, is a type of behavioral pattern that describes the occurrence of events in a timely and ordered fashion. In the context of VANETs, these events are defined as an ordered list of road segments traversed by vehicles during their trips from a starting point to their final intended destination. In this paper, a new set of formal definitions depicting vehicular paths as sequential patterns is described. Also, five novel communication schemes have been designed and implemented under a simulated environment to collect vehicular paths; such schemes are classified under two categories: RSU (Road Side Unit)-based and Vehicle-based. After collection, extracted frequent paths are obtained through data mining, and the probability of these frequent paths is measured. In order to evaluate the effectiveness and efficiency of the proposed schemes, extensive experimental analysis has been realized.

Evaluation of the use of guard nodes for securing the routing in VANETs

We address the problem of effective vehicular routing in hostile scenarios where malicious nodes intend to jeopardize the delivery of messages. Compromised vehicles can severely affect the performance of the network by a number of attacks, such as selectively dropping messages, manipulating them on the fly, and the likes. One of the best performing solutions that has been used in static wireless sensor networks to deal with these attacks is based on the concept of watchdog nodes (also known as guard nodes) that collaborate to continue the forwarding of data packets in case a malicious behavior in a neighbor node is detected. In this work, we consider the beacon-less routing algorithm for vehicular environments routing protocol, which has been previously shown to perform very well in vehicular networks, and analyze whether a similar solution would be feasible for vehicular environments. Our simulation results in an urban scenario show that watchdog nodes are able to avoid up to a 50% of packet drops across different network densities and for different number of attackers, without introducing a significant increase in terms of control overhead. However, the overall performance of the routing protocol is still far from optimal. Thus, in the case of vehicular networks, watchdog nodes alone are not able to completely alleviate these security threats.

Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwarding can result in the selection of forwarders with weak radio links that might compromise the end-to-end performance. To overcome these limitations, this paper presents TOPOCBF, a novel contention-based broadcast forwarding protocol that dynamically selects forwarding paths based on their capability to route packets between anchor points. Such capability is estimated by means of a multi-hop connectivity metric. The obtained results demonstrate that TOPOCBF can provide good packet delivery ratios while reducing the communications load compared to unicast sender-based forwarding schemes using road traffic density estimates.

Using Trusted Computing for Protecting Vehicular Routing

Using Trusted Computing for Protecting Vehicular Routing

Routing protocol in intervehicle communication systems: a survey

Communication technology for vehicles has become an important topic for research. IEEE standards including IEEE 802.11p and IEEE P1609.1-4 have emerged to provide a framework for intervehicular communication (IVC). However, due to particular characteristics of IVC, such as high mobility, unstable connectivity, and network partitioning, information routing becomes inevitably challenging. This article reviews the recent research progress to highlight research challenges in vehicular routing protocol as a guideline for future development of IVC applications. The article focuses on the IEEE DSRC/WAVE standard. The state of the art in IVC routing protocols is surveyed, and open issues for further research are highlighted in the article.

CoRoute: a new cognitive anypath vehicular routing protocol

ABSTRACTVehicular communications promise to bring us safer driving and better traffic control. Dedicated short range communications and IEEE 802.11p are now well established standards for vehicular communications. Channels for those systems, however, are of limited capacity and are dedicated to safety applications. Thus, they are not sufficient to support the broad range of services envisioned in VANETs. It is anticipated that vehicles will utilize Wi‐Fi (802.11 a/b/g) to acquire more capacity. Unfortunately, the Wi‐Fi channels in urban areas are already quite heavily subscribed by residential customers. To evade the residential load, in this paper, we propose CoVanet, a cognitive vehicular ad hoc network architecture that allows vehicle radios to access the Wi‐Fi channels ‘opportunistically’, finding least loaded channels. In CoVanet, network topology and channel environment change frequently because of high node mobility. The main contribution of this work is a cognitive ad hoc vehicular routing protocol (CoRoute). CoRoute is a hybrid that utilizes both geographical location and sensed channel information to establish stable, minimum delay routes to the destination. Simulation results show that CoRoute is robust to mobility and to external interference and improves packet delivery ratio on average by 70% with respect to routing without cognitive radios. Copyright © 2011 John Wiley & Sons, Ltd.

Optimal Routing in Closed Queueing Networks with State Dependent Queues

Optimal routing in closed queueing networks with state dependent queues is the focus of this paper. We seek a methodology and algorithm to efficiently solve the routing probabilities in closed systems. These systems may include multi-server exponential and general service finite capacity state dependent models as well as multi-chain systems. The state dependent models included within this paper extend the range of possible system applications with our algorithm to include transportation and material handling conveyor systems, pedestrian, and vehicular routing applications. Sometimes the networks will be purely state dependent M/G/c/c queues, while other times, there will be a mixture of M/M/c and M/G/c/c queues. These state dependent M/G/c/c queues are finite queues, while the workstations are infinite buffer queues. Because these networks have been shown to have a product form and the objective function in single chain networks is concave, we can achieve an optimal seeking algorithm. Numerous experiments are shown to illustrate the efficacy of the approach.

A Heuristic Path-Estimating Algorithm by Using Vector-Based Recognition

Floating Car Data (FCD) is an important material for a broad range of application such as traffic management and control,traffic conditions computation and so on. However,in the original data exists error,and the data must be handled by path-estimating and be related to the road. The traditional path-estimating algorithms mainly use two methods:the incremental method and the global method. Both of them have advantages and disadvantages of themselves:while the global map-matching algorithm produces better matching results,the incremental algorithm produces results of lower quality faster. All things considering the two traditional algorithms,this paper proposes a heuristic path-estimating algorithm by using vector-based recognition. Firstly,the algorithm uses the heuristic search method,and it makes use of geometric operation to form the restriction,and make the comparison between the vector formed with the vehicular GPS points and the special road network model to search and select the vehicular possible traveling routes. Secondly,it globally compares all the vehicular possible traveling routes,and then chooses the optimal one. The result of testing demonstrates the efficiency of the algorithm both at accuracy and computational speed when handling the large-scale data of GPS tracking data even under the complex road network conditions.

Taking the LOUVRE approach

We introduce a routing solution called landmark overlays for urban vehicular routing environments (LOUVRE), an approach that efficiently builds a landmark overlay network on top of an urban topology. We define urban junctions as overlay nodes and create an overlay link if and only if the traffic density of the underlying network guarantees the multihop vehicular routing between the two overlay nodes. LOUVRE contains a distributed traffic density estimation scheme that is used to evaluate the existence of an overlay link. Then, efficient routing is performed on the overlay network, guaranteeing a correct delivery of each packet. We evaluate LOUVRE against the benchmark routing protocols of greedy perimeter stateless routing (GPSR) and greedy perimeter coordinator routing (GPCR) and show that LOUVRE performs higher in packet delivery and achieves lower hop count.