Distributed and Fair Beacon Power and Beaconing Rate Adaptation Based on Game Theoretic Approach for Connected Vehicles

Distributed and Fair Beacon Power and Beaconing Rate Adaptation Based on Game Theoretic Approach for Connected Vehicles

Mohamed Ouaskou, Hamid Garmani, Mohamed Baslam
DOI: 10.4018/IJCINI.344424
Article PDF Download
Open access articles are freely available for download

Abstract

In vehicular ad hoc networks, vehicles regularly transmit information through beacons to raise awareness among nearby vehicles about their presence. However, as the number of beacons increases, the wireless channel becomes congested, resulting in packet collisions and the loss of numerous beacons. This paper addresses the challenge of optimizing joint beaconing power and rate in VANETs. A joint utility-based beacon power and rate game is formulated, treated both as a non-cooperative and a cooperative game. To compute the desired equilibrium, three distributed and iterative algorithms (Best Response Algorithm, Cooperative Bargaining Algorithm) are introduced. These algorithms simultaneously update the optimal values of beaconing power and rate for each vehicle in each step. Extensive simulations showcase the convergence of the proposed algorithm to equilibrium and offer insights into how variations in game parameters may affect the game's outcome. The results demonstrate that the Cooperative Bargaining Algorithm is the most efficient in converging to equilibrium.
Article Preview
Top

1. Introduction

Vehicular Ad Hoc Networks (VANETs) represent a cutting-edge approach to wireless communication, leveraging advancements in device technology to facilitate intelligent communication between vehicles. Over recent decades, the emergence of VANETs has captured significant attention within the traffic research community. This novel communication paradigm offers promising avenues for enhancing Intelligent Transportation Systems, as evidenced by its potential applications in public transport management (Paquet 2010). Additionally, VANETs play a crucial role in bolstering transportation security, thereby mitigating the occurrence of accidents and disasters. To this end, various safety mechanisms have been devised for VANETs, encompassing functionalities such as emergency alerts, accident notifications, curve warnings, file-sharing, internet connectivity, and targeted advertisements.

Improving security in VANETs is primarily accomplished through the exchange of Basic Safety Messages (BSMs), commonly referred to as beacons, between vehicles. These beacons serve as vital communication tools, with vehicles regularly broadcasting them to relay essential information such as their position, speed, and direction within the network. In critical situations like collisions, accidents, or road surface collapses, vehicles also transmit emergency beacons or safety messages to alert nearby vehicles. However, in densely populated vehicular environments, the sheer volume of beacons can lead to congestion in the communication channel, resulting in an increased likelihood of message loss and delays. This congestion not only hampers vehicles' awareness but also diminishes the accuracy of safety-related information. The growing rate of beacon transmissions exacerbates this issue, raising concerns about the channel's capacity to handle the escalating data load effectively. Given these challenges, the development of robust congestion control strategies for VANETs has garnered significant attention in recent years. Effectively managing channel congestion is crucial for ensuring timely and reliable message delivery, particularly as vehicular density continues to rise.

The endeavor to model vehicle behavior in VANETs analytically has become a focal point of research interest, with increasing attention from scholars. Numerous analytical models have been proposed to scrutinize VANET performance and offer viable solutions tailored to the unique challenges encountered in these networks. Among these challenges, congestion control stands out as a significant concern in computer networks. Metrics commonly employed to assess congestion control include fairness among vehicles, convergence time, and oscillation size (Chiu and Jain 1989). In the context of VANETs, congestion control must operate in a decentralized manner, without relying on any centralized infrastructure. This decentralized approach is essential to accommodate the dynamic nature of VANETs. Additionally, the convergence time of the control mechanism must be minimized to swiftly adapt to changing network conditions and ensure efficient traffic management.

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 1 Issue (2022)
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing