Sciweavers

830 search results - page 125 / 166
» Route kernels for trees
Sort
View
ADHOCNOW
2008
Springer
15 years 6 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
ADHOCNOW
2008
Springer
15 years 6 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
MSWIM
2006
ACM
15 years 5 months ago
An efficient multicast packet delivery scheme for UMTS
In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree top...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
ICN
2005
Springer
15 years 5 months ago
Optimizing Inter-domain Multicast Through DINloop with GMPLS
This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalized multiprotocol label switching) to overcome the scalability problems existing in current i...
Huaqun Guo, Lek Heng Ngoh, Wai-Choong Wong
INFOCOM
2003
IEEE
15 years 5 months ago
An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays
— Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general app...
Miguel Castro, Michael B. Jones, Anne-Marie Kermar...