Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks

Jia Ming Liang*, Ho Cheng Wu, Jen-Jee Chen, Yu-Chee Tseng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


This work 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. We are interested in chain and grid WMNs, which are the basic topologies of many applications. We propose scheduling schemes that are featured by low complexity and low signaling overhead. Compared to existing works, this work 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. To minimize the transmission latency, we model the transmission latency as a function of the transmission size and the subscriber stations' traffic demands, and take the first-order derivative of the transmission size to find the minimum latency. Simulation results show that our schemes significantly improve over existing works in computational complexity while maintain similar or better transmission latencies.

Original languageEnglish
Pages (from-to)2048-2056
Number of pages9
JournalComputer Communications
Issue number17
StatePublished - 1 Nov 2010


  • IEEE 802.16
  • Mini-slot scheduling
  • Routing tree
  • WiMAX
  • Wireless mesh network

Fingerprint Dive into the research topics of 'Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks'. Together they form a unique fingerprint.

Cite this