Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2010, Vol. 27 ›› Issue (5): 677-683.DOI: 10.7523/j.issn.2095-6134.2010.5.015

• Research Articles • Previous Articles     Next Articles

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 Online:2010-09-15

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

CLC Number: