A Queue-Length and Collision-Risk-Prediction Based Scheduling for Wireless Mesh Networks

摘要

The hidden terminals lead to frequent conflicts in the Wireless Mesh Network (WMNs), which degrades the system performance. Moreover, as the number of network nodes increases, the conflict becomes worse. In order to improve the throughput, this paper analyzes conflict issues in distributed WMNs and proposes a scheduling scheme based on queue-length and collision risk. In this scheme, the node exchanges the queue-length information in real-time, and the node that has the longest queue-length in the two-hop range can send data. Moreover, the node changes the sending order of the packets with the same priority by predicting the collision risk of the packet before sending, and preferentially sends the packet with the smallest collision risk. Finally, simulation results show that the proposed scheme can effectively increase the throughput when the network load is heavy, and it can significantly decrease the dropped packets and the delay.