基于拥塞控制的无线网络最大权调度算法  

Maximum Weight Scheduling Algorithm for Wireless Network Based on Congestion Control

作　　者：陈持鑫 周继鹏[1] 

机构地区：[1]暨南大学计算机科学系,广州510632

出　　处：《计算机工程》2016年第5期130-133,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(61373125;61272073);广东省自然科学基金资助项目(S2013020012865);广东省科技计划基金资助项目(2013B010401016)

摘　　要：无线网络中包调度和拥塞控制方案通常是独立设计的,导致网络资源无法高效利用。针对该问题,基于拥塞控制提出一种新的最大权调度算法。根据最大权调度算法计算节点中所有流的权值,选择最大权值的流进行调度,根据网络的拥塞情况,调节节点中流的发送速率。仿真结果表明,该算法能够提高网络吞吐量,达到更好的公平性并减少丢包率。In wireless network, packet scheduling and congestion control are usually independently designed. This prevents the network resources from being efficiently utilized. In order to solve this problem, a new maximum weight scheduling algorithm based on congestion control is proposed in this paper. The algorithm computes weights of all the flows in the node, chooses the flow with the maximum weight to schedule and adjusts the transmission rate of the flow according to the network congestion situation. Simulation results show that, the algorithm can improve network throughput, achieves better fairness and reduces packet loss rate.

关 键 词：无线网络 最大权调度算法 拥塞控制 吞吐量 公平性 丢包率 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]