Related papers: Sensor Networks with Random Links: Topology Design…
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…
In this work, we consider the usage of wireless sensor networks (WSN) to monitor an area of interest, in order to diagnose on real time its state. Each sensor node forwards information about relevant features towards the sink where the data…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a…
In this article we consider the problems of distributed detection and estimation in wireless sensor networks. In the first part, we provide a general framework aimed to show how an efficient design of a sensor network requires a joint…
We consider the problems of reaching average consensus and solving consensus-based optimization over unreliable communication networks wherein packets may be dropped accidentally during transmission. Existing work either assumes that the…
In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in…
Consensus networks are widely deployed in numerous civil and industrial applications. However, the process of reaching a common consensus among nodes can unintentionally reveal the network's topology to external observers by appropriate…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
In this paper, we consider consensus problems over a network of nodes, where the network is divided into a number of clusters. We are interested in the case where the communication topology within each cluster is dense as compared to the…
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve…
This paper presents a framework to evaluate the probability that a decision error event occurs in wireless sensor networks, including sensing and communication errors. We consider a scenario where sensors need to identify whether a given…
In this paper, we study the robust consensus problem for a set of discrete-time linear agents to coordinate over an uncertain communication network, which is to achieve consensus against the transmission errors and noises resulted from the…
Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communication is controlled by an oblivious message adversary. The…
In this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase…
We investigate how the graph topology influences the robustness to noise in undirected linear consensus networks. We measure the structural robustness by using the smallest possible value of steady state population variance of states under…
We focus on designing Peer-to-Peer (P2P) networks that enable efficient communication. Over the last two decades, there has been substantial algorithmic research on distributed protocols for building P2P networks with various desirable…
In this paper, we study the distributed control of networked cyber-physical systems when a much more energy-efficient distributed communication management strategy is proposed to solve the well-studied consensus problem. In contrast to the…
The dominant dynamics of sensor networks consist of using the energy of the sensor nodes to create the topology of hierarchical clustering using topology control protocols. The topology thus created will always have optimum number of nodes…
The purpose of this short paper is to provide a theoretical analysis for the consensus problem under nonlinear protocols. A main contribution of this work is to generalize the previous consensus problems under nonlinear protocols for…