Close category search window
 

High-Performance Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hoang Lan Nguyen ; Dept. of Comput. Sci. & Eng., York Univ., Toronto, ON, Canada ; Uyen Trang Nguyen

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.

Published in:
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference: 6-10 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.