Close category search window
 

The study of interference-free multicast using non-orthogonal channels for multi-radio and multi-channel 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)
Wen-Lin Yang ; Dept. of Comput. & Inf. Eng., Nat. Univ. of Tainan, Tainan, Taiwan ; Wei-Tsung Huang

Considering a video/audio server deployed on the gateway node of a wireless mesh network, a large amount of clients distributed on various mesh routers may wish to receive multimedia streams from the server simultaneously. A multicast tree would be a suitable mechanism to deliver subscribed streams to all the destinations. For multi-radio and multi-channel wireless networks, however, it is better to allocate interference-free channels to the multicast tree to improve the quality of multimedia streams transmitted. Instead of only orthogonal channels considered for the multicast tree in the previous works, all the available channels are used for multicast in this study. As a result, the number of links successfully allocated channels should be much more than the method that only orthogonal channels are considered. In addition, the number of stream subscribers are increased. Hence, the goal of this study is to find an interference-free multicast tree that can lead to the maximal number of serviced subscribers. This problem is referred as the MR2 problem. To solve the problem, we present two heuristic algorithms that can efficiently construct multicast trees, which are then processed by a load-based DFS channel assignment procedure to allocate interference-free channels to the links. A set of experiments is also designed to do performance and delay comparisons for the multicast trees generated by the approximation algorithms proposed in this study.

Published in:
Computer Symposium (ICS), 2010 International

Date of Conference: 16-18 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.