By Topic

R-CA: A Routing-Based Dynamic Channel Assignment Algorithm in Wireless 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
$31 $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

5 Author(s)
Weifeng Sun ; Sch. of Software, Dalian Univ. of Technol., Dalian, China ; Rong Cong ; Feng Xia ; Xiao Chen
more authors

Even though channel assignment has been studied for years, most IEEE 802.11-based multi-hop wireless networks such as WSN, WMN, MANET are limited by channel interference. Properly assigning orthogonal channels to wireless links can improve the throughput of multi-hop network. To solve the dynamic channel assignment problem, a routing-based channel assignment algorithm R-CA is proposed. R-CA can allocate channels for wireless nodes when they need communication and free channels after data transmission. Limited channel resources can be taken advantage of by more wireless nodes. Simulations are done and the results show that this channel allocation strategy can effectively ensure and enhance the network throughput and packet delivery rate.

Published in:

Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing (UIC/ATC), 2010 7th International Conference on

Date of Conference:

26-29 Oct. 2010