An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Algorithms of Ant System and Simulated Annealing for the p-median Problem
Automation and Remote Control
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
QoS-driven multicast tree generation using Tabu search
Computer Communications
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
On channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.