基于赤字轮询算法的无线Mesh网络公平性研究*

无线Mesh网络在负载较重时会出现严重的空间不公平现象，即远离网络中心的节点很难将其数据传送到网关。赤字轮询算法能够保证节点数据传输的公平性要求，但却存在吞吐量平均化的问题。在分析无线Mesh网络公平性问题的基础上，提出基于最小均方的动态赤字轮询算法，其核心思想是动态调整轮询权重值。仿真在IEEE 802.11 DCF机制下将所提出的算法与传统的赤字轮询及弃尾算法进行比较，结果表明，所提出的方法能够保证吞吐量需求不同的业务流之间的公平性，并使网络总吞吐量获得提高。

Fairness research of wireless Mesh networks based on deficit round robin

Serious spatial unfairness occurs when the traffic load of a wireless Mesh network was heavy, what starves the nodes away from the gateway. The deficit round-robin algorithm could achieve network fairness, but suffered from a problem of average throughput. Based on the analysis of spatial unfairness, this paper proposed a new dynamic deficit round-robin algorithm using least mean square, which dynamically adjusted the weight of round-robin. Through simulations compared droptail and deficit round-robin algorithm under IEEE 802.11 DCF mechanism. And demonstrate that dynamic deficit round-robin algorithm can give fairer throughput to different flows and slightly improve the overall throughput of wireless Mesh networks.