Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.comcom.2010.07.016 | Computer Communications |
Keywords | Field | DocType |
IEEE 802.16,Routing tree,Mini-slot scheduling,WiMAX,Wireless mesh network | Mesh networking,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Computer network,Real-time computing,Two-level scheduling,Schedule,Wireless mesh network,Dynamic priority scheduling | Journal |
Volume | Issue | ISSN |
33 | 17 | Computer Communications |
Citations | PageRank | References |
1 | 0.37 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jia-Ming Liang | 1 | 104 | 13.26 |
| Ho-Cheng Wu | 2 | 4 | 0.79 |
| Jen-Jee Chen | 3 | 205 | 23.90 |
| Yu-Chee Tseng | 4 | 6603 | 639.67 |