Adaptive source location estimation based on compressed sensing in wireless sensor networks

11Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Source localization is an important problem in wireless sensor networks (WSNs). An exciting state-of-the-art algorithm for this problem is maximum likelihood (ML), which has sufficient spatial samples and consumes much energy. In this paper, an effective method based on compressed sensing (CS) is proposed for multiple source locations in received signal strength-wireless sensor networks (RSS-WSNs). This algorithm models unknown multiple source positions as a sparse vector by constructing redundant dictionaries. Thus, source parameters, such as source positions and energy, can be estimated by 1 -norm minimization. To speed up the algorithm, an effective construction of multiresolution dictionary is introduced. Furthermore, to improve the capacity of resolving two sources that are close to each other, the adaptive dictionary refinement and the optimization of the redundant dictionary arrangement (RDA) are utilized. Compared to ML methods, such as alternating projection, the CS algorithm can improve the resolution of multiple sources and reduce spatial samples of WSNs. The simulations results demonstrate the performance of this algorithm. Copyright © 2012 Lei Liu et al.

Cite

CITATION STYLE

APA

Liu, L., Chong, J. S., Wang, X. Q., & Hong, W. (2012). Adaptive source location estimation based on compressed sensing in wireless sensor networks. International Journal of Distributed Sensor Networks, 2012. https://doi.org/10.1155/2012/592471

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free