Skip to main navigation Skip to search Skip to main content

Efficient algorithm for reducing delay variation on delay-bounded multicast trees in heterogeneous networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationWCNC 2008 - IEEE Wireless Communications and Networking Conference, Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2741-2746
Number of pages6
ISBN (Print)9781424419968
DOIs
StatePublished - 2008
EventIEEE Wireless Communications and Networking Conference, WCNC 2008 - Las Vegas, NV, United States
Duration: 31 Mar 20083 Apr 2008

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

ConferenceIEEE Wireless Communications and Networking Conference, WCNC 2008
Country/TerritoryUnited States
CityLas Vegas, NV
Period31/03/083/04/08

Keywords

  • Delay variation
  • Delay- and delay variation Bounded multicast tree (DVBMT) problem
  • End-toend delay
  • Heterogeneous networks
  • Multicast communication

Fingerprint

Dive into the research topics of 'Efficient algorithm for reducing delay variation on delay-bounded multicast trees in heterogeneous networks'. Together they form a unique fingerprint.

Cite this