Learn More
Carrier Sense Multiple Access protocols are the most widely used methods for collision avoidance in Wireless Sensor Networks (WSNs). These protocols are prone to suffer from the hidden and exposed terminal problems, which lead to inefficiency and unfairness in the communications. Both problems are particularly significant in applications with massive(More)
—In this paper, we consider the problem of improving the convergence speed of an average consensus gossip algorithm by sparsifying a sufficiently dense network graph. Thus, instead of adding links, as usually proposed in the literature, or globally optimizing the mixing matrix of the gossip algorithm for a given network, which requires global knowledge at(More)
The average consensus is part of a family of algorithms that are able to compute global statistics by only using local data. This capability makes these algorithms interesting for applications in which these distributed philosophy is necessary. However, its iterative nature usually leads to a large power consumption due to the repetitive communications(More)
An essential process in a Wireless Sensor Network is the noise mitigation of the measured data, by exploiting their spatial correlation. A widely used technique to achieve this reduction is to project the measured data into a proper subspace. We present a low complexity and distributed algorithm to perform this projection. Unlike other algorithms existing(More)
Wireless Sensor Networks constitute a recent technology where the nodes cooperate to obtain, in a totally distributed way, certain function of the sensed data. One example is the average consensus algorithm, which allows every node to converge to the global average. However, this algorithm presents two major drawbacks in practice. The first one is that(More)
The average consensus algorithm is a well known distributed process in which the nodes iteratively communicate with the nodes within their communication range in order to obtain an estimation of the global average. These repeated communications, when performed in a uniformly randomly deployed network, such as a Wireless Sensor Network, lead to several nodes(More)
Wireless Sensor Networks are a recent technology where the nodes cooperate to obtain, in a totally distributed way, certain function of the collected data. An important example of these distributed processes is the average gossip algorithm, which allows the nodes to obtain the global average by only using local data exchanges. This process is traditionally(More)
Consensus algorithms are simple processes that involve repeated communications between the nodes of the network until a consensus is reached with certain accuracy. In this setting, the lifetime of the network and the total required energy not only depend on the number of iterations needed to achieve consensus, but also on the power consumption per node and(More)
Consensus algorithms are a family of distributed processes that are based on exchanging local information in order to obtain some particular global information. An example of these algorithms is the average consensus, in which the value to be obtained is the average of some initial data. Most of the existing consensus techniques assume unrealistic models of(More)