Slot allocation strategies for TDMA protocols in multihop packet radio networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Assignment methods for spatial reuse TDMA
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Proceedings of the 11th annual international conference on Mobile computing and networking
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The IEEE 802.16 standard proposes two kinds of scheduling algorithms in WiMAX mesh networks, centralized and distributed algorithms. This paper mainly introduces a scheme working in a centralized mode. In this scheme, each node is equipped with a third generation mesh router, which owns two relay transceivers and can be tuned among multiple channels. The major goal of our solution is to reduce the length of scheduling under an interference-aware restriction. The feasibility and efficiency of our proposal are testified through extensive simulations. The result justifies that our algorithm provides a much higher performance than the previous ones.