A novel channel assignment algorithm based on topology simplification in multi-radio wirelesss mesh networks
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629411
null Leiming Xu , Dept. of Comput. Sci.&Technol., Tsinghua Univ., Beijing, China
null Yong Xiang , Dept. of Comput. Sci.&Technol., Tsinghua Univ., Beijing, China
null Meilin Shi , Dept. of Comput. Sci.&Technol., Tsinghua Univ., Beijing, China
By equipping each node with multiple radio interfaces, multi-channels can be utilized to improve performance of wireless mesh networks. How to assign wireless channels to interfaces to avoid collisions extremely while the network keeps a good topology is a key problem for multi-radio wireless mesh networks. We reexamine the general requirements of this problem and propose an algorithm to solve it effectively and efficiently. We regard it as a particular edge coloring problem, and propose a strategy of two steps: edge grouping and coloring edge groups. A heuristic algorithm is proposed to solve the coloring problem for edge groups. And, in order to obtain a good edge grouping, we combine topology simplification techniques with edge grouping so as to make this problem simplified. Some results demonstrate the effectiveness of our algorithms and simulations show that both flooding traffic and unicast traffic get substantial performance gains by channel assignment.
unicast traffic, channel assignment algorithm, topology simplification, multiradio wirelesss mesh network, multiple radio interfaces, wireless channel, collision avoidance, edge coloring problem, heuristic algorithm, flooding traffic
n. Yong Xiang, n. Meilin Shi and n. Leiming Xu, "A novel channel assignment algorithm based on topology simplification in multi-radio wirelesss mesh networks," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2006, pp. 33.