Sciweavers

11 search results - page 1 / 3
» On Efficiency Group Multicasting Algorithm with Multiple Min...
Sort
View
ICCS
2007
Springer
14 years 1 months ago
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees
Moonseong Kim, Minseok Kang, Hyunseung Choo, Jong ...
COR
2004
111views more  COR 2004»
13 years 7 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
INFOCOM
2010
IEEE
13 years 5 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
ICPPW
1999
IEEE
13 years 11 months ago
Building Dynamic Multicast Trees in Mobile Networks
As group applications become more prevalent, efficient network utilization becomes a major concern. Multicast transmission may use network bandwidth more efficiently than multiple...
Frank Adelstein, Golden G. Richard III, Loren Schw...
ICCNMC
2005
Springer
14 years 26 days ago
Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
Weijia Jia, Wanqing Tu, Jie Wu