Inter-vehicular Networks Research Articles

A Clustering-Based Routing Protocol Using Path Pattern Discovery Method to Minimize Delay in VANET

In vehicular ad hoc networks (VANETs), vehicle-to-vehicle (V2V) communications can link vehicles to each other, and vehicle-to-infrastructure (V2I) messaging and communications can link roadside infrastructure such as routers. The vehicles in these networks act as relays that transmit critical messages in the network. Due to the high-speed movement of vehicles on the road, real-time messaging and minimizing the delay in sending messages is one of the most important objectives of VANET developers. On the other hand, the high mobility of vehicles causes communication interruptions and decreases the data delivery rate in VANET. To overcome this issue, predicting the path of vehicles can play an important role in sending data from the source to the destination. When an accident occurs on the road, the messages that are sensed by the imbedded sensors in the vehicles need to be sent, and if they are sent by the vehicles that change their route, these messages will not be sent to the destination and the performance of the network will be disturbed. Previous methods in the literature for data transmission in intervehicular networks have focused more on reliability and trust, and little attention has been paid to the prediction of vehicle movement paths in these types of networks. Therefore, for fast and reliable data transmission in VANET, accurate prediction of vehicle movement and creation of movement patterns can be effective in message transmission delay and data delivery rate. In this paper, we present an approach using a combination of cluster-based routing protocols and pattern discovery methods to minimize latency in VANETs. The outline of the proposed method has four modules: primary data collection and analysis, primary data preparation and analysis, pattern extraction and vehicle route discovery, and vehicle clustering and data/information transmission routing. The simulation results show that the proposed method with a delivery rate of 88.56% has significantly improved compared to the previous methods in terms of package delivery rate. Also, the proposed method with a total delay of 24.566 ms has a shorter delay than the previous methods in terms of message sending delay in the network.

Methods of Formation Control for a Group of Mobile Robots (a Review)

The multi-robot formation control is an essential issue in robotics. This review focuses on important lines of research on current contr ol is s ues and s tr ateg ies on a g r oup of unmanned autonomous vehicles/r obots for mation. In this paper, we pr ovide a br ief description of each method characterizing its key benefits and drawbacks. A multilayered classification of both centralized and decentralized formation control methods is proposed. We consider the classification of robot communication topologies in terms of centralized control. Seminal works dedicated to the practical application of centralized approach are briefly discussed. The majority of centralized methodsare represented by a " leader-follower" approach, taking into account the robot’s dynamics models. Furthermore, the most common models of vehicle dynamics are mentioned. In the framework of decentralized approach, behaviour-based algorithms, as well as swarm algorithms, are discussed. Then, we present an outlook of both centralized and decentralized virtual structure methods used in robot formation control. The described modifications of these methods allow tracing the evolution of the virtual structure approach to hybrid algorithms used for cooperative movement of a group of robots. This paper deals with formation control approach considering communication delays and low carrying capacity in an inter-vehicular communication network as very few works discussed this issue despite its relevance. We pointed out the main development trends of formation control approaches. The most effective approach is the integration of various methods of the formation control so that their disadvantages are nullified. As the same time, the most common disadvantage of discussed formation control methods is their weak conceptual framework in terms of kinematic and dynamic constraints of robots.

Inferring the Driver's Lane Change Intention through LiDAR-Based Environment Analysis Using Convolutional Neural Networks.

Most of the tactic manoeuvres during driving require a certain understanding of the surrounding environment from which to devise our future behaviour. In this paper, a Convolutional Neural Network (CNN) approach is used to model the lane change behaviour to identify when a driver is going to perform this manoeuvre. To that end, a slightly modified CNN architecture adapted to both spatial (i.e., surrounding environment) and non-spatial (i.e., rest of variables such as relative speed to the front vehicle) input variables. Anticipating a driver’s lane change intention means it is possible to use this information as a new source of data in wide range of different scenarios. One example of such scenarios might be the decision making process support for human drivers through Advanced Driver Assistance Systems (ADAS) fed with the data of the surrounding cars in an inter-vehicular network. Another example might even be its use in autonomous vehicles by using the data of a specific driver profile to make automated driving more human-like. Several CNN architectures have been tested on a simulation environment to assess their performance. Results show that the selected architecture provides a higher degree of accuracy than random guessing (i.e., assigning a class randomly for each observation in the data set), and it can capture subtle differences in behaviour between different driving profiles.

Development of a Mobile Inter-Vehicular Communication System Based on Gossip Algorithm

<h1>Mobile Inter-vehicular communication network is an ad hoc network that allows peer vehicles to share and receive data. The existing inter-vehicular communication approach uses data from a limited number of data sources located in distant areas. This leads to high latency caused by the short-range antennas used to connect the peers. Inter-vehicular networks are dynamic and self-organized networks that do not use any external infrastructure to send and receive data. Currently, inter-vehicular networks only exist as part of a hybrid system and hence there is a need for a faster inter-vehicular network which can function independently. In this study, we developed a model which uses the gossip algorithm to send and receive data. The results show that over time, in a peer-to-peer network, the distance to be covered and the delay time are reduced. In the current models, however, the delay and distance covered remain constant. The results show that a peer-to-peer model is faster.</h1><p> </p>

Epidemic algorithms for reliable and efficient information dissemination in vehicular ad hoc networks

Vehicular ad hoc networks (VANET), which are created by vehicles equipped with short- and medium-range wireless communication, have an array of important applications in intelligent transport systems. Many of these applications require reliable, bandwidth-efficient dissemination of traffic and road information via ad hoc network technology. This is a difficult task since inter-vehicular networks often lack continuous end-to-end connectivity and are characterised by large variations in node density. A new epidemic algorithm for information dissemination in highly dynamic and intermittently connected VANET is introduced. It is shown through realistic simulations in highway traffic that the proposed algorithm is capable of reliable and efficient information dissemination in VANET in the face of frequent network fragmentation and large density variations.

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.

Routing protocols for inter-vehicular networks: A comparative study in high-mobility and large obstacles environments

An ad hoc network is composed of mobile nodes without the presence of a fixed infrastructure. Communications among nodes are accomplished by forwarding data packets for each other, on a hop-by-hop basis along the current connection to the destination node. In particular, vehicle-to-vehicle communications have been studied, in recent years, to improve driver safety. As more of such applications of high-mobility ad hoc networks emerge, it is critical that the routing protocol employed is capable of efficiently coping with the high-frequency of broken links (i.e., robust with respect to high-mobility). This paper presents a comprehensive comparative study in a city environment of eight representative routing protocols for wireless mobile ad hoc networks and inter-vehicular networks developed in recent years. In a city environment, communication protocols need adapt fast moving nodes (e.g., vehicles on streets) and large obstacles (e.g., office buildings). In this paper, we elaborate upon extensive simulation results based on various network scenarios, and discuss the strengths and weaknesses of these techniques with regard to their support for highly mobile nodes.

Analysis and simulation of a content delivery application for vehicular wireless networks

We propose and analyze an information-sharing application for wireless intervehicular networks, called Infoshare. Infoshare leverages the broadcast nature of the wireless medium to achieve maximum spreading of information queries among vehicles, while a smart caching policy limits the overhead resulting from useless queries and duplicated replies. We first evaluate the performance of Infoshare through the simulator ns2, highlighting the impact of various system parameters on the information spreading dynamics. Then, we develop an analytical model of the information exchange dynamics, which allows us to identify the system parameters that guarantee a sustainable information exchange on the network scenario under study.