Full text
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (478kB) | Preview |
Béjar Haro, Benjamín and Zazo Bello, Santiago (2012). A practical approach for outdoors distributed target localization in wireless sensor networks. "Eurasip Journal on Advances in Signal Processing", v. 2012 (n. 95); pp. 1-11. ISSN 1687-6180. https://doi.org/10.1186/1687-6180-2012-95.
Title: | A practical approach for outdoors distributed target localization in wireless sensor networks |
---|---|
Author/s: |
|
Item Type: | Article |
Título de Revista/Publicación: | Eurasip Journal on Advances in Signal Processing |
Date: | May 2012 |
ISSN: | 1687-6180 |
Volume: | 2012 |
Subjects: | |
Faculty: | E.T.S.I. Telecomunicación (UPM) |
Department: | Señales, Sistemas y Radiocomunicaciones |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (478kB) | Preview |
Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate.
Item ID: | 16779 |
---|---|
DC Identifier: | https://oa.upm.es/16779/ |
OAI Identifier: | oai:oa.upm.es:16779 |
DOI: | 10.1186/1687-6180-2012-95 |
Official URL: | http://asp.eurasipjournals.com/content/2012/1/95 |
Deposited by: | Memoria Investigacion |
Deposited on: | 07 Aug 2013 15:48 |
Last Modified: | 21 Apr 2016 17:08 |