Mini-Slot Scheduling for IEEE 802.16d Chain and Grid Mesh Networks
碩士 === 國立交通大學 === 資訊學院碩士在職專班資訊組 === 98 === 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 th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39114640393603850112 |
| Summary: | 碩士 === 國立交通大學 === 資訊學院碩士在職專班資訊組 === 98 === 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 achieves near-optimal transmission latencies by balancing between transmission overhead and pipeline efficiency and that are more practical and easier to implement. Simulation results show that our schemes significantly improves over exiting works in computational complexity while maintain similar or better
transmission latencies.
|
|---|