欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2010, Vol. 27 ›› Issue (5): 677-683.DOI: 10.7523/j.issn.2095-6134.2010.5.015

• 论文 • 上一篇    下一篇

车辆网络中基于网络编码机会的调度算法

马赟琪1,2, 卢汉成1,2   

  1. 1. 中国科学技术大学多媒体计算与通信教育部-微软重点实验室,合肥 230027;
    2. 中国科学技术大学电子工程与信息科学系信息网络实验室,合肥 230027
  • 收稿日期:2010-02-09 修回日期:2010-03-22 发布日期:2010-09-15
  • 通讯作者: 卢汉成
  • 基金资助:

    国家科技重大专项(2009ZX03004-002)、国家自然科学基金重点项目(60832005)和多媒体计算与通信教育部-微软重点实验室开放基金项目(07122801)资助 

Optimal scheduling algorithm based on network coding in vehicular networks

MA Yun-Qi1,2, LU Han-Cheng1,2   

  1. 1. MOE-MS Key Laboratory of Multimedia Computing and Communication, USTC, Hefei 230027, China;
    2. Information Network Lab of EEIS Department, University of Science and Technology of China, Hefei 230027, China
  • Received:2010-02-09 Revised:2010-03-22 Published:2010-09-15

摘要:

证明在车辆网络中应用网络编码,其广播容量最大化问题是NP难的;提出一种基于最大编码机会的优化调度算法. 该算法结合网络编码与车辆缓存提供的编码机会,有效提高了广播容量. 结果表明,与贪婪算法相比,该算法获得更大网络编码增益,保证了一定的传输公平性.

关键词: 车辆网络, 网络编码, 优化算法, 公平性

Abstract:

Network coding is implemented in wireless networks to improve the network capacity in mobility scenario. We first formulate the network coding in vehicular network mathematically, and then prove that it is an NP-hard problem. For improving vehicular network capacity, we propose an optimal scheduling scheme focusing on the maximization of the coding opportunities. Simulations show the efficiency of the proposed scheme compared to the greedy algorithm, and the fairness.

Key words: vehicular networks, network coding, optimal scheduling, fairness

中图分类号: