SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
On-demand multicast routing protocol in multihop wireless mobile networks
Mobile Networks and Applications
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
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
On multicast routing in wireless mesh networks
Computer Communications
Probabilistically reliable on-demand multicast in wireless mesh networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
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
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky
IEEE Wireless Communications
Mathematical and Computer Modelling: An International Journal
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
Physarum optimization: a new heuristic algorithm to minimal exposure problem
Proceedings of the 18th annual international conference on Mobile computing and networking
Hi-index | 0.00 |
Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be to minimize number of transmissions to conserve bandwidth. The problem of computing multicast trees with minimal bandwidth consumption is similar to Steiner tree problem and has shown to be NP-complete. So, heuristic based algorithms are suitable to approximate such bandwidth optimal trees. This paper proposes a multicast routing protocol based on minimum number of transmission trees using an heuristic approach. The simulation results show that the proposed algorithm offers better performance over existing protocols, even in the worst-case scenario when the set of multicast receivers are sparsely distributed across the network.