TY - JOUR
T1 - Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
AU - Liang, Jia Ming
AU - Wu, Ho Cheng
AU - Chen, Jen-Jee
AU - Tseng, Yu-Chee
PY - 2010/11/1
Y1 - 2010/11/1
N2 - 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.
AB - 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.
KW - IEEE 802.16
KW - Mini-slot scheduling
KW - Routing tree
KW - WiMAX
KW - Wireless mesh network
UR - http://www.scopus.com/inward/record.url?scp=77957174108&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2010.07.016
DO - 10.1016/j.comcom.2010.07.016
M3 - Article
AN - SCOPUS:77957174108
VL - 33
SP - 2048
EP - 2056
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 17
ER -