中文摘要：

针对日益突显的车载自组织网络中的内容分发问题,对车载网中的流行内容分发进行了简要介绍,论述了现有方案的不足之处,并创新性地采用合作图博弈对该问题进行了建模,在该模型中,车载单元（the On-Board Units,OBUs）根据通过博弈建立的网络进行数据分发。对提出的基于图论的合作博弈方案在车载网数据分发中的性能进行了仿真分析,结果表明,与传统的非合作方法相比,该方法具有明显的优势。

英文摘要：

The popular content distribution （PCD） problem,which is becoming increasingly prominent in Vehicular Ad-hoc Net- works （VANETs） ,is introduced in this paper.The disadvantages of the existing methods are discussed, and this problem is modeled as a coalitional graph gamein which the on-board units （OBUs） try to form a directed graphto complete the data dissemination efficiently. Simulation results show that the proposed approach performs better compared with the traditional non-cooperative case.