An iterative algorithm for delay-constrained minimum-cost multicasting
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 and ISDN Systems
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
Journal of Network and Computer Applications
Efficient link-heterogeneous multicast for wireless mesh networks
Wireless Networks
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 |
This paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.