Paper Info
Title
Simple and Regular Mini-Slot Scheduling for IEEE 802.16d Grid-Based Mesh Networks
Abstract
This work addresses the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). A practical mini-slot scheduling needs to take into account following issues: the transmission overhead, the scheduling complexity, and the signaling overhead to notify the scheduling results to subscriber stations. We focus in a grid-based WMN, which is the most recommended topology due to its high capacity and connectivity. In this paper, we propose scheduling schemes featured by low complexity and low signaling overhead. The proposed schemes help find periodical and regular schedules, which can balance between transmission overhead and pipeline efficiency. They can achieve near-optimal transmission latencies. Simulation results show that our schemes outperform other schemes, especially when the network size is larger.
Year
DOI
Venue
2010
10.1109/VETECS.2010.5494226
VTC Spring
Keywords
Field
DocType
scheduling,grid computing,wmn,metropolitan area networks,wireless mesh networks,scheduling complexity,computational complexity,ieee 802.16d grid-based mesh networks,near-optimal transmission latencies,transmission overhead,telecommunication signalling,signaling overhead,minislot scheduling,time division multiple access,pipelines,ofdm,mesh network,wireless mesh network,mesh networks,scheduling problem,wireless communication,wimax,wireless sensor networks,network topology,schedules,topology
Mesh networking,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Computer network,Two-level scheduling,Rate-monotonic scheduling,Wireless mesh network,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1550-2252 E-ISBN : 978-1-4244-2519-8
978-1-4244-2519-8
3
PageRank 
References 
Authors
0.42
5
4
Name
Order
Citations
PageRank
Jia-Ming Liang110413.26
Jen-Jee Chen220523.90
Ho-Cheng Wu340.79
Yu-Chee Tseng46603639.67