Mini-Slot Scheduling for IEEE 802.16d Chain and Grid Mesh Networks
This paper considers the mini-slot scheduling problem in IEEE 802.16d Wireless Mesh Networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission overhead, the scheduling complexity, and the signaling overhead to broadcast the scheduling results. The authors are interested in chain and grid WMNs, which are the basic topologies of many applications. They propose scheduling schemes that are featured by low complexity and low signaling overhead. Compared to existing works, this paper contributes in developing low-cost schemes to find periodical and regular schedules that achieve near-optimal transmission latencies by balancing between transmission overhead and pipeline efficiency and that are more practical and easier to implement.