TY - JOUR
T1 - Distributed algorithm for target localization in wireless sensor networks using RSS and AoA measurements
AU - Tomic, Slavisa
AU - Beko, Marko
AU - Dinis, Rui
AU - Montezuma de Carvalho, Paulo Miguel de Araújo Borges
N1 - Sem PDF.
Fundacao para a Ciencia e a Tecnologia (PEst-OE/EEI/UI0066/2014, UID/EEA/50008/2013)
Program Investigador FCT (IF/00325/2015)
PTDC/EEI-TEL/6308/2014- HAMLeT
FRH/BPD/108232/2015
SFRH/BD/91126/2012
PY - 2017/6
Y1 - 2017/6
N2 - This paper addresses target localization problem in a cooperative 3-D wireless sensor network (WSN). We employ a hybrid system that fuses distance and angle measurements, extracted from the received signal strength (RSS) and angle-of-arrival (AoA) information, respectively. Based on range measurement model and simple geometry, we derive a novel non-convex estimator based on the least squares (LS) criterion. The derived non-convex estimator tightly approximates the maximum likelihood (ML) one for small noise levels. We show that the developed non-convex estimator is suitable for distributed implementation, and that it can be transformed into a convex one by applying a second-order cone programming (SOCP) relaxation technique. We also show that the developed non-convex estimator can be transformed into a generalized trust region sub-problem (GTRS) framework, by following the squared range (SR) approach. The proposed SOCP algorithm for known transmit powers is then generalized to the case where the transmit powers are different and not known. Furthermore, we provide a detailed analysis of the computational complexity of the proposed algorithms. Our simulation results show that the new estimators have excellent performance in terms of the estimation accuracy and convergence, and they confirm the effectiveness of combining two radio measurements.
AB - This paper addresses target localization problem in a cooperative 3-D wireless sensor network (WSN). We employ a hybrid system that fuses distance and angle measurements, extracted from the received signal strength (RSS) and angle-of-arrival (AoA) information, respectively. Based on range measurement model and simple geometry, we derive a novel non-convex estimator based on the least squares (LS) criterion. The derived non-convex estimator tightly approximates the maximum likelihood (ML) one for small noise levels. We show that the developed non-convex estimator is suitable for distributed implementation, and that it can be transformed into a convex one by applying a second-order cone programming (SOCP) relaxation technique. We also show that the developed non-convex estimator can be transformed into a generalized trust region sub-problem (GTRS) framework, by following the squared range (SR) approach. The proposed SOCP algorithm for known transmit powers is then generalized to the case where the transmit powers are different and not known. Furthermore, we provide a detailed analysis of the computational complexity of the proposed algorithms. Our simulation results show that the new estimators have excellent performance in terms of the estimation accuracy and convergence, and they confirm the effectiveness of combining two radio measurements.
KW - Angle-of-arrival (AoA)
KW - Generalized trust region sub-problem (GTRS)
KW - Received signal strength (RSS)
KW - Second-order cone programming (SOCP)
KW - Wireless localization
KW - Wireless sensor network (WSN)
UR - http://www.scopus.com/inward/record.url?scp=84992402752&partnerID=8YFLogxK
U2 - 10.1016/j.pmcj.2016.09.013
DO - 10.1016/j.pmcj.2016.09.013
M3 - Article
AN - SCOPUS:84992402752
SN - 1574-1192
VL - 37
SP - 63
EP - 77
JO - Pervasive and Mobile Computing
JF - Pervasive and Mobile Computing
ER -