Cluster based emergency message broadcasting technique for vehicular ad hoc network

Broadcasting is one of the major emergency services of Vehicular ad hoc network, since the number of vehicles increases every day. Because of the high density of the vehicles, it is necessary to broadcast emergency messages to all the vehicles to avoid traffic jam and vehicle accidents. Reliable broadcasting of messages in self-organizing Ad hoc networks is a promising research field. In this paper a cluster based emergency message broadcasting algorithm is proposed. In this regard we have proposed cluster based architecture for emergency message dissemination and collision avoidance in VANET. In this paper, first the formation of cluster is done in such a way that it avoids any kind of collision. Once cluster head is selected it takes the responsibility of intra cluster management to avoid interference between the clusters. To increase the reliability during emergency message dissemination two MAC layer broadcasts protocol is used. This assures that message is delivered on time without any hazards. The proposed model is simulated for DSDV, AODV, and DSR protocols with the standards 802.11 and 802.11p in SHWM, Manhattan and freeway mobility models.     

Analysis and Design of Warning Delivery Service in Intervehicular Networks

This paper focuses on inter-vehicular networks providing warning delivery service. As soon as a danger is detected, the propagation of a warning message is triggered, with the aim of guaranteeing a safety area around the point in which the danger is located. Multiple broadcast cycles can be generated so that a given lifetime of the safety area is guaranteed. The service is based on multi-hop ad hoc inter-vehicular communications with a probabilistic choice of the relay nodes. The scenario we consider consists of high speed streets, such as highways, in which vehicles exhibit one-dimensional movements along the direction of the road. We propose an analytical model for the study of this service and derive performance indices such as the probability that a vehicle is informed, the average number of duplicate messages received by a vehicle and the average delay. Moreover, we use the model to discuss system design issues, which include the proper setting of the forwarding probability at each vehicle, so that a given probability to receive the warning can be guaranteed to all vehicles in the safety area. The model is validated against simulation results. Since it is very accurate, the model can be instrumental to the performance evaluation and design of broadcasting techniques in inter-vehicular networks.     

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.     

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.     

Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks

Vehicular Ad-Hoc Networks (VANETs) enable inter vehicle wireless communication as well as communication with road side equipment. Warning messages can be exchanged among nearby vehicles, helping to predict dangerous situations, and thus improving road safety. Such safety messages require fast delivery and minimal delay to local areas, in order for them to be effective. Therefore, a fast and efficient channel access scheme is required. A feasible solution, derived from the Mobile Ad-Hoc Networks (MANETs) field, groups nodes into smaller manageable sections called clusters. Such an approach can be beneficial for locally delivering messages under strict time constraints. In this paper, a Hierarchical Clustering Algorithm (HCA) is presented. HCA is a distributed randomized algorithm, which manages channel access by forming three hierarchy clusters. The proposed channel access scheme enables delay bounded reliable communication. Unlike other common clustering algorithm for VANETs, HCA does not require the knowledge of the vehicles’ locations. This feature guarantees accurate operation even when localization systems such as GPS are not available. The running time and message complexity were analyzed and simulated. Simulation results show that the algorithm behaves well especially under realistic mobility patterns; therefore, it is a suitable solution for channel access scheme for VANETs.     

RPB-MD: Providing robust message dissemination for vehicular ad hoc networks

To improve traffic safety and efficiency, it is vital to reliably send traffic-related messages to vehicles in the targeted region in vehicular ad hoc networks (VANETs). In this paper, we propose a novel scheme, relative position based message dissemination (RPB-MD), to reliably and efficiently disseminate messages to the vehicles in the zone-of-relevance. Firstly, the relative position based (RPB) addressing model is proposed to effectively define the intended receivers in the zone-of-relevance. To ensure high message delivery ratio and low delivery delay, directional greedy broadcast routing (DGBR) is introduced to make a group of candidate nodes hold the message for high reliability. Moreover, to guarantee efficiency, the protocol time parameters are designed adaptively according to the message attributes and local vehicular traffic density. The protocol feasibility is analyzed to illustrate the robustness and reliability of RPB-MD. Simulation results show that RPB-MD, compared with representative existing schemes, achieves high delivery ratio, limited overhead, reasonable delay and high network reachability under different vehicular traffic density and data sending rate.     

Evolved broadcast scheduling mechanism supporting energy conserving e-MBMS transmission

This study designed a data broadcasting method called evolved broadcast scheduling algorithm (eBSA) to further support LTE evolved multimedia broadcast/multicast services (e-MBMS). This eBSA provides new scheduling technology for e-MBMS and a new information searching method for user equipments that simultaneously conserves user equipment energy and maintains favorable access latency of broadcast messages. The eBSA constructs index and message channels based on the message popularities, using the index channel to guide user equipments to rapidly locate the position of the desired message in the message channel. Consequently, a short mean access time and mean turning time can be attained. The results of numerical analysis verify that when access messages possess skewed access characteristics, the proposed eBSA method performs exceptionally. Additionally, by adequately adjusting the parameter provided by the eBSA method, the optimal tradeoff between energy conservation and access latency performance can be attained.     

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.     

物联网环境中基于车联网与3G网络的跨层安全相关广播业务结构(英文)

As Vehicle Ad Hoc Networks (VANETs) is part of the applications of the Internet of Things (IoT), and Vehicles in VANETs periodically broadcast the beacon message for status advertisement to provide public safety, the impacts of the network parameters on the reliability of broadcast messages are investigated and discussed; meanwhile, a cross-layer safety-critical broadcast service architecture is proposed to obtain an optimized set of packet loss rate and delay based on the Neural Networks (NN) and Back Prop...     

A Street Broadcast Reduction Scheme (SBR) to Mitigate the Broadcast Storm Problem in VANETs

In urban vehicular wireless environments, several vehicles can send warning messages and so every vehicle within the transmission range will receive the broadcast transmission, possibly rebroadcasting these messages to other vehicles. This increases the number of vehicles receiving the traffic warning messages. Hence, redundancy, contention, and packet collisions due to simultaneous forwarding (usually known as the broadcast storm problem), can occur. In the past, several approaches have been proposed to solve the broadcast storm problem in wireless networks such as Mobile ad hoc Networks MANETs. In this paper, we present Street Broadcast Reduction SBR, a novel scheme that mitigates the broadcast storm problem in VANETs. SBR also reduces the warning message notification time and increases the number of vehicles that are informed about the alert.     

Fast data access and energy‐efficient protocol for wireless data broadcast

In wireless mobile computing environments, broadcasting is an effective and scalable technique to disseminate information to a massive number of clients, wherein the energy usage and responsiveness are considered major concerns. Existing air indexing schemes for data broadcast have focused on energy efficiency (reducing tuning time) only. On the other hand, existing broadcast scheduling schemes have aimed at reducing access latency through nonflat data broadcast to improve responsiveness only. Not much work has addressed the energy efficiency and responsiveness issues concurrently. In this paper, we propose a fast data access scheme concurrently supporting energy saving protocol that constructs the broadcast channels according to the access frequency of each type of message in order to improve energy efficiency in mobile devices (MDs). The pinwheel scheduling algorithm (PSA) presented in this paper is used to organize all types of messages in the broadcast channel in the most symmetrical distribution in order to reduce both the tuning and access time. The performance of the proposed mechanism is analyzed, and the improvement over existing methods is demonstrated numerically. The results show that the proposed mechanism is capable of improving both the tuning and access time due to the presence of skewness in the access distribution among the disseminated messages. Copyright © 2011 John Wiley & Sons, Ltd.     

SEAD: A simple and efficient adaptive data dissemination protocol in vehicular ad-hoc networks

Vehicular ad-hoc network (VANET) is becoming a promising technology for improving the efficiency and the safety of intelligent transportation systems by deploying a wide variety of applications. Smart vehicles are expected to continuously exchange a huge amount of data either through safety or non-safety messages dedicated for road safety or infotainment and passenger comfort applications, respectively. One of the main challenges posed by the study of VANET is the data dissemination design by which messages have to be efficiently disseminated in a high vehicular speed, intermittent connectivity, and highly dynamic topology. In particular, broadcast mechanism should guarantee fast and reliable data delivery within a limited wireless bandwidth in order to fit the real time applications’ requirements. In this work, we propose a simple and efficient adaptive data dissemination protocol called “SEAD”. On the one hand, the originality of this work lies in its simplicity and efficiency regardless the application’s type. Simplicity is achieved through a beaconless strategy adopted to take into account the surrounding vehicles’ density. Thanks to a metric locally measured, each vehicle is able to dynamically define an appropriate probability of rebroadcast to mitigate the broadcast storm problem. Efficiency is manifested by reducing excessive retransmitted messages and hence promoting the network capacity and the transmission delay. The simulation results show that the proposed protocol offers very low packet drop ratio and network load while still maintaining a low end-to-end delay and a high packet delivery. On the other hand, SEAD protocol presents a robust data dissemination mechanism which is suitable either for safety applications or for other kinds of application. This mechanism is able to adapt the protocol performance in terms of packet delivery ratio to the application’s requirements.     

MLAS: Multiple level authentication scheme for VANETs

The vehicular ad hoc network (VANET) is an emerging type of network which enables vehicles on roads to inter-communicate for driving safety. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. traffic accidents) to other vehicles. However, this raises the concern of security and privacy. Messages should be signed and verified before they are trusted while the real identity of vehicles should not be revealed, but traceable by authorized party. Existing solutions either rely too heavily on a tamper-proof hardware device, or do not have an effective message verification scheme. In this paper, we propose a multiple level authentication scheme which still makes use of tamper-proof devices but the strong assumption that a long-term system master secret is preloaded into all tamper-proof devices is removed. Instead the master secret can be updated if needed to increase the security level. On the other hand, messages sent by vehicles are classified into two types – regular messages and urgent messages. Regular messages can be verified by neighboring vehicles by means of Hash-based Message Authentication Code (HMAC) while urgent messages can only be verified with the aid of RSUs nearby by means of a conditional privacy-preserving authentication scheme. Through extensive simulation, we show that our multiple level authentication scheme is much more efficient that those RSU-aided authentication scheme as long as the proportion of urgent messages is less than 100%. The verification delay required can be up to 110 times smaller than other protocols. Our implementation shows that batch verification may not be as efficient as expected. In case without batch verification, the verification delay required by our scheme can even be up to 173 times smaller.     

SafeAnon: a safe location privacy scheme for vehicular networks

In most safety applications within vehicle ad-hoc networks (VANETs), vehicles need to periodically broadcast messages with information of their precise positions to others. These broadcast messages, however, make it easy to track vehicles and will likely lead to violations of personal privacy. Unfortunately, most of the current location privacy enhancement methodologies in VANETs suffer some shortcomings and do not take driving safety into consideration. In this paper, we propose a safe distance based location privacy scheme called SafeAnon, which can significantly enhance location privacy as well as traffic safety. By simulating vehicular mobility in a cropped Manhattan map, we evaluate the performance of the proposed scheme under various conditions. The mean entropy, warning broadcast ratio, and mean silent period of SafeAnon scheme are increasing 58%, 281%, and 50% respectively than the random silent period (RSP) scheme. The total broadcast ratio is also 33% less than that in the RSP scheme.     

基于可变距离的车联网D2D通信连接选择

车联网是移动互联网的延伸,其中基站协作的D2D通信适用于车间交通消息的短距离无线传播.针对车辆快速移动导致的通信链路动态性,提出了一种基于可变距离的D2D连接选择方法.通过选择行车道及车间距离参数,估计D2D连接对的信道质量,推导了D2D连接选择的优先指数,并基于该优先指数建立D2D通信链路进行交通消息传播.仿真结果显示,所提方法在D2D连接的生存时间、传输效率方面得到提高,同时降低了D2D通信的中断概率,提升了车辆间通信可靠性.     

An adaptive algorithm for connecting mobile ad hoc network to Internet with unidirectional links supported

The performance of Internet connectivity is degraded dramatically by blind rebroadcast of gateway discovery packets when obvious unidirectional links are ignored. To overcome this problem, an effective adaptive gateway discovery algorithm for connecting mobile ad hoc network to Internet with unidirectional links supported is proposed in this paper. On the basis of modification for ad hoc on-demand distance vector (AODV), through rebroadcasting the gateway discovery messages and gateway advertisement messages, both of which are extended with local connection information, unidirectional links are successfully removed from global route computations and Internet connectivity is simultaneously enhanced. Furthermore, an adaptive Internet working scheme is adopted to provide the best coverage of gateway advertisement according to dynamically adjusting broadcast range and sending interval of gateway advertisement messages in terms of network conditions. Simulation results show that the proposed hybrid Internet connectivity algorithm can provide better connectivity performance due to avoiding unidirectional links effectively with reasonable overhead.     

<Emphasis Type="Italic">EIAS-CP:</Emphasis> new efficient identity-based authentication scheme with conditional privacy-preserving for VANETs

In VANETs, vehicles broadcast traffic-related messages periodically according to Dedicated Short Range Communication protocol. To ensure the reliability and integrity of messages, authentication schemes are involved in VANETs. As traffic-related messages are time-sensitive, they must be verified and processed timely, or it may cause inestimable harm to the traffic system. However, the OBUs and the RSUs are limited in computation ability and cannot afford vast messages’ verification. Recently, some identity-based authentication schemes using bilinear pairing have been proposed to improve the efficiency of message verification for VANETs. Nevertheless, the bilinear pairing is not suited for VANETs due to its complex operations. The design of an efficient and secure authentication scheme with low computation cost for VANETs still is a rewarding challenge. To settle this challenge, a new efficient identity-based authentication scheme is proposed in this paper. The proposed scheme ensures reliability and integrity of messages and provides conditional privacy-preserving. Compared with the most recent proposed authentication schemes for VANETs, the computation costs of the message signing and verification in the proposed scheme reduce by 88 and 93 % respectively, while security analysis demonstrates that our proposed scheme satisfies all security and privacy requirements for VANETs.     

The performance of layered broadcast with superposition coding

In wireless broadcast system, where feedback is limited and channel state information is only available at the receiver side, layered broadcasting approach has been proposed to fully utilize the channel resources by providing different levels of service quality to users with different channel conditions. However, no upper bound has been given yet to show how the layered broadcast scheme will outperform the conventional broadcast (CB) scheme. In this paper, system average achievable rate (SAAR) is defined as the mean achievable rate of all users within the coverage. Based on continuum superposition coding (SC) with infinite layers, the upper bound of the SAAR of layered broadcasting is given by the derivation of the optimal power distribution function among the superposed layers. The results show that, by promoting the experience of stronger users (users with better channel conditions) without seriously degrading the performance of weaker users (users with worse channel conditions), layered broadcasting approach greatly increases the average system performance. Copyright © 2011 John Wiley & Sons, Ltd.     

Synchronous 2D/3D Switching System for Service‐Compatible 3DTV Broadcasting

This paper proposes a new broadcasting system for the service‐compatible 3DTV in which the 3D service can coexist with the conventional digital TV broadcast. In the proposed system, the commercial 3DTV service can be implemented via the existing DTV channel without utilizing the dedicated 3DTV system. This 2D/3D system interworks with the conventional system and can switch to 2D or 3D service according to the broadcast programming and schedule. The system also provides a mechanism that can prevent the synchronization mismatch between left and right video streams and between the stream and the associated signaling in the 2D/3D transition periods. The picture quality measurements are carried out based on the ITU‐R recommended test to check the level of quality of service provided by the proposed scheme. The conformity tests are also performed with the conventional channel and the receiver for the DTV system to confirm the feasibility of the proposed one for the commercial service.