Topology Design to Increase Network Lifetime in WSN for Graph Filtering in Consensus Processes
Journal article, Peer reviewed
Accepted version
Permanent lenke
http://hdl.handle.net/11250/2492765Utgivelsesdato
2017Metadata
Vis full innførselSamlinger
Originalversjon
Paper presented at the 2017 25th European Signal Processing Conference (EUSIPCO)Sammendrag
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 and reduce the energy consumption when applying graph filters. 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 in terms of the network lifetime and the total energy consumption of the filtering process.