A topology-transparent MAC scheduling algorithm with guaranteed QoS for multihop wireless network

Abstract

Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new topologytransparent MAC scheduling algorithm, with parameters of the node number and the maximal nodal degree known, our scheduling algorithm is based on a special balanced incomplete block design whose block size is optimized by maximizing the guaranteed throughput. Its superiority over typical other scheduling algorithms is proven mathematically with respect to the guaranteed throughput, the maximal transmission delay, and also the minimal transmission delay. The effect of inaccuracy in the estimation of the maximal nodal degree on the guaranteed throughput is deduced mathematically, showing that the guaranteed throughput decreases almost linearly as the actual nodal degree increases. Further techniques for improving the feasibility of the algorithm, such as collision avoidance, time synchronization, etc., are also discussed.

Toward Optimal Distributed Node Scheduling in a Multihop Wireless Network Through Local Voting

“…The authors have further presented performance improvement for broadcasting in [27]. Another topology transparent scheduling algorithm is presented in [24].…”

A probabilistic refined policy for topology-independent medium access control in ad hoc network environments

“…In [39] Xu et al propose a scheduling algorithm based on balanced incomplete block design. They conclude that their algorithm is superior to [17] and [36] in terms of guaranteed throughput, minimum and maximum delay.…”