Content distribution in vehicular networks using coalitional graph game

The popular content distribution (PCD) problem in Vehicular Ad-hoc Networks (VANETs) is considered. We model this problem as a coalitional graph game in which the on-board units (OBUs) try to form a peer-to-peer (P2P) network where one OBU transmits files to multi OBUs but receives from only one OBU each time, to complete the data dissemination efficiently. In this game, the OBUs engage in bilateral negotiations which result in a bilaterally agreement of forming a directed link among OBUs. Once the network is constructed, the OBUs will transmit the content pieces to each other. We study this game under a form of myopic dynamics which is carried out by each OBU in a distributed way. Furthermore, the network formed in this game is a pairwise stable network. Simulation results show that the proposed approach performs better comparing with the non-cooperative case.