Cooperative and Opportunistic Channel Access for Vehicle to Roadside (V2R) Communications

This paper focuses on vehicle to roadside (V2R) communications in vehicular networks based on the IEEE 802.11 DCF MAC protocol. In vehicular networks, roadside units (RSUs) are typically spaced apart along the road and each vehicle can be connected to an RSU only when the vehicle is within its transmission range. Due to the high relative speed between a moving vehicle and a stationary RSU, the residence time of the vehicle within the coverage of each RSU is very short. Thus it is hard for the system to reach a steady state. With multi-hop forwarding, in which a vehicle may be connected to an RSU through relaying over other vehicles, the connection time of each V2R access may be extended. But this is at the expense of introducing wireless interference among vehicles, which may dramatically degrade the system performance. To tackle these challenges, we propose a new mechanism called Proxy-based Vehicle to RSU access (PVR) for V2R communications. This protocol is designed to exploit cooperative and opportunistic forwarding between any two distant RSUs and to emulate back-to-back transmissions within the coverage of an RSU. As a result, it can shorten the access delay by taking advantage of opportunistic forwarding and mitigate the interference problem during the short residence time within the coverage of an RSU. The simulation results show that PVR achieves excellent performance and outperforms all existing solutions for V2R communications in vehicular networks.     

Performance enhancement of traffic information gathering (PEnTInG) algorithm for vehicular ad‐hoc networks

Vehicular ad‐hoc networks (VANETs) play a vital role in today's context of vehicular traffic. In this paper, clusters of vehicles are created on the basis of average speed of the vehicles. One cluster communicates with the next cluster through a cluster head and also share the same information with next cluster heads and installed road side units (RSUs). By using this technique, we can solve the problem of rough driving behavior and road terrorism which is due to speed variation of vehicles and fake information dissemination by the drivers. Many a times, drivers may spread fake accident‐related information into the network which is a serious cause of concern in VANETs. It is ensured that such drivers are not allowed to spread wrong information in the network to avoid accidents. To solve this problem, we developed performance enhancement of traffic information gathering (PEnTInG) algorithm that selects only those drivers/vehicles as cluster heads in a cluster who has maximum value of the cluster head factor (CHF). The CHF is derived by considering different weights in range of 0 to 1 of relative average speed, time to leave, trust factor, and neighborhood degree. Further, the elected cluster head shares and stores the same information with the RSUs. In case, a driver wants to disseminate fake or wrong information in a network, then that vehicle driver can be easily tracked by the local authority by accessing RSU data. Simulation results show that the stability of PEnTInG is increased by 25% against the existing schemes viz. lowest‐ID, MCMF, and cluster‐based technique.     

Vehicle density based multihop broadcast protocol in VANET

In vehicular ad hoc networks (VANET), the medium access control (MAC) protocol was of crucial importance to provide time-critical multihop broadcast. Contemporary multihop broadcast protocols in VANET usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, it was demonstrated that the farthest forwarder may experience long contention delay in case of high vehicle density. An IEEE 802.11p-based multihop broadcast protocol vehicle density based forwarding (VDF) was proposed, which adaptively chose the forwarder according to the vehicle density. The evaluation results in safety warning and online game applications show that, VDF could shorten broadcast delay by achieving the proper trade-off between the contention delay and coverage speed.     

车载边缘计算中多任务部分卸载方案研究

现有车载应用设备对时延有更严苛的要求,车载边缘计算(VEC)能够充分利用网络边缘设备,如路边单元(RSU)进行协作处理,可有效地降低时延。现有研究多假设RSU计算资源充足,可提供无限的服务,但实际其计算资源会随着所需处理任务数量的增加而受限,对时延敏感的车载应用造成限制。该文针对此问题,提出一种车载边缘计算中多任务部分卸载方案,该方案在充分利用RSU的计算资源条件下,考虑邻近车辆的剩余可用计算资源,以最小化总任务处理时延。首先在时延限制和资源约束下分配各任务在本地、RSU和邻近车辆的最优卸载决策变量比例,其次以最小处理时延为目的在一跳通信范围内选择合适的空闲车辆作为处理部分任务的邻近车辆。仿真结果表明所提车载边缘计算中多任务部分卸载方案相较现有方案能较好地降低时延。     

RVCloud: a routing protocol for vehicular ad hoc network in city environment using cloud computing

Routing in Vehicular Ad hoc Network (VANET) is a challenging task due to high mobility of vehicles. In this paper, a RVCloud routing protocol is proposed for VANET to send the data efficiently to the destination vehicle using cloud computing technology. In this protocol, vehicle beacon information is send to the cloud storage through the Road Side Unit (RSU). As vehicles have less storage and computing facility, the information of all the vehicles moving in the city is maintained by the cloud. Source vehicle sends the data to the destination by sending the data to the nearby RSU. After receiving the data, RSU sends a request to the cloud for an optimal RSU information, that takes minimum packet forwarding delay to send the data to the destination. Cloud provides location service by providing destination location and optimal RSU information. Then RSU sends the data to the optimal RSU using internet. By using the internet facility, packet forwarding delay and link disruption problem are reduced. Simulation results show that, RVCloud performs better than VehiCloud, P-GEDIR, GyTAR, A-STAR, and GSR routing protocols.     

DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks

In this paper, we present a diagonal-intersection-based routing (DIR) protocol for vehicular ad hoc networks. The DIR protocol constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay. The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show that the DIR protocol outperforms existing solutions in terms of packet delivery ratio, data packet delay, and throughput.     

A lightweight identity authentication protocol for vehicular networks

In vehicular ad-hoc networks (VANETs), vehicles perform a handover procedure in order to connect to the next RSU. In general, the handover procedure comprises two stages, namely searching for an appropriate road side unit (RSU) to connect to and performing an authentication procedure with the selected RSU. Since the vehicles in a VANET typically have a high mobility, frequent handover operations are required, and thus the transmission delay is inevitably increased. Accordingly, this paper proposes an authentication method designated as LIAP (Lightweight Identity Authentication Protocol) to reduce the handover authentication delay. LIAP employs a DSSP (Dynamic Session Secret Process) method to improve the speed and computational efficiency of the authentication process whilst simultaneously concealing the sensitive information of the vehicle. The security analysis results and performance evaluations show that LIAP not only provides an efficient and confidential authentication capability, but also preserves the robustness of the VANET toward malicious attacks.     

Heterogeneous Vehicular Communication Architecture and Key Technologies

Vehicular networks have traditionally been used in specific scenarios, such as Electronic Toll Collection (ETC). New vehicular networks, however, support communication of safety information between vehicles using self-organized ad-hoc technology. Because of limitations in network architecture, current vehicular networks only provide communication for mobile terminals in a vehicle cluster. Vehicles cannot exchange information with an Intelligent Traffic System (ITS) control center nor can they access broadband wireless networks. This paper proposes a novel heterogeneous vehicular wireless architecture based on Wireless Access in Vehicular Environment (WAVE, IEEE 802.11 p) and Worldwide Interoperability for Microwave Access (WiMAX,IEEE 802.16e). A new network infrastructure and system model is introduced, and key technologies are discussed. For WAVE, these technologies include adaptive multichannel coordination mechanism and scheduling algorithm; and for WiMAX, these technologies include group handover scheme and two-level resource allocation algorithm.     

Position-Based Adaptive Clustering Model (PACM) for Efficient Data Caching in Vehicular Named Data Networks (VNDN)

The seamless data delivery is essential in VANET for application such as autonomous vehicle, intelligent traffic management and for the road safety and emergency applications. The incorporation of named data networking (NDN) with VANET, intended to frame intelligent traffic flow and seamless data delivery. Such integration of vehicular ad hoc networks (VANET) with NDN is termed as vehicular named data networks (VNDN). Because of the continuous node/vehicle mobility, it is a tedious process to build constant and consistent communication between vehicles. With that concern, for enhancing the performance of VNDN and solving the issues such as frequent cluster formation on heavy loaded data transmissions, position-based adaptive clustering model (PACM) is developed. The major intention of PACM is to form clusters based on trajectory. Besides, PACM performs efficient data caching by collecting significant data from vehicles to establish consistent data communication with all nodes in the network. Efficient data caching is done with the elected cluster heads among the framed clusters based on its positions and mobility models. For handling the vehicles at higher mobility speed, mutual data caching process is also designed that makes vehicles to perform on-demand data gathering from cluster heads. Further, the model is simulated and the obtained results are compared with the existing models based on the metrics such as packet delivery ratio, mean delay, cache hit rate and mean hop distance. The comparative analysis shows that the proposed model outperforms the available techniques.

     

An Asymmetric and Asynchronous Energy Conservation Protocol for Vehicular Networks

Intelligent Transportation Systems (ITS) improve passenger/pedestrian safety and transportation productivity through the use of vehicle-to-vehicle and vehicle-to-roadside wireless communication technologies. Communication protocols in these environments must meet strict delay requirements due to the high moving speed of the vehicles. In this paper, we propose an energy-conservative MAC layer protocol, named DSRC-AA, based on IEEE 802.11 that provides power saving to the ITS communication modules (e.g., On Board Units, portable devices, and Road Side Units) while ensuring the bounded delay. DSRC-AA, a generalization of the Asynchronous Quorum-based Power-Saving (AQPS) protocols, capitalizes on the clustering nature of moving vehicles and assigns different wake-up/sleep schedules to the clusterhead and the members of a cluster. DSRC-AA is able to dynamically adapt the schedules to meet the communication delay requirements at various vehicle moving speed. Simulation results show that DSRC-AA is able to yield more than 44 percent reduction in average energy consumption as compared with the existing AQPS protocols, if to be used in vehicular networks.     

A cross-layer multihop data delivery protocol with fairness guarantees for vehicular networks

In this paper, a new cross-layer communication protocol for vehicular Internet access along highways is introduced. The objective of the new Controlled Vehicular Internet Access (CVIA) protocol is to increase the end-to-end throughput while achieving fairness in bandwidth usage between road segments. To achieve this goal, the CVIA protocol eliminates contention in relaying packets over long distances. CVIA creates single-hop vehicle clusters and mitigates the hidden node problem by dividing the road into segments and controlling the active time of each segment. Using an analytical throughput estimation model, the protocol parameters are fine-tuned to provide fairness among road segments. Simulation results confirm that the proposed CVIA protocol provides higher throughput and better fairness in multihop data delivery in vehicular networks when compared with purely IEEE 802.11-based protocols.     

A Position-Based Clustering Technique for Ad Hoc Intervehicle Communication

Intervehicle communication is a key technique of intelligent transport systems. Ad hoc networking in the vehicular environment was investigated intensively. This paper proposes a new clustering technique for large multihop vehicular ad hoc networks. The cluster structure is determined by the geographic position of nodes and the priorities associated with the vehicle traffic information. Each cluster elects one node as its cluster head. The cluster size is controlled by a predefined maximum distance between a cluster head and its members. Clusters are independently controlled and dynamically reconfigured as nodes move. This paper presents the stability of the proposed cluster structure, and communication overhead for maintaining the structure and connectivity in an application context. The simulation is performed with comparative studies using CORSIM and NS-2 simulators.     

Light weight security protocol for communications in vehicular networks

Increasing demand in user-friendly, computationally efficient and sophisticated vehicles led automobile industries to manufacture them with efficient onboard sensors, communication devices, resource rich hardware. Vehicular resources provide infotainment on-the-go. In mere future, every vehicle is a resource full machine. The vehicular resources which include computing power, storage and internet connectivity can be shared among the vehicles or can be lend over the internet to various customers. Vehicles can comprehensively make use of the resources available with road-side units (RSU’s) to communicate with other vehicles and RSU’s. Vehicular communications are useful especially in situations of accidents (or) natural calamities. Vehicles can update the RSU’s with information regarding such events. This information can then be broadcasted to the vehicles in that area or path. The proposed scheme ensures secure and efficient communications among nodes in a hierarchy consisting of vehicles, RSU’s, RSU co-ordinators and Trusted authority. The approach outlined in the paper can be used to decrease the overhead involved in secure transfer of information during communication.     

Connectivity analysis for dynamic movement of vehicular ad hoc networks

Speed variation is one of the main challenges in deriving the connectivity related predictions in mobile ad-hoc networks, especially in vehicular ad hoc networks (VANETs). In such a dynamic network, a piece of information can be rapidly propagated through dedicated short-range communication, or can be carried by vehicles when multihop connectivity is unavailable. This paper proposes a novel analytical model that carefully computes the connectivity distance for a single direction of a free-flow highway. The proposed model adopts a time-varying vehicular speed assumption and mathematically models the mobility of vehicles inside connectivity. According to the dynamic movability scenario, a novel and accurate closed form formula is proposed for probability density function of connectivity. Moreover, using vehicular spatial distribution, joint Poisson distribution of vehicles in a multilane highway and tail probability of the expected number of vehicles inside single lane in a multilane highway are mathematically investigated. The accuracy of analytical results is verified by simulation. The concluded results provide helpful insights towards designing new applications and improving performance of existing applications on VANETs.     

A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks

In this paper, we present a “spatiotemporal multicast”, called a “mobicast”, protocol for supporting applications which require spatiotemporal coordination in vehicular ad hoc networks (VANETs). The spatiotemporal character of a mobicast is to forward a mobicast message to vehicles located in some geographic zone at time t, where the geographic zone is denoted as zone of relevance (ZOR). Vehicles located in ZOR at the time t must keep the connectivity to maintain the real-time data communication between all vehicles in ZOR. The connectivity is kept of all vehicles in ZOR through the vehicular ad hoc networks (VANETs). The connectivity of ZOR is lost if any vehicle in ZOR suddenly accelerates or decelerates its velocity. The temporal network fragmentation problem is occurred such that vehicle in ZOR cannot successfully receive the mobicast messages. To solve the problem, a new mobicast protocol is presented in this work to successfully disseminate mobicast messages to all vehicles in ZOR via a special geographic zone, called as zone of forwarding (ZOF). The main contribution of this work is to develop a new mobicast routing protocol to dynamically estimate the accurate ZOF to successfully disseminate mobicast messages to all vehicles in ZOR. To illustrate the performance achievement, simulation results are examined in terms of dissemination successful rate, packet overhead multiplication, packet delivery delay, and throughput.     

Priority based efficient data scheduling technique for VANETs

As vehicular networks are gaining popularity, large number of vehicles want to take advantage of these networks, by utilizing the information they have, in order to take decision. Vehicle receives data from other vehicles or from the road side units (RSUs) available across the road. Since RSUs act as router to connect with the external world as well as it is a high capacity storage place where important data (e.g. data used in traffic safety, location dependent query, etc.) can be stored for download purpose for other vehicles moving through the service area. Since the RSUs have limited communication range and vehicles usually moves at very high speed in the service area, they have limited time to serve data to vehicles moving in the service area. For this purpose RSUs have to schedule data in such a way that maximum vehicles can get benefit from the data available with the RSUs. There are many algorithms proposed in the past to schedule data at RSUs. This paper proposes a mechanism to schedule data of those vehicles which are in the coverage range of the RSU. The proposed algorithm outperforms to serve requests whose deadline is about to expire i.e. vehicles which have left the service area after forwarding request to RSU. This scheme performs well in dense network and has good results in highway scenario.     

Road Aware Geographical Routing Protocol Coupled with Distance,Direction and Traffic Density Metrics for Urban Vehicular Ad Hoc Networks

The new information and communication technologies have changed the trend of communication in all fields. The transportation sector is one of the emerging field, where vehicles are communicating with each other or with infrastructure for different safety and comfort applications in the network. Vehicular ad hoc networks is one of the emerging multi-hop communication type of intelligent transportation field to deal with high mobility and dynamic vehicular traffic to deliver data packets in the network. The high mobility and dynamic topologies make the communication links unreliable and leads to frequent disconnectivity, delay and packet dropping issues in the network. To address these issues, we proposed a road aware geographical routing protocol for urban vehicular ad hoc networks. The proposed routing protocol uses distance, direction and traffic density routing metrics to forward the data towards the destination. The simulation results explore the better performance of proposed protocol in terms of data delivery, network delay and compared it with existing geographical routing protocols.

     

Performance modeling and analysis of emergency message propagation in vehicular ad hoc networks

Reliability and timeliness are two critical requirements of vehicle safety‐related communication services in VANETs. In this paper, we develop an analytical model to analyze the packet reception rate and end‐to‐end delay of emergency message delivery operation in a VANET environment when multihop broadcast communications are used. The model is applied to derive closed‐form expressions of the end‐to‐end delay of two popular multihop message propagation methods, that is, the farthest‐distance method and the counter‐based method. Extensive simulations are conducted to validate the correctness of the theoretic results and compare the performance of the two message propagation methods. Observations are provided for the design of efficient and robust emergency message propagation methods for vehicular wireless communication networks. Copyright © 2012 John Wiley & Sons, Ltd.     

CADMA: collision-avoidance directional medium access for vehicular ad hoc networks

Quick and accurate message transmission is an important research topic for vehicular ad hoc networks (VANET). Most studies assume that the periodic broadcast of beacon frames between vehicles increases the safety of the driver. In particular, there has been a lot of research into broadcasting based on carrier sense multiple access with collision avoidance (CSMA/CA) algorithms for medium access. However, the CSMA/CA algorithm is not an optimum technique for the VANET system, due to the transfer delay that occurs in inducing frequent collisions on transmission signals. In this paper, we propose a collision-avoidance directional medium access (CADMA) protocol and infrastructure-utilized clustering method for VANET to support reliable data transfer. In the proposed scheme, the CADMA protocol uses non-competitive transmission methods and cluster heads (CHs) to manage access by allocating the nodes resources. In addition, the roadside unit (RSU) helps with the clustering process. The simulation results indicate that the CADMA can reduce transmission delays and the collision rate of the broadcasting signal, and have shown that the CADMA can be effectively utilized for the VANET systems.