Sciweavers

78 search results - page 2 / 16
» A Randomized Algorithm for Gossiping in Radio Networks
Sort
View
CAAN
2006
Springer
13 years 9 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
ICASSP
2009
IEEE
14 years 6 days ago
The speed of greed: Characterizing myopic gossip through network voracity
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 5 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
WDAG
2007
Springer
90views Algorithms» more  WDAG 2007»
13 years 11 months ago
Gossiping in a Multi-channel Radio Network
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calv...
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
13 years 10 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin