论文部分内容阅读
为兼顾无线Ad hoc网络信道资源的公平利用及网络吞吐量,提出针对多跳无线Ad hoc网络的分布式公平调度算法。该算法采用链路竞争图说明网络中各子流的竞争关系,通过着色算法得到最大无竞争流的集合,通过邻居节点之间的信息交换得到局部(本地)流的信息,而无需全局流的信息交换。实验模拟结果表明,该算法可以在保证Ad hoc网络中各流公平性的同时,有效提高网络资源的利用率。
In order to balance the fair use of wireless Ad hoc network channel resources and network throughput, a distributed fair scheduling algorithm for multi-hop wireless Ad hoc networks is proposed. The algorithm uses the link competition diagram to illustrate the competitive relationship among sub-flows in the network. The maximum non-competing flow set is obtained by the shading algorithm. The local (local) flow information is obtained through the exchange of information between neighboring nodes without global flow Information exchange. Experimental results show that this algorithm can effectively improve the utilization of network resources while ensuring the fairness of each stream in Ad hoc networks.