Abstract
ABSTRACTMultiple 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transactions on Emerging Telecommunications Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.