Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 9th annual international conference on Mobile computing and networking
Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Beyond pilots: keeping rural wireless networks alive
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
A case for adapting channel width in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An adaptive, high performance mac for long-distance multihop wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Tegola tiered mesh network testbed in rural Scotland
Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions
Wardrop Routing in Wireless Networks
IEEE Transactions on Mobile Computing
QoS-aware on-demand channel width adaptation protocols for multi-radio ad-hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
WiLdnet: design and implementation of high performancewifi based long distance networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
FLUID: improving throughputs in enterprise wireless lans through flexible channelization
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
DMesh: Incorporating Practical Directional Antennas in Multichannel Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the traffic adaptive channel allocation problem in long-distance 802.11 mesh networks. Our approach is to exploit the capability provided by 802.11 hardware to use different channel widths and assign channel widths to links based on their relative traffic volume. We show that this traffic-aware channel width assignment problem is NP-complete and propose a polynomial time, greedy channel allocation algorithm that guarantees valid channel allocations for each node. Evaluation of the proposed algorithm via simulations of real network topologies shows that it consistently outperforms the current approach of fixed width allocation due to its ability to adapt to spatio-temporal variations in traffic demands.