By Topic

Solve tree setup-break problem and minimize control overhead in delay-bounded distributed wireless multicast QoS routing

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

3 Author(s)
Ying-Hsin Liang ; Dept. of Comput. Sci. & Inf. Eng., Nan Kai Univ. of Technol., Nantou, Taiwan ; Ben-Jye Chang ; Yan-Min Lin

In wireless networks, the multicast QoS routing is a key technique to increase bandwidth utilization, but the multicast routing is typically complicated and difficult because it belongs to the NP-complete problem. The main goal of a delay-bounded wireless multicast algorithm is to determine the optimal multicast tree that has the least cost while satisfying the delay-bounded requirement. However, previous studies suffer from the Tree setup-break and dangling node problems, and yield a large number of control messages. This paper thus proposes the adaptive distributed multicast routing (ADMR) algorithm to guarantee cycle-free, and to overcome these two problems while yielding the least-cost delay-bounded multicast tree for high-density member multicast networks. Numerical results indicate that ADMR significantly outperforms the Jia-based algorithms in number of control messages and setup convergent time.

Published in:

Quality of Service (IWQoS), 2011 IEEE 19th International Workshop on

Date of Conference:

6-7 June 2011