无线Ad hoc网络中分布式极大吞吐率调度算法研究

Research on distributed maximal throughput scheduling algorithm in wireless Ad hoc network

针对无线Ad hoc网络广播链路的特点,在更一般的链路干扰约束模型下,设计了一种分布式、贪婪的极大吞吐率调度算法。通过运用Laypunov定理,证明了该调度算法的稳定区域是网络最大稳定区域的γ倍(0<γ<1)。通过仿真验证了该算法性能接近集中式的GMM(贪婪极大匹配)调度算法。

Aiming at the broadcasting link characteristics in wireless Ad hoc, this paper designed a distributed greed maximal throughput scheduling algorithm which was under a more general link interference constraint model. By using Laypunov theorem, this paper proves that the scheduling algorithm can achieve the stability region which reduced the maximum stability region of the network by the factor of T （0 〈 γ 〈 1 ）. The simulation results show that the algorithm performance get close to the centralized GMM （greed maximal match） scheduling algorithm.