Sciweavers

278 search results - page 12 / 56
» Building Dynamic Multicast Trees in Mobile Networks
Sort
View
INFOCOM
1999
IEEE
14 years 5 hour ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
INFOCOM
1996
IEEE
13 years 12 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
JCIT
2008
129views more  JCIT 2008»
13 years 7 months ago
An Enhanced tree based MAODV Protocol for MANETs using Genetic Algorithm
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
E. Baburaj, V. Vasudevan
COMCOM
2006
101views more  COMCOM 2006»
13 years 7 months ago
A combined group/tree approach for scalable many-to-many reliable multicast
Abstract--In this paper we present the design, implementation, and performance analysis of Group-Aided Multicast (GAM), a scalable many-tomany reliable multicast transport protocol...
Wonyong Yoon, Dongman Lee, Hee Yong Youn, Seung-Ik...
MOBIHOC
2000
ACM
14 years 2 days ago
Content based multicast (CBM) in ad hoc networks
Abstract— This paper presents a radically new multicast model for ad hoc wireless networks. In this model, the content of the multicast data determines the receiver set for the d...
Hu Zhou, Suresh Singh