| Title | Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs |
| Authors | Wang, Tianyu Song, Lingyang Han, Zhu |
| Affiliation | Peking Univ, Sch Elect Engn & Comp Sci, State Key Lab Adv Opt Commun Syst & Networks, Beijing 100871, Peoples R China. Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA. |
| Keywords | Coalitional graph game popular content distribution vehicular ad hoc networks VEHICULAR NETWORKS |
| Issue Date | 2013 |
| Publisher | ieee transactions on vehicular technology |
| Citation | IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY.2013,62,(8),4010-4019. |
| Abstract | Popular content distribution is one of the key services provided by vehicular ad hoc networks (VANETs), in which a popular file is broadcast by roadside units (RSUs) to the onboard units (OBUs) driving through a particular area. Due to fast speeds and deep fading, some file packetsmight be lost during the vehicle-to-roadside (V2R) 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 (CR) is utilized for vehicle-to-vehicle (V2V) transmissions so that the P2P approach does not require additional bandwidth. Simulation results show that the proposed approach performs better under various conditions, relative to the noncooperative approach, in which the OBUs share no information and simply respond to any data request from other OBUs. |
| URI | http://hdl.handle.net/20.500.11897/152248 |
| ISSN | 0018-9545 |
| DOI | 10.1109/TVT.2013.2245353 |
| Indexed | SCI(E) EI |
| Appears in Collections: | 信息科学技术学院 区域光纤通信网与新型光通信系统国家重点实验室 |
