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
Caching policy design and cache allocation in active reliable multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reconsidering wireless systems with multiple radios
ACM SIGCOMM Computer Communication Review
Approximating Optimal Multicast Trees in Wireless Multihop Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Joint access point placement and channel assignment for 802.11 wireless LANs
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks
IEEE Transactions on Circuits and Systems for Video Technology
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Journal of Network and Computer Applications
Hi-index | 0.00 |
We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-to-multipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time.