In vehicular ad hoc networks (VANETs), each vehicle broadcasts its information periodically in its beacons to create awareness for surrounding vehicles aware of their presence. But, the wireless channel is congested by the increase beacons number, packet collision lost a lot of beacons. This paper tackles the problem of joint beaconing power and a beaconing rate in VANETs. A joint utilitybased beacon power and beacon rate game are formulated as a non-cooperative game and a cooperative game. A three distributed and iterative algorithm (Nash Seeking Algorithm, Best Response Algorithm, Cooperative Bargaining Algorithm) for computing the desired equilibrium is introduced, where the optimal values of each vehicle beaconing power and beaconing rate are simultaneously updated at the same step. Extensive simulations show the convergence of a proposed algorithm to the equilibrium and give some insights on how the game parameters may vary the game outcome. It is demonstrated that the Cooperative Bargaining Algorithm is a fast algorithm that converges the equilibrium.
Joint Beacon Power and Beacon Rate Control Based on Game Theoretic Approach in Vehicular Ad Hoc Networks
