Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs
Tianyu Wang, Lingyang Song, and Zhu Han

TL;DR
This paper introduces a coalitional graph game-based P2P content distribution method for VANETs, leveraging cognitive radio to improve data sharing efficiency among OBUs, especially under challenging conditions.
Contribution
It presents a novel coalition formation algorithm for OBUs in VANETs using a coalitional graph game model combined with cognitive radio technology.
Findings
Outperforms non-cooperative methods in simulations
Enhances data sharing efficiency among OBUs
Utilizes cognitive radio to avoid extra bandwidth use
Abstract
Popular content distribution is one of the key services provided by vehicular ad hoc networks (VANETs), in which a popular file is broadcasted by roadside units (RSUs) to the on-board units (OBUs) driving through a particular area. Due to fast speed and deep fading, some file packets might be lost during the vehicle-to-roadside broadcasting stage. In this paper, we propose a peer-to-peer (P2P) approach to allow the OBUs to exchange data and complement the missing packets. Specifically, we introduce a coalitional graph game to model the cooperation among OBUs and propose a coalition formation algorithm to implement the P2P approach. Moreover, cognitive radio is utilized for vehicle-to-vehicle transmissions so that the P2P approach does not require additional bandwidth. Simulation results show that the proposed approach performs better in various conditions, relative to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicular Ad Hoc Networks (VANETs) · Transportation and Mobility Innovations · Peer-to-Peer Network Technologies
