ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Exploiting partially overlapping channels in wireless networks: turning a peril into an advantage
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Channel assignment in multi-radio wireless mesh networks: a graph-theoretic approach
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Real-time multimedia computing
Multimedia Tools and Applications
Hi-index | 0.00 |
It is one key issue in the wireless mesh networks to provide various scenarios such as multimedia and applications. Links in the network can be organized and assigned to orthogonal channels so as to minimize the co-channel interference. In this paper we focus on the channel assignment problem for links in the mesh networks and aim at minimizing the overall network interference. The problem is proved to be NP-hard. We have first formulated an approach based on the Particle Swarm Optimization (PSO) algorithm which can be used to find the approximate optimized solution in small-size networks and as a baseline that other algorithms can be compared with. We also have proposed a centralized heuristic as well as a distributed heuristic algorithm for the channel assignment problem. Extensive simulation results have demonstrated that our schemes have good performance in both dense and sparse networks compared with related works.