A Probabilistic Routing Protocol in VANET

Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.


2019 ◽  
Vol 14 (1) ◽  
pp. 21-38
Author(s):  
Omar A. Hammood ◽  
Mohd Nizam ◽  
Muamer Nafaa ◽  
Waleed A. Hammood

Video streaming in Vehicular Ad Hoc Networks (VANETs) is a fundamental requirement for a roadside emergency and smart video surveillance services. However, vehicles moving at a high speed usually create unstable wireless links that drop video frames qualities. In a high-density network, network collision between vehicles is another obstacle in improving the scalability of unicast routing protocols. In this paper, the RElay Suitability-based Routing Protocol (RESP) which makes a routing decision based on the link stability measurement was proposed for an uninterrupted video streaming. The RESP estimates the geographic advancement and link stability of a vehicle towards its destination only in the small region. To ensure the reliability while extending the scalability of routing, the relay suitability metric integrates the packet delay, collision dropping, link stability, and the Expected Transmission Count (ETX) in the weighted division algorithm, and selects a high-quality forwarding node for video streaming. The experimental results demonstrated that the proposed RESP outperformed the link Lifetime-aware Beacon-less Routing Protocol (LBRP) and other traditional geographical streaming protocols in providing a high packet delivery ratio and less packet delay with various network densities, and proved the scalability support of RESP for video streaming.


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.


Author(s):  
Thar Baker ◽  
Jose M. García-Campos ◽  
Daniel Gutiérrez Reina ◽  
Sergio Toral ◽  
Hissam Tawfik ◽  
...  

2018 ◽  
Vol 4 (3) ◽  
pp. 189-199 ◽  
Author(s):  
S.K. Bhoi ◽  
P.M. Khilar ◽  
M. Singh ◽  
R.R. Sahoo ◽  
R.R. Swain

Sign in / Sign up

Export Citation Format

Share Document