The authors: Leila Ben Saad, Thilina Weerasinghe and Baltasar Beferull-Lozano
Graph filters, which are considered as the workhorses of graph signal analysis in the emerging field of signal processing on graphs, are useful for many applications such as distributed estimation in wireless sensor networks. Many of these tasks are based on basic distributed operators such as consensus, which are carried out by sensor devices under limited energy supply. To cope with the energy constraints, this paper focuses on designing the network topology in order to maximize the network lifetime when applying graph filters. None of the existing works in the literature have studied such problem when graph filters are used. The problem is a complex combinatorial problem and in this work, we propose two efficient heuristic algorithms for solving it. We show by simulations that they provide good performance and increase significantly the network lifetime.