Timed bargaining-based opportunistic routing model for dynamic vehicular ad hoc network

Vehicular Ad Hoc Networks is a class of special wireless ad hoc network with the characteristics of high node mobility and fast topology changes. The Vehicular Networks can provide wide variety of services, range from safety-related warning systems to improved navigation mechanisms as well as information and entertainment applications. So lot of research work is being conducted to study the problems related to the vehicular communications including network architecture, protocols, routing algorithms, as well as security issues. In order to stimulate the ‘beginners in research’, here we present a paper on an overview of Vehicular Ad Hoc Networks.

A vehicular ad hoc network (VANET) is a special kind of mobile ad hoc networks (MANET) that supports cooperative driving among communicating cars on the roads. There are several technologies involved in implementation of wireless communication in VANETs. These technologies include 3G cellular systems, long-term evolution (LTE), LTE Advanced, IEEE 802.16, and IEEE 802.11. This chapter focuses on 802.11-based wireless communication in VANETs. It reviews some presented methods for vehicle movement path prediction, and explains some algorithms are explained for performance improvement in opportunistic networks based on the predicted vehicle movements. The chapter considers the fact that communication in VANETs can be infrastructure-based or infrastructureless. It also reviews some methods to apply the predicted vehicles' position for improving communication in infrastructure-based and infrastructureless VANETs, respectively. Opportunistic routing algorithms can be classified according to their dependency on roadside infrastructure. The chapter presents the taxonomy of opportunistic routing in VANETs.

Recently, routing in Vehicular Ad hoc Networks (VANETs) has found significant attention. Besides, since these networks are highly dynamic and their topologies change rapidly, design of routing algorithms suitable for an urban environment is extremely challenging. Appropriate algorithms for urban environments could be opportunistic routing algorithms in which traffic transmission from source vehicles to destination vehicles is performed using the store-carry and forward mechanism. Most of the existing opportunistic routing algorithms use the flooding mechanism for increasing delivery ratio without considering the overheads of flooding. Thus, in order to reduce the overhead in these methods and improve the performance of routing in VANET, choosing an appropriate node to send messages and determining priority of messages for transmission will be very important. An efficient opportunistic routing (OR) mechanism, called Reliability-Aware Location and History Based Opportunistic Routing (RLHOR) is proposed in this paper for improving overhead. The RLHOR searches for a stable path by evaluating the stability of intermediate links based on lifetime of links, location and direction of intermediate vehicles, and history of intermediate vehicles in message delivery. Using the ONE simulator, our performance evaluation results show that the RLHOR operates better than conventional opportunistic routing algorithms. The RLHOR not only increases delivery rate, but also reduces network overhead, traffic loss, and number of aborted messages in sparse scenario.

Past few decades have witnessed large increase in number of vehicles on roads due to which the traffic safety needs have also become complex and hence necessary to be taken care of. Vehicular ad hoc networks (VANETs) are becoming an asset for achieving all these goals. VANETs provide applications like driver assistance, passenger comfort and vehicle safety. Apart from its general characteristics due to the dynamic nature of road environments and traffic patterns, communication linkage among vehicles in VANETs suffers breakage problem hence requires a very reliable routing protocol. To manage the communication efficiently many routing protocols are already available for MANETs which can be further used for routing and communication among vehicles in VANETs, but characteristics of these two networks (VANET and MANET) are very different, so there is requirement to enhance these MANET routing protocols so that those can be used in VANETs. When we use some existing routing protocols in VANET then number of link breakage are surprisingly high because mobility is higher in VANETs as compared to MANETs. So this paper presents advanced version of an existing MANET routing protocol for better performance in VANET environment. The new routing protocol has removed problem of large number of routing error messages which was existing in AODV routing protocol. Protocol proposed in this paper has better results as compared to AODV and paper has also shown results of simulation and also elaborated the findings.

QoS-aware routing in mobile ad hoc networks (MANETs) is a major challenge due to node mobility and scarcity of resources. QoS-aware routing based on ant colony optimization (ACO) algorithms is a promising approach to overcome these problems. However, as compared to MANETs, vehicular ad hoc networks (VANETs) face additional challenges due to rapid topology change, making the estimation or prediction of QoS parameters difficult or stale. VANETs require time-critical message delivery, as late delivery may result in endangering lives. Currently existing routing protocols usually require the exchange of additional control message between neighbor nodes to compute QoS parameters. This makes the routing protocol too slow to react to fast topology change and also does not consider network congestion when forwarding a data packet. To reduce the overhead introduced to collect information from neighbor nodes and to obtain an accurate estimate of QoS parameters, we use the simple network management protocol to estimate these values locally. This paper describes a new approach for calculating QoS parameter locally and avoiding congestion during data transmission. The simulations are implemented using the network simulator ns-3, and the results show that our approach is scalable and performs well in high mobility. QoS-aware routing in mobile ad hoc networks (MANETs) is a major challenge due to node mobility and scarcity of resources. QoS-aware routing based on ant colony optimization (ACO) algorithms is a promising approach to overcome these problems. However, as compared to MANETs, vehicular ad hoc networks (VANETs) face additional challenges due to rapid topology change, making the estimation or prediction of QoS parameters difficult or stale. VANETs require time-critical message delivery, as late delivery may result in endangering lives. Currently existing routing protocols usually require the exchange of additional control message between neighbor nodes to compute QoS parameters. This makes the routing protocol too slow to react to fast topology change and also does not consider network congestion when forwarding a data packet. To reduce the overhead introduced to collect information from neighbor nodes and to obtain an accurate estimate of QoS parameters, we use the simple network management protocol to estimate these values locally. This paper describes a new approach for calculating QoS parameter locally and avoiding congestion during data transmission. The simulations are implemented using the network simulator ns-3, and the results show that our approach is scalable and performs well in high mobility.

This paper proposes a novel approach for time constrained information gathering in a typical Vehicular Ad Hoc Network (VANET), based on a token passing scheme, adapted to wireless communications by creating a virtual ring where nodes are connected to a predecessor and a successor node. To address the typical fast topology changes of VANETs, we proposed a specific approach, called Tom Thumb that is a distributed protocol that node-by-node circulates a special packet, called token, which collects the information stored in each vehicle until returning to the first unit within a specified time constraint. The protocol has been properly designed in terms of (i) the more effective hop-by-hop and distributed heuristic implementing the objective function (ii) the token packet format, i.e., the syntax and semantics of its fields. Finally, the performance of the proposed approach is validated for different time constraints and numbers of vehicles, always pointing out a remarkable gain, especially in the presence of severe constraints, i.e., in terms of time deadline, collected information amount and success probability.

A Vehicular Ad hoc NETwork (VANET) is a type of mobile Peer-To-Peer wireless network that allows providing communication among nearby vehicles and between vehicles and nearby fixed roadside equipment. The lack of centralized infrastructure, high node mobility and increasing number of vehicles in VANETs result in several problems discussed in this paper, such as interrupting connections, difficult routing, security of communications and scalability. Existing system for VANET communication is proved to have several drawbacks. We have proposed a mechanism in order to provide secure and efficient communication in VANET environment. We overcome the drawbacks of the existing system by using Malicious Vehicular Analyzer algorithm and Elliptic Curve Cryptography (ECC). Using these algorithms, malicious messages are identified. It also detects the accident and other problems in the path of the vehicles. Elliptic Curve Cryptography (ECC) algorithm is used for stronger security during communication.

Vehicular plays an important role in day-to-day world in the field of automobiles. VANETs are the subclass of mobile ad-hoc Networks which have no central infrastructure. Nodes are highly mobile in VANET. VANET is distinguished from MANET by their features, design and applications. A Vehicular Ad-Hoc Network or VANET is a sub form of Mobile Ad-Hoc Network or MANET that provides communication between vehicles and between vehicles and road-side base stations with an aim of providing efficient and safe transportation. A vehicle in VANET is considered to be an intelligent mobile node capable of communicating with its neighbors and other vehicles in the network. VANET introduces more challenges aspects as compare to MANET because of high mobility of nodes and fast topology changes in VANET. In this paper, VANET basics structure, its architecture, challenges, applications are discussed. Data dissemination is a challenging task because by utilizing limited bandwidth, maximum data has to disseminate over the vehicular network. Many researchers have provided several techniques to disseminate data so that the data can be accessed more efficiently. Major stress is given to this topic where data dissemination types and its protocols are compared.

Vehicular ad-hoc network (VANET) technology enables communication between vehicles, or vehicles and road-side units (RSUs) through wireless communication devices installed on the vehicles. One of the most important goals of VANETs is providing safety applications for passengers. In addition, VANETs provide comfort applications to users. Guaranteeing a reliable and stable routing protocol over VANETs is a very important step. The proposed research attempts to improve routing protocols that decrease the end-to-end delay to suit VANET communication characteristics. In addition, it proposes analysis of the end-to-end delay probability distribution. More specifically, we derive a closed-form expression for the probability distribution of the re-healing delay in a VANET conditioned on the distance between two VANET clusters. Furthermore, we propose a closed-form expression for the probability distribution of the unconditional re-healing delay. Moreover, we develop a mathematical model to calculate the probability distribution of the end-to-end delay. On the other hand, using Unmanned Aerial Vehicles (UAVs) or drones in wireless communications and Vehicular Ad-hoc Networks (VANETs) has started to attract attention. We propose a routing protocol that uses infrastructure drones for boosting VANET communications to achieve a minimum vehicle-to-drone packet delivery delay. In addition, we propose a closed-form expression for the probability distribution of the vehicle-to-drone packet delivery delay on a two-way highway. Moreover, based on that closed-form expression, we can calculate the minimum drone density (maximum separation distance between two adjacent drones) that stochastically limits the worst case of the vehicle-to-drone packet delivery delay. Furthermore, we propose a drones-active service (DAS) that is added to the location service in a VANET. This service dynamically and periodically obtains the required number of active drones based on the current highway connectivity state by obtaining the maximum distance between each two adjacent drones while satisfying a probabilistic constraint for vehicle-todrone packet delivery delay. Our analysis focuses on two-way highway VANET networks with low vehicular density. The simulation results show the accuracy of our analysis and reflect the relation between the drone density, vehicular density and speed, other VANET parameters, and the vehicle-to-drone packet delivery delay. In addition, we propose a new routing protocol called multi-copy intersection-based routing (MCIR) for vehicular ad-hoc networks (VANETs) in urban areas. MCIR is an intersectionbased routing protocol that forwards multiple copies of the packets in different road segments. Moreover, it is a beacon-less routing protocol with a carry-and-forward strategy. We show via simulation that the MCIR protocol is superior to other existing routing protocols, especially in low vehicular density scenarios. The results show that MCIR achieves a shorter end-to-end delay and a higher packet delivery ratio in urban VANET communications.

Vehicular communication ad hoc routing protocols: A survey

Vehicular Ad Hoc Network (VANET) is a multi-hop wireless network which involves vehicles acting as nodes to communicate with each other without infrastructural support. With the increase in Quality of Service (QoS) needs in evolving applications and the widespread use of wireless and mobile devices, it is desirable to support QoS in VANETs. The resource limitations and variability further add to the need for QoS support in such networks. However, the characteristics of these networks make QoS support a complex process due to rapid topology changes caused by high mobility of communicating nodes. Modulation scheme implemented in wireless network affect the data rate hence the throughput of the communicating nodes, this in turn affect QoS. The paper focuses on adaptive modulation to improve the data throughput and efficiency of channel spectrum in VANET. Through theoretical and simulation results, it was shown that adaptive modulation performs well and improves throughput than other modulations schemes when used singularly in dynamic changing network topology like VANET.

The integration of 5G and VANET will result in an intelligent transportation system. Relay of 5G data from mobile networks to VANET which is greatly underutilized can reduce the burden on mobile networks. Wireless technology has been used in vehicles or better known as the Vehicular Ad hoc Network (VANET). One of the keys to the success of sending data on VANET is the Path Selection Algorithm which is the task of the routing protocol. The routing protocol that is widely used in research in the VANET environment is AODV (Adhoc On-Demand Distance Vector), because among other protocols, AODV is the most suitable and suitable for implementation in the VANET environment, and AODV is also one of the reactive routing protocols. This study includes an increase in the performance of a routing protocol, so in this study, the SIN (Static Intersection Node) is added to the RSU (Road-Side Unit) which is located at an intersection. Which functions as a repeater that helps send data packets to other vehicles around it so that it can increase the Packet Delivery Ratio and minimize Packet Loss and End to End Delay. The focus of this research is to determine the most ideal Static Intersection Node position as well as the most effective number of Static Intersection Nodes.

The increasing mobile devices with better wireless communication facilities trends to be a good opportunity for the development of vehicular ad-hoc networks (VANETs). The opportunistic routing protocols are generally developed from the Delay Tolerant Network (DTN). In this paper, we propose an opportunistic routing algorithm called RSUS (Routing Scheme for Urban Scenarios) based on a grouping strategy which considers both internal property and external contacts of nodes. The nodes of network are divided into super nodes, backbone nodes and ordinary nodes. Each type of nodes uses different routing strategy respectively. Then simulations were carried out by the ONE simulator and evaluations compared with the traditional single opportunistic algorithms. Furthermore RSUS was simulated in three different cities. Results show that RSUS algorithm can obtain the optimal performance with a low network overhead ratio and a high delivery rate, it is also suitable for different urban scenarios.

This paper proposes a novel network architecture based on content routing and dissemination techniques, expressly adapted for hybrid mobile and vehicular ad-hoc networks. Hybrid vehicular ad-hoc networks (VANETs) are a subclass of mobile ad-hoc networks (MANETs) where each node is a moving vehicle equipped with one or more communication devices, potentially having access to several different physical communication channels. This results in a partly decentralized, self-organizing mobile radio network with a fast changing topology. Applications designed for VANETs still require efficient mapping techniques to associate content to the host serving it, as well as centralized databases associating vehicles and mobile nodes to a persistent and unique identifier. They also assume that the content providers are located in the infrastructure, but nodes and vehicles can be equipped with sensors and as such produce information. This means that dissemination and retrieval algorithms have to take into account the distribution of the consumers, providers and forwarder all over the network.

The vehicular ad hoc networks (VANETs) are characterized by high mobility of nodes, which resulting in frequent and fast changes in the network topologies. To make sure the messages are received efficiently and reliably, particularly for safety applications, broadcasting is the most natural and promising approach. Besides the efficiency, security is another important issue for VANETs. Because the open nature of VANETs make it simple for malicious users to disrupt the system or lead to accidents. In this paper, we propose a PKI-based Multihop Broadcasting Protocol (PMBP), which aims at providing authenticated, integrated, non-repudiated vehicular communication. The authentication scheme is based on the Elliptic Curve Digital Signature Algorithm (ECDSA) method. To provide an efficient trusted broadcasting scheme, two strategies are adopted: only the message originator signs the message, one message only be rebroadcasted once by each vehicle. Experimental results prove that this protocol is efficient enough to support safety related vehicular applications.