Sciweavers

191 search results - page 3 / 39
» Time Efficient Gossiping in Known Radio Networks
Sort
View
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 7 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
PODC
2006
ACM
14 years 28 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
IMCSIT
2010
13 years 4 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
DCOSS
2006
Springer
13 years 10 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
DCOSS
2006
Springer
13 years 10 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni