Sciweavers

862 search results - page 143 / 173
» Random Information Spread in Networks
Sort
View
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
15 years 5 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
CN
2010
183views more  CN 2010»
14 years 12 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
TWC
2008
120views more  TWC 2008»
14 years 11 months ago
A cartel maintenance framework to enforce cooperation in wireless networks with selfish users
Abstract-- In distributed wireless networks without centralized control, each user is its own authority to maximize its own performance. This distributed characteristic provides th...
Zhu Han, Zhu Ji, K. J. Ray Liu
123
Voted
WWW
2011
ACM
14 years 6 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
84
Voted
MOBIHOC
2009
ACM
16 years 9 days ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu