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). We propose multicast routing algorithms that take...

Full description

Saved in:
Bibliographic Details
Main Authors: Hoang Lan Nguyen, Uyen Trang Nguyen
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Delay
Routing
Throughput
Vegetation
Wireless communication
Wireless mesh networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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). We 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.
ISSN:1525-3511
1558-2612
DOI:10.1109/WCNC.2011.5779286