Cooperative Detection-Assisted Localization in Wireless Networks in the Presence of Ranging Outliers

Location-aware wireless networks can provide precise location information in harsh environments, however, which is only possible when all nodes are well-functioning. In this paper, we propose algorithms and analyze the performance limits for both non-cooperative and cooperative localization networks...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 65; no. 12; pp. 5165 - 5179
Main Authors Xiong, Yifeng, Wu, Nan, Wang, Hua, Kuang, Jingming
Format Journal Article
LanguageEnglish
Published New York IEEE 01.12.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Algorithms
Computer simulation
Cooperative detection
Cramér–Rao lower bound (CRLB)
Data analysis
Distance measurement
Global Positioning System
Inspection
Linear programming
Localization
location-aware wireless network
Lower bounds
Message passing
Outliers (statistics)
Product development
ranging outlier
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:Location-aware wireless networks can provide precise location information in harsh environments, however, which is only possible when all nodes are well-functioning. In this paper, we propose algorithms and analyze the performance limits for both non-cooperative and cooperative localization networks in the presence of ranging outliers. Especially, we show that the localization performance can be boosted by using the cooperative outlier detection scheme. An algorithm based on expectation-maximization is proposed for non-cooperative localization networks, while a variational message passing-based algorithm is proposed for the cooperative counterparts. Performance limits are investigated using Cramér-Rao lower bound. Further inspection on the performance limits confirms the performance gain from the cooperative detection scheme. Stochastic geometric analysis is also carried out to account for the stochastic nature of wireless networks, as well as to provide simpler expressions and additional insights. Simulation results corroborate the analytical results, and show that both of the proposed algorithms are capable of attaining the corresponding performance limits at a significantly reduced computational cost compared with existing algorithms.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2017.2744641