Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/802
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorCheng, H-
dc.creatorCao, J-
dc.creatorWang, X-
dc.creatorMullai, S-
dc.date.accessioned2014-12-11T08:22:45Z-
dc.date.available2014-12-11T08:22:45Z-
dc.identifier.isbn0-7695-2423-0-
dc.identifier.urihttp://hdl.handle.net/10397/802-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.rights© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectAd hoc networksen_US
dc.subjectMobile radioen_US
dc.subjectMulticast communicationen_US
dc.subjectQuality of serviceen_US
dc.titleA heuristic multicast algorithm to support QoS group communications in heterogeneous networken_US
dc.typeConference Paperen_US
dcterms.abstractIn this paper, we study the problem of QoS group communication in a heterogeneous network, which consists of multiple MANETs attached to the backbone Internet. We propose a heuristic multicast algorithm called DDVMA (Delay and Delay Variation Multicast Algorithm). DDVMA is designed for solving the DVBMT (Delay- and delay Variation-Bounded Multicast Tree) problem [8], which has been proved to be NP-complete. It can find a multicast tree satisfying the multicast end-to-end delay constraint and minimizing the multicast delay variation. Two concepts- the proprietary second shortest path and partially proprietary second shortest path are introduced, which can help DDVMA achieve better performance in terms of the multicast delay variation than DDVCA (Delay and Delay Variation Constraint Algorithm) [7] that is known to be the most efficient so far. Theoretical analysis is given to show the correctness of DDVMA and simulations are performed to demonstrate the performance of DDVMA in terms of the multicast delay variation.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationQShine 2005 : 2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 24 Aug. 2005, Lake Vista, Florida, [p. 1-8] (CD-ROM)-
dcterms.issued2005-
dc.identifier.isiWOS:000235215200033-
dc.identifier.scopus2-s2.0-33845465141-
dc.identifier.rosgroupidr29408-
dc.description.ros2005-2006 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
heterogeneous-network_05.pdf244.44 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

107
Last Week
2
Last month
Citations as of Mar 24, 2024

Downloads

172
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Mar 22, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.