Inter-vehicular Communication Research Articles

Joint Relay and Antenna Selection in MIMO PLNC Inter-vehicular Communication Systems over Cascaded Fading Channels

We investigate the joint relay and antenna selection performance in a multiple input multiple output (MIMO) Vehicle-to-Vehicle (V2V) communication system employing physical layer network coding (PLNC) with amplify-and-forward (AF) scheme at the relay antenna. Analytic results are derived under the cascaded Nakagami-m fading channel model assumption, which covers cascaded Rayleigh and conventional cellular channel models as well. We evaluate the performance of the system in terms of joint outage probability of sources and derive closed-form expressions for lower and upper bounds while an exact expression is found as a single integral form. Besides, the asymptotic diversity order is analyzed and quantified as a function of number of relays and antennas installed on the source and relay vehicles, and channel parameters. Finally, we verify the analytic derivations by computer simulations. Our results show that the outage probability performance decreases with the increasing cascading degrees of the channels but joint relay and antenna selection enhances the performance of the system superbly with the increasing number of relays and antennas. Also it is shown throughout all the simulation results, the lower bound for the joint outage probability seems to consistently be well tight for large SNR. Therefore it can be used for practical design of inter-vehicular communication systems which contain multiple relays and antennas.

Modeling chain collisions in vehicular networks with variable penetration rates

The vehicular ad hoc network has great potential in improving traffic safety. One of the most important and interesting issues in the research community is the safety evaluation with limited penetration rates of vehicles equipped with inter-vehicular communications. In this paper, a stochastic model is proposed for analyzing the vehicle chain collisions. It takes into account the influences of different penetration rates, the stochastic nature of inter-vehicular distance distribution, and the different kinematic parameters related to driver and vehicle. The usability and accuracy of this model is tested and proved by comparative experiments with Monte Carlo simulations. The collision outcomes of a platoon in different penetration rates and traffic scenarios are also analyzed based on this model. These results are useful to provide theoretical insights into the safety control of a heterogeneous platoon.

Simulation & VANET : Towards a New Reliable and Optimal Data Dissemination Model

Ad hoc networks was developed in the 2000s, they was highly used in dynamic environment, particularly for intervehicular communication (VANETs : Vehicular Ad hoc Networks). Since that time, many researches and developments process was dedicated to VANET networks. These were motivated by the current vehicular industry trend that is leading to a new transport system generation based on the use of new communication technologies in order to provide many services to passengers, the fact that improves the driving and travel’s experience. These systems require traffic information sharing and dissemination, such as the alert message emitting, that be exchanged for drivers protection on the road. Sharing such information between vehicles helps to anticipate potentially dangerous situations, as well as planning better routes during congestion situations. The current paper attempts to model and simulate VANET Networks, aiming to analyze and evaluate security information dissemination approaches and mechanisms used in this type of networks in several exchanges conditions. The second objective is to identify their limitations and suggest a new improved approach. This study was conducted as part of our research project entitled “Simulation & VANETs”, where we justify and validate our approach using modeling and simulation techniques and tools used in this domain.

Traffic Congestion Detection System through Connected Vehicles and Big Data

This article discusses the simulation and evaluation of a traffic congestion detection system which combines inter-vehicular communications, fixed roadside infrastructure and infrastructure-to-infrastructure connectivity and big data. The system discussed in this article permits drivers to identify traffic congestion and change their routes accordingly, thus reducing the total emissions of CO2 and decreasing travel time. This system monitors, processes and stores large amounts of data, which can detect traffic congestion in a precise way by means of a series of algorithms that reduces localized vehicular emission by rerouting vehicles. To simulate and evaluate the proposed system, a big data cluster was developed based on Cassandra, which was used in tandem with the OMNeT++ discreet event network simulator, coupled with the SUMO (Simulation of Urban MObility) traffic simulator and the Veins vehicular network framework. The results validate the efficiency of the traffic detection system and its positive impact in detecting, reporting and rerouting traffic when traffic events occur.

Distributed and Fair Beaconing Rate Adaptation for Congestion Control in Vehicular Networks

Cooperative inter-vehicular applications rely on the exchange of broadcast single-hop status messages among vehicles, called beacons. The aggregated load on the wireless channel due to periodic beacons can prevent the transmission of other types of messages, what is called channel congestion due to beaconing activity. In this paper we approach the problem of controlling the beaconing rate on each vehicle by modeling it as a Network Utility Maximization (NUM) problem. This allows us to formally apply the notion of fairness of a beaconing rate allocation in vehicular networks and to control the trade-off between efficiency and fairness. The NUM methodology provides a rigorous framework to design a broad family of simple and decentralized algorithms, with proved convergence guarantees to a fair allocation solution. In this context, we focus exclusively in beaconing rate control and propose the Fair Adaptive Beaconing Rate for Intervehicular Communications (FABRIC) algorithm, which uses a particular scaled gradient projection algorithm to solve the dual of the NUM problem. The desired fairness notion in the allocation can be established with an algorithm parameter. Simulation results validate our approach and show that FABRIC converges to fair rate allocations in multi-hop and dynamic scenarios.

Lateral Control of an Unmaned Car Using GNSS Positionning in the Context of Connected Vehicles

This paper addresses the problem of path following for unmaned cars using only GNSS positionning. Several papers have already addressed the lane keeping, usually restricting the focus to the computation of the optimal steering wheel angle, therefore usually offering a good solution in either straight lines or curves, but rarely both. Moreover the GNSS receiver have a sampling time higher than the required one for the proposed strategies in the literature. In this paper, a control algorithm is proposed for the steering wheel angle, with adaptation of the speed of the car, in order to provide a solution working both for straight lines and curves by using only GNSS. The presented solution has been used in real conditions to realize the demonstration “speed synchronization at intersections using intervehicular communication, x.icars” shown at the Intelligent Transportation System World Congress in Bordeaux, 201511https://www.youtube.com/watch?v=KBx6qks8kCI.

An Adaptive Key Exchange Procedure for VANET

VANET is a promising technology for intelligent transport systems (ITS). It offers new opportunities aiming at improving the circulation of vehicles on the roads and improving road safety. However, vehicles are interconnected by wireless links and without using any infrastructure, which exposes the vehicular network to many attacks. This paper presents a new solution for the exchange of security keys to protect information exchanged between vehicles. In addition to securing the inter-vehicular communication, the proposed solution has considerably decreased the time for the exchange of keys, thus improving the performance of VANET.

Swarm model for cooperative multi‐vehicle mobility with inter‐vehicle communications

A novel model is proposed to formulate the mobility of multiple vehicles with inter-communications moving together as a swarm. This model is inspired by the aggregate motion of social force, and is used to describe the self-organised behaviour of the vehicle swarm in vehicular ad hoc networks. To validate and analyse the proposed model, some simulations are performed in different traffic scenarios, such as the low traffic density with high mobility and the high traffic density with low mobility. Two comparative simulation cases are also provided to explore the effect of vehicular communications on the mobility of multiple vehicles. The simulation results prove that the model can well formulate the cooperative behaviours of multiple vehicles with vehicle-to-vehicle communications in inter-vehicle collision avoidance and obstacle-avoidance scenarios, and these results also strengthen that the inter-vehicular communications can enhance the vehicle safety and traffic efficiency.

A Novel White Space Optimization Scheme Using Memory Enabled Genetic Algorithm in Cognitive Vehicular Communication

A dedicated single short range communication link is not efficient for an inter-vehicular communication system and results into degraded performance. To address the problem, a cognitive radio site is proposed as an intelligent vehicular device to implement an inter-vehicular communication network using multiple radio access technologies. Further, the whitespace optimization at vehicular speed is achieved by the memory enabled genetic algorithm. The algorithm makes use of four cognitive radio decision variables as genes including frequency, power, data rate and modulation scheme in the chromosome structure. The performance of the proposed approach is validated against the classical genetic algorithm and particle swarm optimization algorithm. In this research, a statistical evaluation is also presented to confirm the potential of cognitive radio paradigm employing multiple radio access technologies as an option to fulfill the increasing bandwidth demand of an inter-vehicular communication system. Experimental results demonstrate the effectiveness of the approach by ensuring efficient bandwidth utilization and fulfilling varying nature of users' quality of service requirements in real time.

Moment Analysis of Highway-Traffic Clearance Distribution

To help with the planning of inter-vehicular communication networks, an accurate understanding of traffic behavior and traffic phase transition is required. We calculate inter-vehicle spacings from empirical data collected in a multi-lane highway in California, USA. We calculate the correlation coefficients for spacings between vehicles in individual lanes to show that the flows are independent. We determine the first four moments for individual lanes at regular time intervals, namely the mean, variance, skewness and kurtosis. We follow the evolution of these moments as the traffic condition changes from the low-density free flow to high-density congestion. We find that the higher moments of inter-vehicle spacings have a well defined dependence on the mean value. The variance of the spacing distribution monotonously increases with the mean vehicle spacing. In contrast, our analysis suggests that the skewness and kurtosis provide one of the most sensitive probes towards the search for the critical points. We find two significant results. First, the kurtosis calculated in different time intervals for different lanes varies smoothly with the skewness. They share the same behavior with the skewness and kurtosis calculated for probability density functions that depend on a single parameter. Second, the skewness and kurtosis as functions of the mean intervehicle spacing show sharp peaks at critical densities expected for transitions between different traffic phases. The data show a considerable scatter near the peak positions, which suggests that the critical behavior may depend on other parameters in addition to the traffic density.

Bluetooth Low Energy performance and robustness analysis for Inter-Vehicular Communications

Bluetooth Low Energy (BLE) is quickly and steadily gaining importance for a wide range of applications. In this paper we investigate the potential of BLE in a vehicular context. By means of experiments, we first evaluate the characteristics of the wireless channel, then we define a set of driving scenarios to analyse how BLE is affected by varying speed, distance and traffic conditions. We found that the maximum communication range between two devices can go beyond 100 m and that a robust connection, capable of handling sudden signal losses or interferences, can be achieved up to a distance of 50 m even for varying traffic and driving conditions. We then present a proof-of-concept mobile application for off-the-shelf smartphones that can be used to transmit data over multiple hops. Next, we analyse how BLE handles other interferences on the same frequency band by building and validating an interference testbed based on the IEEE 802.11 technology. Finally we discuss the advantages and limitations of BLE for Inter-Vehicular Communications (IVC) and propose potential applications.

On the Approximate Analysis of Energy Detection Over <inline-formula> <tex-math notation="LaTeX">$n^\ast$</tex-math></inline-formula>Rayleigh Fading Channels Through Cooperative Spectrum Sensing

In this letter, we consider the problem of energy detection of unknown signals in an intervehicular communication (IVC) system over n*Rayleigh fading channels (also known as cascaded Rayleigh). Novel tight approximations for the probability of detection are derived for the no-diversity and the maximum ratio combining (MRC)) diversity schemes. Moreover, we investigate the system performance when cooperative spectrum sensing (CSS) is considered with and without imperfect reporting channels. The analytical results show that the detection reliability is decreased as the fading severity parameter n increases but reliability is substantially improved when CSS employs MRC schemes.

Rapid and Protected Multihop Transmit Solutions Designed for Intervehicular Communication

Intervehicular correspondence (IVC) is a fundamental gifted inspect part with the point of be assessed toward essentially make an installment in the method for trade wellbeing notwithstanding great association. inside this system, endless practical IVC applications add to the all inclusive call for in backing of quick multihop intervehicular communication transmission,counting in arrangement such like situation,trend,with rate. then again, it is discriminating intended for such an insights substitute characterization toward exist sturdy just before assurance assaults. similarly, a derisive auto force present broken thus inspired by the intervehicle remote affiliations, most critical close presence alongside trusts sufferers before toward at all extra sort of illdisposed enthusiasm toward oneself (e.g., exchange redirection utilized for the antagonistic benefit). inside this archive, we explore assaults just before the breakthrough IVC-based asylum applications. furthermore, this breakdown drives us set out toward point a quick and additionally ensured multihop transmit calculation intended for vehicular proclamation, which is demonstrate while in transit to exist adaptable toward the aforementioned assaults.

How Shadowing Hurts Vehicular Communications and How Dynamic Beaconing Can Help

We study the effect of radio signal shadowing dynamics, caused by vehicles and by buildings, on the performance of beaconing protocols in Inter-Vehicular Communication (IVC). Recent research indicates that beaconing, i.e., one hop message broadcast, shows excellent characteristics and can outperform other communication approaches for both safety and efficiency applications, which require low latency and wide area information dissemination, respectively. To mitigate the broadcast storm problem, adaptive beaconing solutions have been proposed and designed. We show how shadowing dynamics of moving obstacles hurt IVC, reducing the performance of beaconing protocols. To the best of our knowledge, this is one of the first studies on identifying the problem and the underlying challenges and proposing the opportunities presented by such challenges. Shadowing also limits the risk of overloading the wireless channel. We demonstrate how these challenges and opportunities can be taken into account and outline a novel approach to dynamic beaconing. It provides low-latency communication (i.e., very short beaconing intervals), while ensuring not to overload the wireless channel. The presented simulation results substantiate our theoretical considerations.

Autonomous real time route guidance in inter-vehicular communication urban networks

This paper presents an inter-vehicular communication (IVC)-based algorithm for real-time route guidance in urban traffic networks. The algorithm enables communication between searcher vehicle and candidate vehicles whose origin node matches the destination node of the searcher vehicle, and traveling in the opposite direction. The data entities of knowledge sharing among the vehicles and the algorithmic procedure as well as the conditions for information sharing are presented in detail. The mathematical formulation of the procedure is also presented. A microscopic simulation model is utilized to assess the effectiveness of the algorithm against the benchmark shortest path algorithm. Average travel time, and overall network productivity are presented to measure the effectiveness of the algorithm. Simulation runs are conducted under various network congestion levels, link speeds and link lengths in order to evaluate the network productivity, and the travel time measures of the presented IVC algorithm compared to the benchmark shortest path algorithm, decentralized route guidance systems as well as other IVC-based algorithms.

Directional Transmission Based Optimization for the Hidden and Exposed Terminal Problems in Inter-Vehicular Communications

The intrinsic problems of hidden/exposed terminal may bring about threat of conflict in inter-vehicular communication, and thus decrease network throughput. In this paper, we take the unidirectional feature of road into consideration, design single-channel transmission scheme for decreasing communication conflicts with position information and directional antenna, including the identification and notification of relative positions among adjacent nodes, the identification of node transmission state, and the method of directional transmission scheduling. By simulation experiments of inter-vehicular communication in NS-2, we verify that this scheme can discern the hidden/exposed terminal nodes and decrease conflicts effectively, and thus improve network performance.

A Novel Vehicular Information Network Architecture Based on Named Data Networking (NDN)

Vehicular information network and Internet of Things (IoT) technologies have been receiving a lot of attention in recent years. As one of the most important and promising IoT areas, a vehicular information network aims to implement a myriad of applications related to vehicles, traffic information, drivers, passengers, and pedestrians. However, intervehicular communication (IVC) in a vehicular information network is still based on the TCP/IP protocol stack which is not efficient and scalable. To address the efficiency and scalability issues of the IVC, we leverage the named data networking (NDN) paradigm where the end user only cares about the needed content and pays no attention to the actual location of the content. The NDN model is highly suitable for the IVC scenario with its hierarchical content naming scheme and flexible content retrieval and caching support. We design a novel vehicular information network architecture based on the basic communication principle of NDN. Our proposed architecture aims to improve content naming, addressing, data aggregation, and mobility for IVC in the vehicular information network. In addition, the key parameter settings of the proposed schemes are analyzed in order to help guide their actual deployment.

Forwarder smart selection protocol for limitation of broadcast storm problem

In this paper we introduce a novel routing protocol for efficiently broadcasting packets in vehicular ad hoc networks, while limiting multiple copies of the same packet, and avoiding collisions. In high-congested traffic scenarios, the increase of packet collisions and medium contentions among vehicles affects the inter-vehicular communications, and causes a degradation of quality-of-service (QoS). The effect also results in a very high number of message copies and collisions within the vehicular network. This is the well-known broadcast storm problem.Our proposed technique, namely Selective Reliable Broadcast protocol (SRB), is intended to limit the number of packet transmissions. Through an opportunistic vehicle selection, packets are retransmitted towards a next hop, in order to strongly reduce the number of forwarder vehicles, while preserving an acceptable level of QoS. SRB belongs to the class of broadcast protocols, as well as cluster-based approaches. It exploits the partitioning behavior, as typical from vehicular ad hoc networks, in order to automatically detect vehicular clusters, intended as “zones of interest”. Packets will be then forwarded only to selected vehicles, opportunistically elected as cluster-heads. SRB performances have been assessed in different vehicular scenarios, mostly realistic environments, such as urban and highway scenarios. The limitation of the broadcast storm problem, as provided by SRB, is expressed in terms of a reduction of number of next-hop forwarders. The effectiveness of SRB has been also compared to (i) the traditional broadcast protocol, since in respect of traditional broadcasting, the main strengths of SRB are the efficiency of detecting clusters and selecting forwarders in a fast way, as well as (ii) a content-based dissemination approach, due to its ability to determine clusters of vehicles having common interests.

INTER-VEHICULAR COMMUNICATION USING PACKET NETWORK THEORY

As a component of the intelligent transportation system and one of the concrete applications of mobile ad hoc networks, intervehicle communication has attracted research attention from both the academia and industry of, notably, US, EU, and Japan. The most important feature of inter-vehicle communication is its ability to extend the horizon of drivers and on-board devices (e.g., radar or sensors) and, thus, to improve road traffic safety and efficiency. Such type of Driver assistance systems are meant to support drivers with driving process in order to avoid traffic accidents, speed up the traffic and have a higher control over the traffic in general. These systems use the capacity of the vehicles to communicate, not only between them but also with infrastructures. All the information is collected and processed to offer useful services. Wireless adhoc network protocols are widely used in this area which provides communication among vehicles and road side equipment. The performance of communication depends on how better the routing takes place in the network and these routing protocols we have already been analyzed and compared in the past, simulations and comparisons have almost always been done considering random motions. Since the application development is for Inter-Vehicular Communication and Decongestion of Vehicular Networks, it is necessary to initially locate the car position from GPS co-ordinates, Using filtering techniques and localization algorithms its accuracy is enhanced. The vehicular density in the lanes is then found out for all vehicles at a specific location based on location and then congestion algorithms are applied to congested lanes to decongest them.

A Novel Geo-Broadcast Algorithm for V2V Communications over WSN

The key for enabling the next generation of advanced driver assistance systems (ADAS), the cooperative systems, is the availability of vehicular communication technologies, whose mandatory installation in cars is foreseen in the next few years. The definition of the communications is in the final step of development, with great efforts on standardization and some field operational tests of network devices and applications. However, some inter-vehicular communications issues are not sufficiently developed and are the target of research. One of these challenges is the construction of stable networks based on the position of the nodes of the vehicular network, as well as the broadcast of information destined to nodes concentrated in a specific geographic area without collapsing the network. In this paper, a novel algorithm for geo-broadcast communications is presented, based on the evolution of previous results in vehicular mesh networks using wireless sensor networks with IEEE 802.15.4 technology. This algorithm has been designed and compared with the IEEE 802.11p algorithms, implemented and validated in controlled conditions and tested on real vehicles. The results suggest that the characteristics of the designed broadcast algorithm can improve any vehicular communications architecture to complement a geo-networking functionality that supports a variety of ADAS.