Achieving Data Utility Fairness in Periodic Dissemination for VANETs

In addition to safety, Vehicular Ad-hoc Networks (VANETs) enable the development of new information-rich applications that disseminate relevant data to vehicles. One key challenge in such networks is to use the available bandwidth efficiently when there is: (i) a short connectivity time due to the rapidly changing road environment, and (ii) bandwidth congestion due to continuous collection and dissemination of data. Numerous solutions were proposed to alleviate bandwidth congestion by using transmission power and beaconing rate control. However, the reduction of data messages transmitted by using priority- based data selection mechanisms has not been fully explored. In this work, we propose a periodic data dissemination protocol for non-safety applications which distributes data utility fairly among vehicles with conflicting data interests. Furthermore, given a defined maximum network load allowed, only the least relevant data is suppressed. Fairness is achieved using the concept of Nash Bargaining from game theory. Simulation results show that our approach leads to an efficient bandwidth utilization in terms of utility per message received and higher fairness index compared with other approaches.