论文部分内容阅读
提出一种新颖的时分复用与最大调度的混合调度算法,解决了单信道无线网状网中,当同一时刻待传输链路突增时,信道竞争冲突加剧,网络容量显著下降的问题.算法根据链路与系统子时隙染色,使每条链路都有唯一系统子时隙相对应,链路在同色子时隙上实现时分复用调度;在异色子时隙空闲时,实现链路的最大调度.此算法具有时分复用和最大调度两种调度算法的优点.文中利用李雅普诺夫稳定性定理证明了算法的效率比率.仿真结果表明,该算法下的网络容量有明显提升.
A novel hybrid scheduling algorithm with time-division multiplexing and maximum scheduling is proposed, which solves the problem of channel contention conflict and network capacity declining significantly when single-channel wireless mesh networks suddenly increase at the same time. According to the link and the system subslot dyeing, so that each link has a unique system corresponding to the subslot, the link in the same time slot to achieve time-division multiplexing scheduling; in the idiot time slot free, chain This algorithm has the advantages of both time-division multiplexing and maximum scheduling scheduling algorithm.The efficiency ratio of the algorithm is proved by the Lyapunov stability theorem.The simulation results show that the network capacity under this algorithm is obviously improved.