By Topic

Efficient Algorithm for Reducing Delay Variation on Delay-Bounded Multicast Trees in Heterogeneous 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
$33 $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)
Soobeen Ahn ; Sungkyunkwan Univ., Seoul ; Moonseong Kim ; Hyunseung Choo

This paper investigates the construction of a multicast tree satisfying Quality of Service (QoS) real-time group communication in a heterogeneous network comprising multiple Mobile Ad-hoc NETworks (MANETs) attached to the backbone Internet. The main objective of our work is to optimize the Delay- and delay Variation Bounded Multicast Tree (DVBMT) problem, which has been proved to be NP-complete. This problem has to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The well-known algorithms solved this problem are the DVMA, the DDVCA, the Cheng's algorithm, and so on. In this paper, we propose an algorithm that outperforms other algorithms in terms of the multicast delay variation in the realistic network environment. The enhancement increases to approximately 3.7%~ 32.9% in terms of that. The time complexity of the proposed algorithm is O(mn2), which is comparable to that of DDVCA.

Published in:

2008 IEEE Wireless Communications and Networking Conference

Date of Conference:

March 31 2008-April 3 2008