A Trust Framework for Centralized TDMA Scheduling Mechanism in Vehicular Ad hoc Networks

Author(s):  
Mohamed Hadded ◽  
Khalifa Toumi ◽  
Anis Laouiti ◽  
Paul Muhlethaler

Vehicular ad hoc networks, known as VANETs, are deployed to improve passenger comfort as well as to reduce the risk of road accidents by allowing vehicles to provide a warning in real time when a critical event is detected. In such networks, communication is possible both between the vehicles themselves and between the vehicles and the infrastructure. These applications need a reliable and secure broadcast system that takes into consideration the security issues in VANETs, the high speed of nodes, and the strict QoS requirements. For these reasons, the authors propose a trust-based and centralized TDMA-based MAC protocol that avoids time slot assignment to malicious nodes and minimizes message collision. The solution is based on the design of a generic trust mechanism for VANETs based on the MAC requirements and its integration into a centralized TDMA-based MAC protocol, named trust-CTMAC. The mechanism will permit roadside units (RSUs) to manage trust level assignment via security check during free slot allotment. The experiments carried out and the results obtained prove the effectiveness of the approach.

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.


2005 ◽  
Vol 12 (3) ◽  
pp. 147-157
Author(s):  
Giuseppe Caizzone ◽  
Paolo Giacomazzi ◽  
Luigi Musumeci ◽  
Gabriella Saddemi ◽  
Giacomo Verticale

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 643
Author(s):  
Muhammad Bilal Latif ◽  
Feng Liu ◽  
Kai Liu

An autonomous driving environment poses a very stringent requirement for the timely delivery of safety messages in vehicular ad hoc networks (VANETs). Time division multiple access (TDMA)-based medium access control (MAC) protocols are considered a promising solution because of their time-bound message delivery. However, in the event of mobility-caused packet collisions, they may experience an unpredicted and extended delay in delivering messages, which can cause catastrophic accidents. To solve this problem, a distributed TDMA-based MAC protocol with mobility-caused collision mitigation (MCCM-MAC) is presented in this paper. The protocol uses a novel mechanism to detect merging collisions and mitigates them by avoiding subsequent access collisions. One vehicle in the merging collisions retains the time slot, and the others release the slot. The common neighboring vehicles can timely suggest a suitable new time slot for the vacating vehicles, which can avoid access collisions between their packet transmissions. A tie-breakup mechanism is employed to avoid further access collisions. Simulation results show that the proposed protocol reduces packet loss more than the existing methods. Consequently, the average delay between the successfully delivered periodic messages is also reduced.


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.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 116542-116554 ◽  
Author(s):  
Yang Wang ◽  
Jianghong Shi ◽  
Lingyu Chen ◽  
Baoshan Lu ◽  
Qi Yang

2018 ◽  
Vol 12 ◽  
pp. 14-22 ◽  
Author(s):  
Raghavendra Pal ◽  
Arun Prakash ◽  
Rajeev Tripathi

Sign in / Sign up

Export Citation Format

Share Document