A Game Theoretical Approach To Model Vehicular Broadcast Communication

A vehicular ad-hoc network consists of multiple local networks due to the limited communication range of Onboard Processing Unit utilised by participating vehicles. Therefore, multiple re-transmission attempts by relay vehicles are required to propagate an original information packet. However, these necessary re-transmissions cause Broadcast Storm Problem (BSP) which can in-turn create network congestions. This paper addresses the issues associated with BSP by proposing an Optimised Relay Vehicle Selection (ORVS) mechanism. To devise the strategy for an ORVS mechanism, an Evolutionary Game (EG) strategy is utilised that consists of a novel payoff function. In addition to this, we also propose a (BG) to simulate a VANET environment, which is implemented using Python, for collection of results. The numerical results obtained by the proposed EG are compared with the existing techniques, which show better performance by the ORVS mechanisms produced by the game theoretical approaches.