DocumentCode
475762
Title
Distributed Channel Assignment Algorithm for Multi-channel Wireless Mesh Networks
Author
Wanli, Dong ; Kun, Bi ; Lei, Zhang
Author_Institution
Sch. of Comput. Sci. & Technol., Southwest Univ. of Sci. & Technol., Mianyang
Volume
2
fYear
2008
fDate
3-4 Aug. 2008
Firstpage
444
Lastpage
448
Abstract
In multi-channel wireless mesh networks, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we consider the channel assignment problem for multi-hop wireless mesh networks in which nodes have multiple interfaces. Given the number of interfaces at each node and available channels in the system, we find a feasible channel assignment to improve network performance. We resolve the channel assignment problem by introducing maximal clique in link conflict graph, which uses greedy algorithm to assign channel in a distributed manner while maintaining network connectivity. Simulation results show that ours algorithm significantly improves network performance in terms of throughput and is comparable to the best prior centralized scheme that jointly considers routing and channel assignment.
Keywords
channel allocation; graph theory; telecommunication network routing; wireless channels; available orthogonal channels; distributed channel assignment algorithm; greedy algorithm; interference; link conflict graph; maximal clique; multichannel wireless mesh networks; multiple interfaces; network connectivity; network performance; network routing; Computer networks; Computer science; Frequency; Greedy algorithms; Interference; Network topology; Routing; Switches; Throughput; Wireless mesh networks; Clique; Link Conflict Graph; Multi-channel; Wireless Mesh Networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on
Conference_Location
Guangzhou
Print_ISBN
978-0-7695-3290-5
Type
conf
DOI
10.1109/CCCM.2008.304
Filename
4609724
Link To Document