Sciweavers

306 search results - page 57 / 62
» Routing Algorithms for Anycast Messages
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Oblivious parallel probabilistic channel utilization without control channels
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
Christian Schindelhauer
DBISP2P
2005
Springer
131views Database» more  DBISP2P 2005»
15 years 3 months ago
Symmetric Replication for Structured Peer-to-Peer Systems
Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions...
Ali Ghodsi, Luc Onana Alima, Seif Haridi
GC
2004
Springer
15 years 2 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
CIKM
2003
Springer
15 years 2 months ago
Content-based retrieval in hybrid peer-to-peer networks
Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network (“regional directory services”). Hybrid peer-to-peer architectures...
Jie Lu, James P. Callan
ECRTS
2007
IEEE
15 years 3 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher