AMOEBA: Robust Location Privacy Scheme for VANET

Communication messages in vehicular ad hoc networks (VANET) can be used to locate and track vehicles. While tracking can be beneficial for vehicle navigation, it can also lead to threats on location privacy of vehicle user. In this paper, we address the problem of mitigating unauthorized tracking of vehicles based on their broadcast communications, to enhance the user location privacy in VANET. Compared to other mobile networks, VANET exhibits unique characteristics in terms of vehicular mobility constraints, application requirements such as a safety message broadcast period, and vehicular network connectivity. Based on the observed characteristics, we propose a scheme called AMOEBA, that provides location privacy by utilizing the group navigation of vehicles. By simulating vehicular mobility in freeways and streets, the performance of the proposed scheme is evaluated under VANET application constraints and two passive adversary models. We make use of vehicular groups for anonymous access to location based service applications in VANET, for user privacy protection. The robustness of the user privacy provided is considered under various attacks.     

Towards efficient data collection mechanisms in the vehicular ad hoc networks

Recently, the fast growth of communication technology has led to the design and implementation of different types of networks in different environments. One of these remarkable networks is vehicular ad hoc network (VANET). The ubiquitous connectivity among vehicles is possible through VANET in the absence of fixed infrastructure. Moreover, it provides safety and comfort to people sitting in the vehicles. In this regard, collecting information from vehicles that are moved constantly is an essential challenge. To develop an efficient method for data collection in the VANET, some parameters must be considered such as data aggregation, latency, packet delivery ratio, packet loss, scalability, security, transmission overhead, and vehicle density. Since data collection has a significant importance in the VANET, the aim of this study is to investigate the existing methods and describe the types of important issues and challenging problems that can be addressed in data collection in the VANET. The data collection techniques are investigated in four primary groups, namely, topology‐based, cluster‐based, geocast‐based, and fog‐based. Also, the mentioned parameters are important to compare all of the presented techniques.     

基于自组织映射神经网络的VANET组网算法

研究了应用于汽车辅助驾驶、无人驾驶等智能交通领域的车辆组网方法,提出一种将自组织映射神经网络算法应用于车辆自组织网络进行车辆组网的算法,该算法根据车辆定时发出的消息中位置、行驶方向等信息对车辆按目的地、行驶方向的相似性进行组网,组网后的车辆主要接收并处理与之在同一个网络中的车辆的信息。理论分析和仿真结果表明,组网后的系统传输时延远低于未组网通信情况,吞吐量有显著提高。     

TOPVISOR: Two‐level controller‐based approach for service advertisement and discovery in vehicular cloud network

Vehicular cloud is a kind of mobile cloud in which vehicles share their resources and provide services for each other. The first step in establishing a vehicular cloud network is the service advertisement and discovery. Due to the dynamic nature of vehicular cloud networks, services are not continuous and the service location may vary at any time depending on the vehicle location. Therefore, higher network traffic is generated to access the consistent and up‐to‐date information. In this paper, a two‐level hierarchical approach is proposed for service advertisement and discovery in vehicular cloud networks. To register the services' specification in this approach, the distributed directories in RSUs and central controllers are used. Moreover, a method is used to avoid extra update packets by localizing the updates. The simulation results show improvement in the packet delivery rate as well as a reduction in transmission bandwidth preventing the network congestion.     

A delay‐bounded routing protocol for vehicular ad hoc networks with traffic lights

In vehicular ad hoc networks, vehicles may use a routing protocol to inform emergent events, for example, car accidents or traffic jams. Hence, many of the researchers are focused on minimizing the end‐to‐end delay of the routing protocol. However, some applications, for example, email or ftp, are not time critical, and radio spectrum is a limited resource. Hence, delay‐bounded routing protocol, whose goal is to deliver messages to the destination within user‐defined delay and minimize the usage of radio, has become an important issue. The delay‐bounded routing protocols deliver message to the destination by the hybrid of data muling (carried by the vehicle) and forwarding (transmitted through radio). When the available time is enough, the message will be delivered by muling; otherwise, it will be delivered by forwarding. However, in an urban area, there are many traffic lights, which may greatly affect the performance of the delay‐bounded routing protocols. Existing works do not consider the effect of traffic lights, and hence, it may adopt an improper delivery strategy and thus wastes much available time. To improve previous works, we propose a novel delay‐bounded routing protocol, which has considered the effect of traffic lights. Whenever a vehicle passes an intersection, it will gather the information of the traffic light and traffic load of the next road section, and thus, it can make a more accurate prediction and adopt a more proper strategy to deliver message. Simulation results show that the proposed protocol can make a better usage of the available time and uses less radio resource to deliver the message in time. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

A fuzzy logic approach to beaconing for vehicular ad hoc networks

Vehicular Ad Hoc Network (VANET) is an emerging field of technology that allows vehicles to communicate together in the absence of fixed infrastructure. The basic premise of VANET is that in order for a vehicle detect other vehicles in the vicinity. This cognizance, awareness of other vehicles, can be achieved through beaconing. In the near future, many VANET applications will rely on beaconing to enhance information sharing. Further, the uneven distribution of vehicles, ranging from dense rush hour traffic to sparse late night volumes creates a pressing need for an adaptive beaconing rate control mechanism to enable a compromise between network load and precise awareness between vehicles. To this end, we propose an intelligent Adaptive Beaconing Rate (ABR) approach based on fuzzy logic to control the frequency of beaconing by taking traffic characteristics into consideration. The proposed ABR considers the percentage of vehicles traveling in the same direction, and status of vehicles as inputs of the fuzzy decision making system, in order to tune the beaconing rate according to the vehicular traffic characteristics. To achieve a fair comparison with fixed beaconing schemes, we have implemented ABR approach in JIST/SWANs. Our simulation shows that the proposed ABR approach is able to improve channel load due to beaconing, improve cooperative awareness between vehicles and reduce average packet delay in lossy/lossless urban vehicular scenarios.     

SINR and throughput improvement for VANET using fuzzy power control

This paper proposes transmission power control for vehicular ad hoc network (VANET) using fuzzy system. Despite the potential advantages of VANET especially for safety and intelligent transportation system, some challenges are discovered during the implementation of VANET. Main challenges emerge because of the dynamic environment and high mobility of vehicle. Furthermore, the interference due to the shared‐spectrum usage can significantly decrease the quality of signal. Fuzzy system is implemented to control the transmission power based on the signal to interference and noise ratio (SINR) difference with the targeted value of the receiver vehicle and the interference inflicted by the transmitter vehicle. The algorithm of fuzzy power control for VANET is proposed, and the performance is evaluated through the simulations. The results of simulations show that the proposed algorithm can increase SINR of vehicles especially the vehicles with SINR value below the target. Thus, the average of SINR and the throughput of the system can be increased as well.     

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).

     

Interference-aware node access scheme in UAV-aided VANET

In vehicular Ad Hoc network (VANET),frequent link handovers and channel interference can lead to increased transmission delay and decreased network throughput.To address the issues,unmanned aerial vehicle (UAV) were introduced to cooperate with vehicles and construct UAV-assisted air-ground integrated VANET.An interference-aware node access scheme was proposed.The node access problem was formulated as a multi-objective optimization problem considering link transmission rate,link handovers and transmit power.Then the optimization problem was decomposed into two convex optimization sub-problems by dual decomposition method,the sub-problem jointly optimizes handovers and link transmission rate while the sub-problem optimizes the transmit power based on link reliability.Finally,simulation results show that the proposed mechanism can effectively improve data delivery ratio,average end-to-end delay and network throughput.     

FGWSO‐TAR: Fractional glowworm swarm optimization for traffic aware routing in urban VANET

In mobile distributed applications, such as traffic alert dissemination, dynamic route planning, file sharing, and so on, vehicular ad hoc network (VANET) has emerged as a feasible solution in recent years. However, the performance of the VANET depends on the routing protocol in accord with the delay and throughput requirements. Many of the routing protocols have been extensively studied in the literature. Although there are exemptions, they escalate research challenges in traffic aware routing (TAR) protocol of VANET. This paper introduces the fractional glowworm swarm optimization (FGWSO) for the TAR protocol of VANET in an urban scenario that can identify the optimal path for the vehicle with less traffic density and delay time. The proposed FGWSO searches the optimal routing path based on the fitness function formulated in this paper. Fractional glowworm swarm optimization is the combination of the GWSO and fractional theory. Moreover, exponential weighted moving average is utilized to predict the traffic density and the speed of the vehicle, which is utilized as the major constraints in the fitness function of the optimization algorithm to find the optimal traffic aware path. Simulation of FGWSO shows the significant improvement with a minimal end‐to‐end delay of 6.6395 seconds and distance of 17.3962 m, respectively, in comparison with the other existing routing approaches. The simulation also validates the optimality of the proposed TAR protocol.     

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.     

VANET中抗被动和主动攻击的位置隐私保护方案(英文)

Existing location privacypreserving methods,without a trusted third party,cannot resist conspiracy attacks and active attacks.This paper proposes a novel solution for location based service(LBS) in vehicular ad hoc network(VANET).Firstly,the relationship among anonymity degree,expected company area and vehicle density is discussed.Then,a companion set V is set up by k neighbor vehicles.Based on secure multi-party computation,each vehicle in V can compute the centroid,not revealing its location to each other.The centroid as a cloaking location is sent to LBS provider(P)and P returns a point of interest(POI).Due to a distributed secret sharing structure,P cannot obtain the positions of non-complicity vehicles by colluding with multiple internal vehicles.To detect fake data from dishonest vehicles,zero knowledge proof is adopted.Comparing with other related methods,our solution can resist passive and active attacks from internal and external nodes.It provides strong privacy protection for LBS in VANET.     

A Dual Ring Connectivity Model for VANET Under Heterogeneous Traffic Flow

Vehicular ad-hoc network (VANET) is characterized as a highly dynamic wireless network due to the dynamic connectivity of the network nodes. To achieve better connectivity under such dynamic conditions, an optimal transmission strategy is required to direct the information flow between the nodes. Earlier studies on VANET’s overlook the characteristics of heterogeneity in vehicle types, traffic structure, flow for density estimation, and connectivity observation. In this paper, we have proposed a heterogeneous traffic flow based dual ring connectivity model to enhance both the message disseminations and network connectivity. In our proposed model the availability of different types of vehicles on the road, such as, cars, buses, etc., are introduced in an attempt to propose a new communication structure for moving vehicles in VANETl under cooperative transmission in heterogeneous traffic flow. The model is based on the dual-ring structure that forms the primary and secondary rings of vehicular communication. During message disseminations, Slow speed vehicles (buses) on the secondary ring provide a backup path of communication for high speed vehicles (cars) moving on the primary ring. The Slow speed vehicles act as the intermediate nodes in the aforementioned connectivity model that helps improve the network coverage and end-to-end data delivery. For the evaluation and the implementation of dual-ring model a clustering routing scheme warning energy aware cluster-head is adopted that also caters for the energy optimization. The implemented dual-ring message delivery scheme under the cluster-head based routing technique does show improved network coverage and connectivity dynamics even under the multi-hop communication system.     

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.     

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.     

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.      

新的基于变色龙的车载通信安全与隐私保护

在车载自组网（VANET）中许多服务和应用需要保护数据通信的安全,为提高驾驶的安全性和舒适性,一些与交通状况有关的信息就要被周期性地广播并分享给司机,如果用户的身份和信息没有隐私和安全的保证,攻击者就会通过收集和分析交通信息追踪他们感兴趣的车辆,因此,匿名消息身份验证是VANET中不可或缺的要求。另一方面,当车辆参与纠纷事件时,证书颁发机构能够恢复车辆的真实身份。为解决车载通信这一问题,郭等人在传统方案的基础上提出一种基于椭圆曲线的变色龙散列的隐私保护验证协议。虽然此方案较之前方案具有车辆身份可追踪性和高效率性,但分析表明此方案不满足匿名性。对郭等人的方案进行安全性分析并在此基础上做出改进。     

PSO Optimized Geocast Routing in VANET

Wireless Personal Communications - High speed of vehicles in vehicular ad hoc network (VANET) makes the dissemination of information from source to destination a very challenging task. The moving...     

Localizing non‐line‐of‐sight nodes in Vehicluar Adhoc Networks using gray wolf methodology

Vehicular ad hoc networks (VANETs) evolved by adopting the principles of mobile ad hoc networks. This network has been designed to deploy safety related application in vehicular node in the less chaotic environment in road scenarios. Vehicles exchange emergency messages through direct communication. In a practical situation, a direct communication between the vehicles is not possible, and it is prohibited by either static or dynamic obstacles. These obstacles prevent the direct communication between the vehicles and can craft a situation like non‐line of sight (NLOS). This NLOS becomes a perennial problem to the researchers as it creates localization and integrity issues which are considered to be important for road safety applications. Handling the moving obstacles is found to be a challenging one in the VANET environment as obstacles like truck are found to have similar characteristics of the vehicular nodes. This paper utilizes the merits of the meta‐heuristic approach and makes use of the improved gray wolf optimization algorithm for improving the localization and integrity services of the VANET by overcoming the NLOS conditions. The proposed methodology is found to have improved neighborhood awareness, reduced latency, improved emergency message delivery rate, and reduced mean square error rate.