Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs

Date

2/6/2013

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE Transactions on Vehicular Technology

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 packets might 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.

Description

Keywords

Coalitional graph game, popular content distribution, vehicular ad hoc networks

Citation

Copyright 2013 IEEE Transactions on Vehicular Technology. This is a pre-print version of a published paper that is available at: https://ieeexplore.ieee.org/abstract/document/6451300. Recommended citation: Wang, Tianyu, Lingyang Song, and Zhu Han. "Coalitional graph games for popular content distribution in cognitive radio VANETs." IEEE Transactions on Vehicular Technology 62, no. 8 (2013): 4010-4019. doi: 10.1109/TVT.2013.2245353. This item has been deposited in accordance with publisher copyright and licensing terms and with the author's permission.