IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v8y2012i10p438090.html
   My bibliography  Save this article

Cooperative Group Localization Based on Factor Graph for Next-Generation Networks

Author

Listed:
  • Xuefei Zhang
  • Qimei Cui
  • Yulong Shi
  • Xiaofeng Tao

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.

Suggested Citation

  • Xuefei Zhang & Qimei Cui & Yulong Shi & Xiaofeng Tao, 2012. "Cooperative Group Localization Based on Factor Graph for Next-Generation Networks," International Journal of Distributed Sensor Networks, , vol. 8(10), pages 438090-4380, October.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:10:p:438090
    DOI: 10.1155/2012/438090
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/438090
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/438090?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:8:y:2012:i:10:p:438090. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.