Node localization algorithm based on matrix pencil for wireless sensor network

Authors:
Chang Liu;Hong Jiang;De-Fa Wang
Affiliations:
College of Communication Engineering, Jilin University, Changchun, P.R.China;College of Communication Engineering, Jilin University, Changchun, P.R.China;College of Communication Engineering, Jilin University, Changchun, P.R.China
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 4
Cited 0

Critical delays and polynomial eigenvalue problems

Journal of Computational and Applied Mathematics
Unitary ESPRIT: how to obtain increased estimation accuracy with areduced computational burden

IEEE Transactions on Signal Processing
Localization systems for wireless sensor networks

IEEE Wireless Communications
Super-resolution TOA estimation with diversity for indoor geolocation

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor network (WSN) is a new way to collect and process information. The node localization is the basis for most WSN applications. As matrix pencil (MP) algorithm is a high-resolution method of parameter estimation, in this paper, we put forward a novel range-based node localization method for WSN, which combines MP algorithm, multilateral localization with Taylor algorithm or Chan algorithm. MP algorithm is used to estimate the time of arrival (TOA) of the signal from an unknown node to an anchor node. Compared with traditional localization methods, the proposed method has some key advantages, such as higher positioning accuracy, smaller computational amount, suppression over non-Gaussian noise, energy saving, faster executing, etc. In the simulation, we also study the impact of signal to noise ratio (SNR) and the number of nodes on positioning accuracy.