Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Approximating Optimal Multicast Trees in Wireless Multihop Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Proceedings of the 11th annual international conference on Mobile computing and networking
Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Achieving True Video-on-Demand Service in Multi-Hop WiMax Mesh Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
A survey on wireless mesh networks
IEEE Communications Magazine
Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper, we investigate a problem concerning that a multimedia delivering system is deployed on a WMN in which a large amount of end-users may subscribe for receiving a video/audio stream from the video server simultaneously. For delivering the continuous stream without interference, a non-overlapping channel constrained multicast tree is then required to be determined. Due to the limited number of non-overlapping channels, we may have a situation that some links may not have channels allocated. As a result, some end-users may not receive the streams they have subscribed. That is, the resulting multicast tree may cover a subset of mesh routers where end-users can receive video streams successfully. Thus, our goal is to determine a partial multicast tree that can maximize the number of serviced end-users. The problem is referred as the multi-channel constrained multicasting (MCCM) problem. We propose an algorithm named LCMR for this problem. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches in terms of the number of serviced end-users.