Sciweavers

830 search results - page 116 / 166
» Route kernels for trees
Sort
View
WCNC
2008
IEEE
15 years 12 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi
ICDCS
2002
IEEE
15 years 10 months ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
NGC
2001
Springer
196views Communications» more  NGC 2001»
15 years 10 months ago
Application-Level Multicast Using Content-Addressable Networks
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...
RTCSA
2000
IEEE
15 years 9 months ago
Efficient resource management for hard real-time communication over differentiated services architectures
We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly we...
Byung-Kyu Choi, Riccardo Bettati
NETWORKING
2007
15 years 6 months ago
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
Benoit Donnet, Bradley Huffaker, Timur Friedman, K...