We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
We propose a new interpretation of spiking neurons as Bayesian integrators accumulating evidence over time about events in the external world or the body, and communicating to oth...