Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Multicast routing extensions for OSPF
Communications of the ACM
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth 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
Graph Algorithms
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
Energy-efficient multicast with directional antennae and localized tree reconfiguration
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Interference-aware multicasting in wireless mesh networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Multicast routing in multi-radio multi-channel wireless mesh networks
IEEE Transactions on Wireless Communications
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved heuristics for multicast routing in wireless mesh networks
Wireless Networks
| Hi-index | 0.00 |
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner tree problem, and it has been widely studied before. We demonstrate in this paper, that for multihop wireless mesh networks, a Steiner tree does not offer the minimal bandwidth consumption, because it neglects the wireless multicat advantage. Thus, we re-formulate the problem in terms of minimizing the numbrer of transmissions, rather than the edge cost of multicast trees. We show that the new problem is also NP-complete and we propose heuristics to compute good approximations for such bandwidth-optimal trees. Our simulation results show that the proposed heuristics offer a lower bandwidth consumption compared with Steiner trees.