DocumentCode
3070523
Title
Channel assignment in multi-radio wireless mesh networks : A graph-theoretic approach
Author
Sridhar, Srikrishna ; GUO, Jun ; Sanjay Jha
Author_Institution
Comput. Sci. & Inf. Syst., Birla Inst. of Technol. & Sci. (BITS), Pilani
fYear
2009
fDate
5-10 Jan. 2009
Firstpage
1
Lastpage
10
Abstract
In this paper, we propose a load-based scheme for assigning channels to radio interfaces in multi-radio, multi-channel wireless mesh networks. We first construct a model for channel assignment as an optimization problem with the goal of minimizing the overall network interference. The problem is proven to be NP-Hard. We then apply the Lagrangian relaxation method to obtain lower bounds as well as near-optimal feasible solutions for large size networks. We further present a meta-heuristic based on genetic algorithms, which can yield good quality solutions for very large networks. With these two centralized approaches as the benchmark, we propose a fully distributed algorithm in order to tackle the channel assignment problem practically. Our extensive simulation experiments demonstrate that the distributed algorithm performs competitively and can serve as a practical and scalable solution to the channel assignment problem.
Keywords
channel allocation; graph theory; radio access networks; Lagrangian relaxation method; channel assignment; graph-theoretic approach; multi-radio wireless mesh networks; radio interfaces; Bandwidth; Computer science; Distributed algorithms; Interference; Lagrangian functions; Relaxation methods; Routing; Telecommunication traffic; Throughput; Wireless mesh networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Systems and Networks and Workshops, 2009. COMSNETS 2009. First International
Conference_Location
Bangalore
Print_ISBN
978-1-4244-2912-7
Electronic_ISBN
978-1-4244-2913-4
Type
conf
DOI
10.1109/COMSNETS.2009.4808856
Filename
4808856
Link To Document