Designing Asymmetric Shift Operators for Decentralized Subspace Projection

Abstract: A large number of applications in wireless sensor networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes, and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Existing methods designed the graph filters for symmetric topologies. However, in this paper, the design of the graph shift operators to perform decentralized subspace projection for asymmetric topologies is studied.