No abstract

A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that asymptotically converges to the desired projection. In contrast, the present paper develops methods that produce these projections in a finite and approximately minimal number of iterations. Building upon tools from graph signal processing, the problem is cast as the design of a graph filter which, in turn, is reduced to the design of a suitable graph shift operator. Exploiting the eigenstructure of the projection and shift matrices leads to an objective whose minimization yields approximately minimum-order graph filters. To cope with the fact that this problem is not convex, the present work introduces a novel convex relaxation of the number of distinct eigenvalues of a matrix based on the nuclear norm of a Kronecker difference. To tackle the case where there exists no graph filter capable of implementing a certain subspace projection with a given network topology, a second optimization criterion is presented to approximate the desired projection while trading the number of iterations for approximation error. Two algorithms are proposed to optimize the aforementioned criteria based on the alternating-direction method of multipliers. An exhaustive simulation study demonstrates that the obtained filters can effectively obtain subspace projections markedly faster than existing algorithms.

A great number of applications in wireless sensor networks involve projecting a vector of observations onto a subspace dictated by prior information. Accomplishing such a task in a centralized fashion entails great power consumption, congestion at certain nodes, and suffers from robustness issues. A sensible alternative is to compute such projections in a decentralized fashion. To this end, recent works proposed schemes based on graph filters, which compute projections exactly with a finite number of local exchanges among sensor nodes. However, existing methods to obtain these filters are confined to reduced families of projection matrices or small networks. This paper proposes a method that can accommodate large networks and find suitable shift matrices in a much wider range of scenarios. Numerical experiments support the performance of the proposed algorithm.

Abstract-Interference is a key bottleneck in wireless communication systems. Interference alignment is a management technique that align interference from other transmitters in the least possibly dimension subspace at each receiver and provides the remaining dimensions for free interference signal. An uncoordinated interference is an example of interference which cannot be aligned coordinately with interference from coordinated part; consequently, the performance of interference alignment approaches are degraded. In this paper, we propose a rank minimization method to enhance the performance of interference alignment in the presence of uncoordinated interference sources. Firstly, to obtain higher multiplexing gain, a new rank minimization based optimization problem is proposed; then, a new class of convex relaxation is introduced which can reduce the optimal value of the problem and obtain lower rank solutions by expanding the feasibility set. Simulation results show that our proposed method can obtain considerably higher multiplexing gain and sum rate than other approaches in the interference alignment framework.

No abstract