车联网中的协同通信平均传输时间计算

车联网(Internet of Vehicles,Io V)是智能交通和通信领域的热点课题,协同通信算法的研究是Io V通信的重要技术之一。针对Io V环境下因通信拓扑结构快速变化导致数据信号利用单一通信方式难以高效传输的问题,提出Io V环境下协同通信算法,利用车对车(Vehicle-to-Vehicle,V2V)和车对路(Vehicle-to-Infrastructure,V2I)协同通信方法,对目标数据从请求到完成的平均传输时间进行了理论分析和推导。仿真结果表明,该算法的传输效率比基于移动边缘计算(Mobile Edge Computing,MEC)车联网协作传输算法提升40%,比基于分簇V2X车载广播传输算法提升25%;该算法的平均传输时间随着路侧单元(Road Side Unit,RSU)缓存概率从0.5增加至1可提高9%,随着车辆缓存概率从0.5增加至1可提高46%。     

基于匿名认证的车联网安全技术研究

车联网相关应用需要基于实时、准确的交通信息。RSU会实时进行广播,同时车辆间要进行实时通信,包括车辆的身份信息、驾驶状态及位置信息等。攻击者可以利用车联网的开放性获取实时发送的空口数据,通过破解空口数据获得车辆的身份信息和位置信息,进而可以通过伪装、篡改或者植入恶意程序的方式对车辆进行攻击。因此,车联网通信过程中的信息安全问题必须得到有效的保护。基于区块链的匿名认证,车辆在V2V及V2I通信过程中将公钥作为假名进行认证,既保证了消息来源的真实性和消息的完整性,也避免了车辆身份信息的泄露。     

Data dissemination scheduling algorithm for V2R/V2V in multi-channel VANET

Considering that the data dissemination in multi-channel VANET (vehicular ad hoc network),a cooperative data dissemination scheduling algorithm was introduced for V2R(vehicle to roadside unit) and V2V(vehicle to vehicle).The algorithm created initial scheduling operators according to data requisition of vehicles.Then,initial collision graph and collision matrix were generated based on the conflict among initial scheduling operators.After proving the positive semidefinite of collision matrix,SDP (semidefinite programming) was used to channel allocation and collision graph creation.The algorithm then assigned weights for each data requisition according to dwell time and data volume of vehicles in RSU service region.Furthermore,it selected maximum weighted independent set of collision graph.The goal was to satisfy the most urgent data requisitions by V2R/V2V cooperate transmission.Transportation simulation results demonstrate that the proposed solution effectively promotes the service capacity by utilizes the multichannel of VANET and V2R/V2V transmission scheduling.     

Joint Congestion Control Strategy During V2V Communication Among Authentic Vehicles in VANET

The wireless access in vehicular environment system is developed for enhancing the driving safety and comfort of automotive users. However, such system suffers from quality of service degradation for safety applications caused by the channel congestion in scenarios with high vehicle density. In the present work channel congestion is controlled jointly by road side unit, and vehicle. The present work supports vehicle to vehicle communication of authentic safe messages among authentic vehicles only. The road side unit reduces channel congestion by allowing only the authentic vehicles to participate in vehicle to vehicle communication, and by discarding unauthentic messages from the network. It revokes vehicles which are not authentic, and vehicles which are communicating unauthentic messages. Each vehicle also participates in the reduction of channel congestion by varying the size of beacon message dynamically, by removing the duplicate messages from message queue, and also by controlling the transmission power, and transmission range of a message during transmission. It further reduces the channel congestion by controlling the message generation rate using message generation rate control algorithm. Two different message generation rate control algorithm are proposed in the present work. In the first approach it maintains the channel load to an estimated initial value whereas the second approach increases the channel load till the percentage of message loss lies below a predefined threshold. The performance of the proposed scheme is studied on the basis of percentage of successful message reception, and percentage of message loss. The performance of the two message generation rate control algorithms are also compared in the present work.     

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.     

Cooperative communication for safety message dissemination in unsaturated networks with varying contention windows

Safety message dissemination is crucial in vehicular ad hoc networks (VANETs) for road safety applications. Vehicles regularly transmit safety messages to surrounding vehicles to prevent road accidents. However, changing vehicle mobility and density can cause unstable network conditions in VANETs, making it inappropriate to use a fixed contention window (CW) for different network densities. It has been proposed a 1-D Markov model under unsaturation conditions to analyze the performance of the system with varying CWs under changing vehicle densities. Additionally, it introduces the use of cooperative communication (CoC) to relay failed safety messages. In CoC, two control packets, namely, negative acknowledge (NACK) and enable to cooperate (ETC), are utilized. The proposed analytical model named cooperative communication for safety message dissemination (CoC-SMD) is used to calculate throughput and average packet delay for varying CW and different packet size. The simulation confirms the validity of the analytical results and show significant improvement in the metrics through the use of varying CW sizes and CoC compared with existing techniques.     

基于BP和RBF神经网络的C-V2X无线资源管理

为了提升蜂窝车联网（Cellular Vehicle-to-Everything,C-V2X）资源复用的有效性和降低终端间的干扰，提出通过神经网络对未来时刻车流量的预测辅助无线资源管理方案。依据车载单元（On Board Unit,OBU）与路侧单元（Road Side Unit,RSU）间的车联网消息，获取RSU覆盖区域内各时刻的车流情况，分别采用BP（Back Propagation）神经网络和RBF（Radial Basis Function）神经网络进行短时交通流预测。RSU根据预测结果进行自适应分簇，簇间复用相同资源，簇内进行资源池的划分，RSU覆盖内的OBU在划分的资源池中选择发送资源，从而减少终端间的干扰，并保证热点区域车辆拥有更多的资源。仿真结果表明，在道路交通拥塞的场景下，所提方案的数据包接收率较标准中的方案提升14%，较典型文献方案提升10%，保证了通信的可靠性。     

Broadcast-First Service Scheduling Scheme for Vehicle-Roadside Communication

In recent years, the research of vehicular ad-hoc networks (VANET) has become increasingly popular. More and more vehicles want their requests to be served from roadside units (RSU) in VANET, thus the service scheduling of RSU becomes an important task, especially when a large number of vehicles drive past the RSU and access data. Obviously, different kinds of request messages have different degrees of emergency, in other words, request messages have different priorities while scheduling. In order to provide a more effective and appropriate scheme, in this paper we study the scheduling of service algorithm in VANET, and proposed a novel broadcast-first service scheduling scheme. That scheme is on the basis of existing priority schemes, and takes channel bandwidth and processing capability of RSU into consideration so as to cope with the challenges in vehicle-roadside data access. Finally we conduct our experimental scenario, and simulation results show that our algorithm performs better than other existing algorithms by the comparison.     

RSU-coordinated multichannel MAC protocol in vehicular ad hoc network

A road side unit (RSU)-coordinated multichannel media access control (MAC) (RMM) protocol was proposed in vehicular ad hoc network,which aimed to improve the transmission efficiency of non-safety messages.Under the coordination of RSU,nodes had more opportunities to make SCH reservations on control channel,and the contention-free message transmissions were thus realized.The proposed RMM protocol could use the service channel during the whole synchronization interval for non-safety message transmissions,and thus the saturated network throughput and channel utilization were improved,and the transmission delay was reduced.Compared with other existing protocols,extensive analysis and simulation results demonstrate the superiority of the RMM protocol.     

A multi‐channel cooperative clustering‐based MAC protocol for V2V communications

The Internet of vehicles (IoV) is an emerging networking technology, which can support information sharing and interactions among users, vehicles, and infrastructures. Various applications can be provided by IoVs, and they have very different quality‐of‐service (QoS) requirements. It is a great challenge to design an efficient MAC protocol to meet the different QoS demands of various applications in IoVs, because of unreliable links and high vehicle mobility. On the other hand, cooperative communication is effective in mitigating wireless channel impairments by utilizing the broadcast nature of wireless channels. In this paper, a multi‐channel cooperative clustering‐based MAC (MCC‐MAC) protocol, under the Dedicated Short Range Communication (DSRC) multi‐channel architecture, is presented to improve the transmission reliability of safety messages and provision QoS for different applications in IoVs. Further, we analyze the performance of MCC‐MAC, in terms of average transmission delay. In addition, extensive simulations with ns‐2 are conducted to demonstrate the performance of the proposed MCC‐MAC. Copyright © 2016 John Wiley & Sons, Ltd.     

RIALS: RSU/INS‐aided localization system for GPS‐challenged road segments

This paper introduces a new vehicle localization approach for global positioning system‐challenged road segments (e.g., tunnels), which takes advantage of roadside units (RSUs) and in‐vehicle inertial navigation system (INS). In the proposed approach, namely RSU/INS‐aided localization system (RIALS), vehicles only need one RSU in their transmission range for an accurate positioning. The beacons received from the RSU along with the information provided by the INS system are used for establishing and maintaining particular locus circles. After linearization, the system of locus circle equations is solved using the linear least square estimation technique, and the estimated vehicle's position is obtained. In the presence of speed variations and existing ranging and INS estimation errors, the proposed RIALS adaptively sets the sufficient number of required locus circles, aiming at keeping the localization error below a given threshold. We study the effects of ranging and INS estimation errors on localization accuracy of RIALS from analytical and simulation perspectives. Results of extensive simulations show that the localization error is more sensitive to the ranging error than the INS error. Moreover, the network traffic overhead of the proposed method is considerably lower than other competitive localization approaches. Copyright © 2015 John Wiley & Sons, Ltd.     

An Efficient Message Authentication Scheme for Vehicular Communications

In this paper, we introduce a novel roadside unit (RSU)-aided message authentication scheme named RAISE, which makes RSUs responsible for verifying the authenticity of messages sent from vehicles and for notifying the results back to vehicles. In addition, RAISE adopts the $k$- anonymity property for preserving user privacy, where a message cannot be associated with a common vehicle. In the case of the absence of an RSU, we further propose a supplementary scheme, where vehicles would cooperatively work to probabilistically verify only a small percentage of these message signatures based on their own computing capacity. Extensive simulations are conducted to validate the proposed scheme. It is demonstrated that RAISE yields a much better performance than previously reported counterparts in terms of message loss ratio (LR) and delay.      

Network condition and application‐based data adaptive intelligent message routing in vehicular network

Recent advances in intelligent transportation systems enable a broad range of potential applications that significantly improve the vehicle and road safety and facilitate the efficient dissemination of information among the vehicles. To assist the vehicle traffic, message broadcasting is a widely adopted technique for road safety. But efficient message broadcasting is a significant issue, especially in a high network density due to the broadcast storm problem. To solve this issue, several methods are proposed to eliminate the redundant transmission of safety packets. However, they lack in restricting the broadcasting region of safety messages, and the transmissions of safety packets outside the dangerous region, and force the vehicles to unnecessary detours. This paper proposes an adaptive multimode routing protocol, network condition, and application‐based data adaptive intelligent message routing in vehicular network (NetCLEVER) that supports 2 modes of operation such as message broadcasting and intelligent routing. In message broadcasting mode, the NetCLEVER decides the dangerous region of the network by considering the changes of neighbor vehicles velocity, instead of current vehicle velocity, because a vehicle decision in velocity is interdependent with the preceding vehicles. In intelligent routing mode, the NetCLEVER exploits the cuckoo search optimization in routing by taking into account multiple routing factors such as the road topology of intersections and traffic signals and their impact on link stability, which improves the reliability of routing packets significantly. The performance evaluation illustrates that the proposed NetCLEVER improves reliable wireless communication as well as road safety in vehicular ad hoc networks.     

A roadside unit‐based localization scheme for vehicular ad hoc networks

Vehicular Ad Hoc Networks (VANETs), designed to ensure the safety and comfort of passengers via the exchange of information amongst nearby vehicles or between the vehicles and Roadside Units (RSUs), have attracted particular attention. However, the success of many VANET applications depends on their ability to estimate the vehicle position with a high degree of precision, and thus, many vehicle localization schemes have been proposed. Many of these schemes are based on vehicle‐mounted Global Positioning System (GPS) receivers. However, the GPS signals are easily disturbed or obstructed. Although this problem can be resolved by vehicle‐to‐vehicle communication schemes, such schemes are effective only in VANETs with a high traffic density. Accordingly, this paper presents a VANET localization scheme in which each vehicle estimates its location on the basis of beacon messages broadcast periodically by pairs of RSUs deployed on either side of the road. In addition, three enhancements to the proposed scheme are presented for the RSU deployment, RSU beacon collisions, and RSU failures. Overall, the ns‐2 simulation results show that the localization scheme achieves a lower localization error than existing solutions on the basis of vehicle‐to‐vehicle communications and is robust toward changes in the traffic density and the vehicle speed. Copyright © 2012 John Wiley & Sons, Ltd.     

VDNet: an infrastructure‐less UAV‐assisted sparse VANET system with vehicle location prediction

Vehicular Ad Hoc Network (VANET) has been a hot topic in the past few years. Compared with vehicular networks where vehicles are densely distributed, sparse VANET have more realistic significance. The first challenge of a sparse VANET system is that the network suffers from frequent disconnections. The second challenge is to adapt the transmission route to the dynamic mobility pattern of the vehicles. Also, some infrastructural requirements are hard to meet when deploying a VANET widely. Facing these challenges, we devise an infrastructure‐less unmanned aerial vehicle (UAV) assisted VANET system called V ehicle‐D rone hybrid vehicular ad hoc Net work (VDNet), which utilizes UAVs, particularly quadrotor drones, to boost vehicle‐to‐vehicle data message transmission under instructions conducted by our distributed vehicle location prediction algorithm. VDNet takes the geographic information into consideration. Vehicles in VDNet observe the location information of other vehicles to construct a transmission route and predict the location of a destination vehicle. Some vehicles in VDNet equips an on‐board UAV, which can deliver data message directly to destination, relay messages in a multi‐hop route, and collect location information while flying above the traffic. The performance evaluation shows that VDNet achieves high efficiency and low end‐to‐end delay with controlled communication overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

基于DF中继协作的车联网安全传输性能研究

5G时代的到来加快了以车路协同为核心的车联网技术的发展脚步。高效，可靠，安全的通信质量将是实现智能交通管理系统，完善智慧出行的基本要求。因此，针对存在信息窃取者的车联网中继协作传输场景，利用机会式中继选择策略与最大比合并技术设计了直接传输链路与多跳中继转发链路共存的安全传输方案，旨在提高信息传输的可靠性及安全性。同时，在获得信道概率密度函数及累积分布函数的基础上，利用全概率公式等方法推导出基于DF(Decode-Forward)中继协作传输的车联网系统安全中断概率的闭合表达式，其中涉及的信息传输信道均服从Nakagami-m分布，提高了理论推导的难度。最终的仿真实验证实了理论推导的准确性及本方案的可行性。      

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.     

多信道车载网中基于时分多址的MAC改进算法

车载网(VANETs)需提供时延敏感的安全应用和非安全应用的通信服务.这就使得媒体接入控制(MAC)协议既要满足安全消息的时延和可靠率,又要保证非安全消息的服务信道利用率,给MAC的设计提出了挑战.为此,提出基于时分多址的MAC改进算法(I-TDMA-MAC).I-TDMA-MAC算法在每个同步帧内给每辆车分配两个子时隙,旨在提高无碰撞信道接入率和安全消息的传递率.同时,对空闲时隙采取重分配策略,并基于最短作业优先准则(SJF)给空闲时隙设置优先级,旨在提高服务信道利用率.仿真结果表明,提出的I-TDMA-MAC算法的安全消息传递率高达99%,当车流密度到达100 vehicle/km时,服务信道利用率接近于90%.     

On the performance of cooperative vehicular networks under antenna correlation at RSU

Vehicular communications is gradually becoming mature after decades of exciting developments and thriving advances. Resultantly, these advances have opened new possibilities for vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications to meet the requirements of safety applications and future self-driving technologies. While performance limits of single link vehicular communications have been well analyzed in the literature, only incremental growth has been shown in the domain of multi-antenna communications. Another major concern is that the existing works mostly assume independent fading at the antennas mounted on road side unit (RSU), thus neglecting the impact of channel correlation. Our work addresses this issue by evaluating packet error probability for two renowned antenna correlation models i.e., constant correlation (CC) and exponential correlation (EC), under Nakagami-m fading. We also consider cooperation between intermediate vehicles to ensure reliable communication from the source vehicle to the RSU. More specifically, we derive closed-form expressions of packet error probability for three cooperative techniques, namely, single helper selection (SHS), multi-hop cooperative selection (MCS) and multiple helper selection (MHS). We quantify the performance variations for different numbers of intermediate helper vehicles, and for varying values of fading parameter and correlation coefficients. Finally, we validate our mathematical derivations by performing extensive simulations in MATLAB.     

Fire Controlling Under Uncertainty in Urban Region Using Smart Vehicular Ad hoc Network

Every year thousands of urban and industrial fires occur, which leads to the destruction of infrastructure, buildings, and loss of lives. One of the reasons behind this is the delayed transmission of information to the fire station and the nearer hospitals for ambulance service as the transmission of information is dependent on observer at the location where the fire is caught and cellular network. This paper proposed an automated routing protocol for the urban vehicular ad-hoc network to send the information from the location where the fire is caught to the nearest fire stations and hospitals with optimum service time. This transmission of information involves Road Side Unit (RSU) at the junction and the vehicles present in the transmission path. Selection of route to transmit faulty vehicle information from the RSU to the required faulty vehicle is based on a parameter called path value. The computation of path value is done by the attributes such as expected End To End (E2E) delay, the shortest distance to destination, the density of vehicle between the junctions, and attenuation. From the current junction, the selection of the next junction is based on minimum path value. The proposed routing protocol considers the performance parameters such as E2E delay, total service time (TST), number of network fragments or network gaps, number of hops, and attenuation for the propagation path for the evaluation of the proposed methodology. The proposed routing algorithm is implemented through OmNet++ and SUMO. Results obtained for the proposed routing protocol is compared with three existing VANET protocols (GSR, A-STAR, and ARP) in terms of End To End delay, number of hops, number of vehicular gaps, and Total Service Time (TST).