By Topic

A novel channel assignment algorithm based on topology simplification in multi-radio wirelesss mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Leiming Xu ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Yong Xiang ; Meilin Shi

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

Published in:

2006 IEEE International Performance Computing and Communications Conference

Date of Conference:

10-12 April 2006