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

• 作 者: Chaonong XU Yongjun XU Zhiguang WANG Haiyong LUO
• 机 构: Department of Computer Science and Technology, China University of Petroleum, Beijing 102249, China
• 出 处: 控制理论与应用(英文版)
• 发表日期: 2011年1期
• 关键词: Topology-transparent Topology-independent Balanced incomplete block design Time-

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 inaccu racy 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.