Energy Efficient Consensus Over Directed Graphs

Abstract

Consensus algorithms are iterative methods that represent a basic building block to achieve superior functionalities in increasingly complex sensor networks by facilitating the implementation of many signal-processing tasks in a distributed manner. Due to the heterogeneity of the devices, which may present very different capabilities (e.g. energy supply, transmission range), the energy often becomes a scarce resource and the communications turn into directed. To maximize the network lifetime, a magnitude that in this work measures the number of consensus processes that can be executed before the first node in the network runs out of battery, we propose a topology optimization methodology for directed networks. Numerical results corroborate the merits of this work.

Energy Efficient Consensus Over Directed Graphs