Sciweavers

78 search results - page 1 / 16
» A Randomized Algorithm for Gossiping in Radio Networks
Sort
View
COCOON
2001
Springer
13 years 9 months ago
A Randomized Algorithm for Gossiping in Radio Networks
Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
SAGA
2007
Springer
13 years 11 months ago
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
Artur Czumaj, Xin Wang
TSP
2008
100views more  TSP 2008»
13 years 4 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
SIROCCO
2004
13 years 6 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 4 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....