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

Abstract

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 full-duplex 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 sche-duling 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 through-put 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.

Keywords

• |media access control (mac)|distributed wireless local area network|link scheduling|full-duplex|fairness