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

Authors:
Jia-Ming Liang;Ho-Cheng Wu;Jen-Jee Chen;Yu-Chee Tseng
Affiliations:
Department of Computer Science, National Chiao-Tung University, Hsin-Chu 30010, Taiwan;Department of Computer Science, National Chiao-Tung University, Hsin-Chu 30010, Taiwan;Department of Computer Science, National Chiao-Tung University, Hsin-Chu 30010, Taiwan;Department of Computer Science, National Chiao-Tung University, Hsin-Chu 30010, Taiwan
Venue:
Computer Communications
Year:
2010

Citing 11
Cited 1

Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
WiMax/MobileFi

WiMax/MobileFi
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks

Computer Communications
Comparison of two routing metrics in OLSR on a grid based mesh network

Ad Hoc Networks
WiMAX: Standards and Security

WiMAX: Standards and Security
Delay aware link scheduling for multi-hop TDMA wireless networks

IEEE/ACM Transactions on Networking (TON)
Cross-layer Scheduling Algorithms for IEEE 802.16 Based Wireless Mesh Networks

Wireless Personal Communications: An International Journal
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Application-aware scheduling for VoIP in Wireless Mesh Networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE 802.16/WiMAX-based broadband wireless access and its application for telemedicine/e-health services

IEEE Wireless Communications
IEEE 802.16 Mesh Schedulers: Issues and Design Challenges

IEEE Network: The Magazine of Global Internetworking

Performance analysis of WiMAX-based wireless mesh networks using an M/D/1 queuing model

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.