End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th 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
Impact of interference on multi-hop wireless network performance
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Proceedings of the 12th annual international conference on Mobile computing and networking
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE 802.16 Mesh Schedulers: Issues and Design Challenges
IEEE Network: The Magazine of Global Internetworking
An Effective QoS Differentiation Scheme for Wireless Mesh Networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
Computer Communications
A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Wireless mesh network (WMN) is emerging as an important networking architecture for future wireless communications. The mesh mode supported in IEEE 802.16 protocol provides a TDMA solution for WMN, in which scheduling is an important issue. In this paper, we discuss the issues on how to satisfy a set of bandwidth requests in IEEE 802.16 WMNs using minimal radio resources (or solving minimal schedule length problem). In consideration of transmission overhead and adaptive modulation and coding (AMC), two cross-layer scheduling algorithms are proposed, namely max-transmission and priority-based algorithms. In particular, they are proposed based on a physical interference model, instead of a protocol interference model as suggested in the literature. For the priority-based algorithm, we study several priority criteria based on different cross-layer information. An iterative scheme for QoS traffic is introduced to guarantee fairness when traffic load exceeds the network capacity. Simulation results show that our algorithms outperform the existing schemes based on protocol model, and they also ensure better fairness among different nodes.