完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Liang, Jia-Ming | en_US |
dc.contributor.author | Chen, Jen-Jee | en_US |
dc.contributor.author | Wu, Ho-Cheng | en_US |
dc.contributor.author | Tseng, Yu-Chee | en_US |
dc.date.accessioned | 2014-12-08T15:37:33Z | - |
dc.date.available | 2014-12-08T15:37:33Z | - |
dc.date.issued | 2010 | en_US |
dc.identifier.isbn | 978-1-4244-2519-8 | en_US |
dc.identifier.issn | 1550-2252 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/25820 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | IEEE 802.16 | en_US |
dc.subject | routing tree | en_US |
dc.subject | mini-slot scheduling | en_US |
dc.subject | WiMAX | en_US |
dc.subject | wireless mesh network | en_US |
dc.title | Simple and Regular Mini-Slot Scheduling for IEEE 802.16d Grid-based Mesh Networks | en_US |
dc.type | Article | en_US |
dc.identifier.journal | 2010 IEEE 71ST VEHICULAR TECHNOLOGY CONFERENCE | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000287515900385 | - |
顯示於類別: | 會議論文 |