Sciweavers

417 search results - page 8 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 1 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
NCA
2006
IEEE
14 years 1 months ago
SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks
Clustered sensor networks have been shown to increase system throughput, decrease system delay, and save energy. While those with rotating cluster heads, such as LEACH, have also ...
Leonardo B. Oliveira, Hao Chi Wong, Marshall W. Be...
DCOSS
2011
Springer
12 years 7 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
COLCOM
2007
IEEE
14 years 1 months ago
Cooperative security in distributed sensor networks
— Distributed sensor network protocols, such as routing, time synchronization or data aggregation protocols make use of collaborative techniques to minimize the consumption of sc...
Oscar García Morchon, Heribert Baldus, Tobi...