Target Localization Algorithm of Wireless Sensor Network Based on Fast Orthogonal Matching Pursuit in

Abstract

Efficient localization of multiple targets is one of the basic technical problems in wireless sensor networks (WSN). The traditional sparse representation method based on greedy class is not efficient in multi-target positioning. Aiming at this problem, a multi-target localization algorithm based on QR decomposition for fast orthogonal matching pursuit is proposed. The algorithm meshes the wireless sensor coverage area to design an over-complete dictionary, which transforms the multi-target localization problem into a sparse signal recovery problem. The method utilizes the sensor to receive the sparse characteristics of the target signal strength, and then uses fast orthogonal matching pursuit to recover the measured values, thereby localization the target by sparsity. Through the QR decomposition of the column full rank matrix, the recursive form is used to invert the sub-dictionary matrix, thus avoiding the direct inversion of the matrix in the traditional method, so that the computational complexity is greatly reduced. The simulation results show that compared with the traditional orthogonal matching pursuit compressed sensing reconstruction method, this method does not lose the localization accuracy and improves the computational efficiency.

Keywords

• wireless sensor networks
• received signal strength
• fast orthogonal matching pursuit
• column full rank matrix qr decomposition
• target localization