A load aware channel assignment and link scheduling algorithm for multi-channel multi-radio wireless mesh networks

Authors:
Arun A. Kanagasabapathy;A. Antony Franklin;C. Siva Ram Murthy
Affiliations:
Indian Institute of Technology Madras;Indian Institute of Technology Madras;Indian Institute of Technology Madras
Venue:
HiPC'08 Proceedings of the 15th international conference on High performance computing
Year:
2008

Citing 5
Cited 2

End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
End-to-end rate allocation in multi-radio wireless mesh networks: cross-layer schemes

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks

An adaptive channel reconfiguration algorithm for multi-channel multi-radio wireless mesh networks

IEEE Transactions on Wireless Communications
Online reconfiguration of channel assignment in Multi-Channel Multi-Radio wireless mesh networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless Mesh Networks with multiple channels and multipleradios on the mesh routers, have a great potential to increase theoverall capacity of the network. To obtain the complete benefit of theincreased capacity of such networks, efficient Channel Assignment (CA)and Link Scheduling (LS) algorithms are extremely important. A staticCA and LS may not be optimal, in terms of utilization of underlyingnetwork resources, for every traffic demand in the network. In this paper,we find the optimal CA and LS for the given traffic demand byformulating an MILP by considering the traffic demand for each source-destination pairs, with the objective of maximizing the total achievedthroughput of the network. We also propose a simple, but effective Loadaware Channel Assignment and Link Scheduling (LoCALS), a polynomiallybound heuristic algorithm for CA and LS. We show that LoCALSperforms on par with the optimal solution. Finally, we compare LoCALSwith a distributed channel assignment algorithm which is unaware of thetraffic demand, in order to demonstrate the importance of consideringthe traffic demand for CA and LS.