Abstract
In ill-conditioned communication environment, multiple target localization is of important practical significance. The cooperative group localization (CGL) model was firstly put forward, which has verified the effectiveness of localization performance gain and simultaneous multiple target localization in ill conditions. However, there exist two inherent difficulties: the strict demand for CGL topology and the high complexity. By the rational use of information to relax restrictions on topology and by dividing the complex problem into some simple local ones, the factor graph (FG) together with the sum-product algorithm is a perfect candidate for the problems above. In order to solve the two problems, we propose the weighted FG-based CGL (WFG-CGL) algorithm which incorporates the optimal weights based on the information reliability. In order to further reduce the complexity, we propose the low-complexity FG-based CGL (LCFG-CGL) algorithm. The Cramer-Rao lower bound (CRLB) of the localization error in CGL is first derived. Theoretical analysis and numerical results indicate that the proposed algorithms not only perform better in relaxing CGL topology requirement, but also enjoy high localization accuracy under low complexity in comparison with the existing CGL algorithm.
Highlights
Wireless localization technologies, which are designated to estimate the position of a mobile terminal (MT), have drawn a lot of attention over the past few decades
Cramer-Rao lower bound (CRLB) results for localization, based on different types of internode measurements, can be found in [2, 3, 11,12,13,14,15]: the localization error is shown to depend on several elements, in particular on the measurement reliability and the topology of the network
The complexity of WFG-cooperative group localization (CGL) algorithm increases to some extent, it still performs with lower complexity than the traditional Taylor-series-based CGL algorithm
Summary
Wireless localization technologies, which are designated to estimate the position of a mobile terminal (MT), have drawn a lot of attention over the past few decades. The parameter measurements may be corrupted by non-line-ofsight (NLOS) error, or MT can not simultaneously connect with three BSs [9, 16] These ill conditions with insufficient signal resources can make the accurate localization unrealistic. A weighted FG-based CGL algorithm (WFG-CGL) is proposed to effectively solve the above problems of strict demand for CGL topology and high complexity in the ill condition. It enhances the accuracy by adopting the different information reliability of BSs and MTs into its formulation. Numerical simulation results verify that compared to the existing CGL method, the proposed algorithms can relax CGL topology requirement and provide the high localization accuracy under low complexity.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
