|
| 摘要: |
| 首先证明了与应用网络编码相关的最优化问题是NP完全的，然后提出了一种采用启发式算法的网络编码方法COMP。该网络编码方法利用贪婪集合配置启发式算法和贪婪集合覆盖启发式算法的基本思想来尽可能多地挖掘网络编码机会。NS-2仿真结果表明，该网络编码方法在应用到节点数比较多、最大传输范围比较小以及会话数比较多的场景中时，有效地减轻了并发会话的影响，提高了现有广播算法的性能，而且其性能提高超过了现有的网络编码方法。 |
| 关键词: 无线自组网 网络编码 贪婪集合配置 贪婪集合覆盖 广播 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Basic Research Program of China under Grant No.2006CB303000 (国家重点基础研究发展计划(973)) |
|
| Network Coding Method Using Heuristic Algorithms for Wireless Ad Hoc Networks |
|
JIAO Xian-Long, WANG Xiao-Dong, ZHOU Xing-Ming
|
| Abstract: |
| This paper first proves that the optimizing problems concerning network coding are NP-complete, and then puts forward a network coding method called COMP, using heuristic algorithms. This network coding method adopts the basic ideas of the set packing heuristic algorithm and the set cover heuristic algorithm with the aim of digging up as many network coding opportunities as many as possible. The results of the simulation carried out by the NS-2 simulator show that in scenarios where there are a large number of nodes, a small maximum transmission range, and a large number of sessions, this network coding method effectively alleviates the impact of session concurrency, improves the performance of the existing broadcast algorithm, and its performance improvement is greater than that of the existing network coding method. |
| Key words: wireless ad hoc network network coding greedy set packing greedy set cover broadcast |
