摘要： 为兼顾无线Ad hoc网络信道资源的公平利用及网络吞吐量，提出针对多跳无线Ad hoc网络的分布式公平调度算法。该算法采用链路竞争图说明网络中各子流的竞争关系，通过着色算法得到最大无竞争流的集合，通过邻居节点之间的信息交换得到局部(本地)流的信息，而无需全局流的信息交换。实验模拟结果表明，该算法可以在保证Ad hoc网络中各流公平性的同时，有效提高网络资源的利用率。

关键词: 无线Ad hoc网络, 公平调度, 分布式算法, 最大独立子集

Abstract: In order to balance the fairness and throughput of channel resources in wireless Ad hoc network, this paper proposes a distributed fair scheduling algorithm for multi-hop wireless Ad hoc network. The contention relationship of sub-flows are denoted by link contention graph, and the maximal independent sets are formed with coloring algorithm. The algorithm depends on local flow information obtained by information exchange between neighbor nodes. Simulation experimental result proves that the algorithm can efficiently maximize the throughput while maintaining basic fairness among flows.

Key words: wireless Ad hoc network, fair scheduling, distributed algorithm, maximal independent subset

中图分类号: 

• TP301.6