Journal of University of Chinese Academy of Sciences >
Optimal scheduling algorithm based on network coding in vehicular networks
Received date: 2010-02-09
Revised date: 2010-03-22
Online published: 2010-09-15
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
MA Yun-Qi , LU Han-Cheng . Optimal scheduling algorithm based on network coding in vehicular networks[J]. Journal of University of Chinese Academy of Sciences, 2010 , 27(5) : 677 -683 . DOI: 10.7523/j.issn.2095-6134.2010.5.015
[1] Eriksson J, Balakrishnan H, Madden S. Cabernet: vehicular content delivery using WiFi //Proceedings of ACM International Conference on Mobile Computing and Networking(MOBICOM). San Francisco, California, USA, 2008: 199-210.
[2] Scheuermann B, Lochert C, Rybicki J, et al. A fundamental scalability criterion for data aggregation in VANETs //Proceedings of ACM International Conference on Mobile Computing and Networking(MOBICOM). Beijing, China, 2009: 285-296.
[3] Li S Y R, Yeung R W, Cai N. Linear network coding
[J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381.
[4] Katti S, Rahul H, Hu W, et al. XORs in the air: practical wireless network coding
[J]. IEEE/ACM Transactions on Networking, 2008,16(3): 497-510.
[5] Nguyen D, Tran T, Nguyen T, et al. Wireless broadcast using network coding
[J]. IEEE Transactions on Vehicular Technology,2009, 58(2): 914-925.
[6] Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast
[J]. IEEE Transactions on Information Theory, 2006, 52(10): 4413-4430.
[7] Lu H C, Wu F, Chen C W. Stateful scheduling with network coding for roadside-to-vehicle communication //Proceedings of IEEE ICC09. Dresden, Germany, 2009: 1-5.
[8] Pardalos P M, Xue J. The maximum clique problem
[J]. Journal of Global Optimization, 1994, 4(3): 301-328.
[9] Fenet S, Solnon C. Searching for maximum cliques with ant colony optimization
[J]. Lecture Notes in Computer Science, 2003,2611: 291-302.
[10] Battiti R, Protasi M. Reactive local search for maximum clique
[J]. Algorithmica, 2001, 29(4): 610-637.
[11] Gelbukh A, Sidorov G. Zipf and heaps laws coefficients depend on language
[J]. Lecture Notes in Computer Science, 2001, 2004/2009: 332-335.
/
| 〈 |
|
〉 |