Sciweavers

36 search results - page 4 / 8
» High Entropy Random Selection Protocols
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
14 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
CJ
2011
14 years 1 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
CN
2006
113views more  CN 2006»
14 years 9 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Failure recovery for structured P2P networks: protocol design and performance evaluation
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
SIGCOMM
2006
ACM
15 years 3 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica