A coloring problem for weighted graphs
Information Processing Letters
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Personalised subscription pricing for optimised wireless mesh network deployment
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
How to correctly use the protocol interference model for multi-hop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Models and heuristic algorithms for a weighted vertex coloring problem
Journal of Heuristics
Transmission power and data rate aware routing on wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Engineering wireless mesh networks: joint scheduling, routing, power control, and rate adaptation
IEEE/ACM Transactions on Networking (TON)
On optimal SINR-based scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Optimised scheduling for Wireless Mesh Networks using fixed cycle times
WOWMOM '11 Proceedings of the 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Network: The Magazine of Global Internetworking
Perfect periodic scheduling for three basic cycles
Journal of Scheduling
Hi-index | 0.24 |
Traffic in an infrastructure wireless mesh network is routed over multiple hops between clients and gateways, hence performance can be significantly reduced where links interfere with each other. In this paper we consider the problem of optimising link scheduling for wireless mesh networks, making a number of contributions. Adopting a protocol-based model, we introduce an integer programming approach for an optimised schedule using a time-slot model. This model compares favourably against previously published methods and we introduce a rapid heuristic approximation that can present near-optimal solutions in a fraction of the time. We show that taking into consideration the affect of varying data rates across individual links during different time slots can further enhance the throughput achieved. This decreases the local data rate on some links but concurrently reduces the interference range of the transmitted signal which increases spatial reuse across the network. We present efficient heuristics to rapidly find near-optimal solutions to an integer programming model of this problem and provide rigorous justification on benchmark problems.