Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Wireless Communications
Heuristic algorithms for minimum bandwith consumption multicast routing in wireless mesh networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
An incentive-based fairness mechanism for multi-hop wireless backhaul networks with selfish nodes
IEEE Transactions on Wireless Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
On Routing in Multichannel Wireless Mesh Networks: Challenges and Solutions
IEEE Network: The Magazine of Global Internetworking
Journal of Systems and Software
Wireless Personal Communications: An International Journal
Computers and Electrical Engineering
| Hi-index | 0.01 |
In this paper, we tackle the multicast problem with the consideration of the interference between multicast trees in multi-radio multi-channel wireless mesh networks (MR-MC WMNs). We consider a dynamic traffic model, i.e., multicast session requests arrive dynamically without any prior knowledge of future requests. Each node in the network acts as a Transit Access Point (TAP), and has one or multiple radios tuned to non-overlapping channels. We prove that in MRMC WMNs, the minimum cost multicast tree (MCMT) problem, i.e., finding the multicast tree with minimum transmission cost, is NP-hard. We then formulate the problem by an Integer Linear Programming (ILP) model to solve it optimally, and propose a polynomialtime near-optimal algorithm, called Wireless Closest Terminal Branching (WCTB), for the MCMT problem. To alleviate the interference between multicast trees (sessions), we present a polynomial-time algorithm that computes the minimum interference minimum cost path in MR-MC WMNs, and integrate it into WCTB without altering the performance bound of WCTB on the tree cost. The experimental study shows that the tree cost produced by WCTB is very close to the optimal and that the proposed algorithm for interference alleviation is effective. To the best of our knowledge, this is the first paper that studies the MCMT problem in MR-MC WMNs.