Cesar Asensio-Marco

Learn 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)
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)
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)
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)