Abstract
Traditional multicast routing algorithms such as shortest path tree (SPT) and minimum Steiner tree (MST) do not consider the wireless broadcast advantage or the underlying channel assignments in a multi-channel multi-radio (MCMR) wireless mesh network (WMN). We propose a multicast routing algorithm for MCMR WMNs that takes into account the above factors in order to minimize the amount of network bandwidth consumed by a routing tree. Experimental results show that routing trees constructed by the proposed algorithm outperform traditional trees such as SPTs, MSTs and minimum number of forwarders trees (MFTs) with respect to packet delivery ratio, throughput and end-to-end delay.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
