分布式WLAN全双工链路加权调度算法

Weighted Scheduling Algorithm Based on In-Band Full-Duplex Link for Distributed WLAN

针对分布式无线局域网络带内全双工接入过程的链路调度公平性问题,提出一种基于节点调度权重的全双工链路调度算法(W-FD)。通过节点调度权重实现链路负载均衡,从而提升全双工链路的吞吐量,减小节点接入时延。算法基于分布式网络结构,节点按自组织方式获取网络拓扑及邻居节点状态信息,依据节点间数据量、互扰关系和链路调度间隔等参数计算调度权重,邻域内具有较高调度权重的节点作为链路发起对象,建立全双工链路。结果表明:与传统半双工链路调度(RTS/CTS)相比,该算法在确保节点接入公平性的条件下,减小了链路调度间隔,改善了网络的吞吐量和时延性能;与现有全双工链路调度相比,该算法在业务量非均衡网络中有效改善时延尾部特性,在保证网络吞吐量的同时具有较好的调度公平性。

Aiming at the problem of link scheduling fairness in the in-band full-duplex access process of distributed wireless local area network(WLAN),a full-duplex link scheduling algorithm based on nodal scheduling weights(W-FD)is proposed.Load balance of link is realized by node scheduling weight,therefore the throughput of fullduplex link can be improved and the delay can be reduced.The algorithm is based on distributed network,and the nodes obtain the network topology and the state information of neighbor nodes in a self-organizing way.The scheduling weight is calculated according to the data volume between nodes,mutual interference relationship and scheduling interval between links.The node with high scheduling weight in the neighborhood acts as the link initiator to establish a full duplex link.Result shows:compared with the half-duplex link scheduling algorithm(RTS/CTS),W-FD ensures the access fairness of nodes,reduces link scheduling intervals and improves network throughput and time delay performance;compared with the existing full-duplex link scheduling algorithm,W-FD can effectively improve the tail behavior of time delay in the traffic disequilibrium network,and ensure the network throughput as well as the scheduling fairness.