Sciweavers

3809 search results - page 519 / 762
» Randomized Broadcast in Networks
Sort
View
PERCOM
2006
ACM
16 years 5 months ago
A Collusion Attack on Pairwise Key Predistribution Schemes for Distributed Sensor Networks
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback ...
Tyler Moore
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 2 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
ICS
2010
Tsinghua U.
16 years 2 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ICDCS
2009
IEEE
16 years 2 months ago
CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks
Clustering and aggregation inherently increase wireless sensor network (WSN) lifetime by collecting information within a cluster at a cluster head, reducing the amount of data thr...
Anna Förster, Amy L. Murphy
COMPLEX
2009
Springer
15 years 12 months ago
Epidemic Self-synchronization in Complex Networks
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
Ingo Scholtes, Jean Botev, Markus Esch, Peter Stur...