Efficient Mechanisms and Performance Analysis of Routing Protocols in VANETs for Realistic Scenarios

Author(s):  
Christos Bouras ◽  
Vaggelis Kapoulas ◽  
Enea Tsanai

Vehicular Ad Hoc Networks (VANETs) are considered as a special case of mobile Ad Hoc Networks (MANETs) and are recently gaining a great attention from the research community. The need for improved road safety, traffic efficiency and direct communication along with the great complexity in routing, makes VANETs a highly challenging field. Routing in VANETs has to adapt to special characteristics such as high speed and road pattern movement as well as high linkage break probability. In this work, the authors show that traditional MANET routing protocols cannot efficiently handle the challenges in a VANET environment and thus need further modifications. For this reason, they propose and implement an enhancement mechanism, applied to the GPSR routing protocol that adapts to the needs of a VANET. The proposed mechanism's performance is evaluated through simulation sets for urban and highway scenarios and compared to the performance of the most common MANET routing protocols adopted in VANETs. The proposed enhancement is shown to be considerably beneficial and it significantly outperforms the rest of the tested routing protocols for almost every topology setting.

Author(s):  
Anamika Chauhan ◽  
Kapil Sharma ◽  
Alka Aggarwal

With the ever-escalating amount of vehicular traffic activity on the roads, the efficient management of traffic and safety of the drivers and passengers is of paramount gravity. Vehicular ad-hoc networks (VANETs) have emerged as the systems where vehicles would be perceptive of the locality and can supply the driver with required inputs to take necessary actions to alleviate the various issues. The system is designed to detect and identify essential traffic events and inform all concerned entities and take appropriate action. The characteristics of VANET are the topology is highly mobile, depends on city infrastructure, and the high speed of vehicles. These challenges result in frequent disruption of connections, long delays in delivering the messages. The challenges are overcome through the vehicular delay-tolerant network (VDTN) routing protocols are used that can facilitate communication under these network challenges. In this chapter, the authors evaluate the effect of the node density and message sizes on the performance of the various VDTN routing protocols.


Author(s):  
ABHILASH KUMAR M ◽  
RAMA MOHAN REDDY A ◽  
◽  

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 225 ◽  
Author(s):  
Jiaqi Liu ◽  
Shiyue Huang ◽  
Hucheng Xu ◽  
Deng Li ◽  
Nan Zhong ◽  
...  

As a special mobile ad-hoc network, Vehicular Ad-hoc Networks (VANETs) have the characteristics of high-speed movement, frequent topology changes, multi-hop routing, a lack of energy, storage space limitations, and the possible selfishness of the nodes. These characteristics bring challenges to the design of the incentive mechanism in VANETs. In the current research on the incentive mechanism of VANETs, the mainstream is the reward-based incentive mechanism. Most of these mechanisms are designed based on the expected utility theory of traditional economics and assume that the positive and negative effects produced by an equal amount of gain and loss are equal in absolute value. However, the theory of loss aversion points out that the above effects are not equal. Moreover, this will lead to a deviation between the final decision-making behavior of nodes and the actual optimal situation. Therefore, this paper proposed a Loss-Aversion-based Incentive Mechanism (LAIM) to promote the comprehensive perception and sharing of information in the VANETs. This paper designs the incentive threshold and the threshold factor to motivate vehicle nodes to cooperate. Furthermore, based on the number of messages that the nodes face, the utility function of nodes is redesigned to correct the assumption that a gain and a loss of an equal amount could offset each other in traditional economics. The simulation results show that compared with the traditional incentive mechanism, the LAIM can increase the average utility of nodes by more than 34.35%, which promotes the cooperation of nodes.


2014 ◽  
Vol 1 (1) ◽  
pp. 33-52 ◽  
Author(s):  
Amit Dua ◽  
Neeraj Kumar ◽  
Seema Bawa

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881505 ◽  
Author(s):  
Ishtiaq Wahid ◽  
Ata Ul Aziz Ikram ◽  
Masood Ahmad ◽  
Fasee Ullah

With resource constraint’s distributed architecture and dynamic topology, network issues such as congestion, latency, power awareness, mobility, and other quality of service issues need to be addressed by optimizing the routing protocols. As a result, a number of routing protocols have been proposed. Routing protocols have trade-offs in performance parameters and their performance varies with the underlying mobility model. For designing an improved vehicular ad hoc network, three components of the network are to be focused: routing protocols, mobility models, and performance metrics. This article describes the relationship of these components, trade-offs in performance, and proposes a supervisory protocol, which monitors the scenario and detects the realistic mobility model through analysis of the microscopic features of the mobility model. An analytical model is used to determine the best protocol for a particular mobility model. The supervisory protocol then selects the best routing protocol for the mobility model of the current operational environment. For this, EstiNet 8.1 Simulator is used to validate the proposed scheme and compare its performance with existing schemes. Simulation results of the proposed scheme show the consistency in the performance of network throughout its operation.


Author(s):  
Indrani Das ◽  
Sanjoy Das

Geocasting is a subset of conventional multicasting problem. Geocasting means to deliver a message or data to a specific geographical area. Routing refers to the activities necessary to route a message in its travel from source to the destination node. The routing of a message is very important and relatively difficult problems in the context of Ad-hoc Networks because nodes are moving very fast, network load or traffic patterns, and topology of the network is dynamical changes with time. In this chapter, different geocast routing mechanisms used in both Mobile Ad-hoc Networks and Vehicular Ad-hoc Networks. The authors have shown a strong and in-depth analysis of the strengths and weaknesses of each protocol. For delivering geocast message, both the source and destination nodes use location information. The nodes determine their locations by using the Global Positioning System (GPS). They have presented a comprehensive comparative analysis of existing geocast routing protocols and proposed future direction in designing a new routing protocol addressing the problem.


Sign in / Sign up

Export Citation Format

Share Document