FG-Based Cooperative Group Localization for Next-Generation Communication Networks

In restricted communication environment, multiple-target localization is of important practical significance. So the cooperative group localization (CGL) was firstly put forward, which has been verified the effectiveness on localization performance gain and simultaneous multiple-target localization in ill conditions. However, it exists 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. This paper firstly proposes a novel FG-based CGL algorithm. Numerical results indicate that compared with the existing CGL algorithm, the proposed algorithm not only performs better in relaxing CGL topology requirement, but also enjoys high localization accuracy under low complexity.