Algorithms for Bandwidth Efficient Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks

Traditional multicast routing algorithms such as Shortest Path Tree (SPT) and 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). The authors propose multicast routing algorithms that take 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 algorithms 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.

Provided by: York University Topic: Mobility Date Added: Jan 2011 Format: PDF

Find By Topic