Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection
Xabier Insausti, Fernando Camaro, Pedro M. Crespo, Baltasar Beferull‐Lozano, Jesús Gutiérrez-Gutiérrez · IEEE Journal of Selected Topics in Signal Processing · 2013
In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in convergence time and yielding a decrease in energy consumption as the density of the network increases, as compared to a separation scheme.