— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
—The need to monitor groups of mobile entities arises in many application contexts. Examples include the study of the social behavior of humans and wildlife, the shepherding of l...
—We study target tracking with wireless binary sensor networks, in which each sensor can return only 1-bit information regarding target’s presence or absence in its sending ran...
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...