Sciweavers

52 search results - page 6 / 11
» Sparse Networks Tolerating Random Faults
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
TC
2008
13 years 7 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
ISPDC
2008
IEEE
14 years 2 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
IJSN
2007
96views more  IJSN 2007»
13 years 7 months ago
On pairwise connectivity of wireless multihop networks
This paper experimentally investigates the service availability of wireless multihop networks based on the following two metrics: average pairwise connectivity and pairwise connec...
Fangting Sun, Mark A. Shayman
CCS
2007
ACM
14 years 1 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik