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

Optimal scheduling algorithm based on network coding in vehicular networks

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

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.