BAYESIAN GAME-THEORETIC APPROACH BASED ON 802.11p MAC PROTOCOL TO ALLEVIATE BEACON COLLISION UNDER URBAN VANETs

Vehicular Ad-hoc Networks (VANETs) facilitate the broadcasting of status information among vehicles. In the IEEE 802.11p/WAVE vehicle network environment, the strict periodic beacon broadcasting of safety messages requires status advertisement to assist drivers in maintaining safety. The beacon broadcasting is required for real-time communication, and for avoiding the degradation of communication channels in high vehicular density situations. However, a periodic safety beacon in the IEEE 802.11p/WAVE standard can only transmit packets on a single channel using the MAC protocol. In high vehicular density situations, the channel becomes overloaded, thereby increasing the probability of beacon collision, and hence reducing the influx of successfully received beacons, which increases the delay. Many studies have indicated that appropriate congestion control algorithms are essential to provide efficient operation of a network. In this paper, to avoid beacon congestion, we have considered game theoretic models of wireless medium access control (MAC) where each transmitter makes individual decisions regarding their power level or transmission probability. We have evaluated the equilibrium transmission strategies of both the selfish and the cooperative user. In such a game-theoretic study, the central question is whether Bayesian Nash equilibrium (BNE) exists, and if so, whether the network operates efficiently at the equilibrium point. We proved that there exists only one BNE point in our game and validated our result using simulation. The performance of the proposed scheme is illustrated with the help of simulation results