z-logo
Premium
Joint routing and channel assignment algorithms in cognitive wireless mesh networks
Author(s) -
Zhang Guoan,
Gu Jinyuan,
Bao Zhihua,
Xu Chen,
Zhang Shibing
Publication year - 2014
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2560
Subject(s) - wireless mesh network , computer science , channel allocation schemes , channel (broadcasting) , algorithm , computer network , throughput , interference (communication) , order one network protocol , wireless network , wireless , telecommunications
Multiple channels can increase network capacity by transmitting traffic on different channels in an interference area. To resolve the channel interference problem in cognitive wireless mesh networks, first, a new channel assignment algorithm based on hierarchy interference model for the cognitive wireless mesh networks is proposed in this paper. Second, a distributed capacity and interference based channel assignment and routing algorithm is proposed. Third, an efficient channel diversity based channel allocation algorithm is proposed. The main purpose of this channel allocation algorithm is to maintain the channel diversity in the neighborhood channels. Fourth, a novel joint multi‐path routing and channel assignment algorithm based on path crossing is proposed. On the basis of simulations, results show that compared with the link‐based channel allocation algorithm in wireless multi‐channel networks, the new four algorithms have an obvious advantage in the performance of delay and throughput, and the performance of the joint multi‐path routing and channel assignment algorithm is the best. Lastly, a channel merging algorithm is also proposed in the channel constrained situation. Simulation results also show that, after the implementation of the channel merging algorithm, the network average throughput and delay performance have been further improved significantly. Copyright © 2012 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here