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

Sequential Uniformly Reweighted Sum-Product Algorithm for Cooperative Localization in Wireless Networks

Author

Listed:
  • Wei Li
  • Zhen Yang
  • Haifeng Hu

Abstract

Graphical models have been widely applied in solving distributed inference problems in wireless networks. In this paper, we formulate the cooperative localization problem in a mobile network as an inference problem on a factor graph. Using a sequential schedule of message updates, a sequential uniformly reweighted sum-product algorithm (SURW-SPA) is developed for mobile localization problems. The proposed algorithm combines the distributed nature of belief propagation (BP) with the improved performance of sequential tree-reweighted message passing (TRW-S) algorithm. We apply the SURW-SPA to cooperative localization in both static and mobile networks, and evaluate its performance in terms of localization accuracy and convergence speed.

Suggested Citation

  • Wei Li & Zhen Yang & Haifeng Hu, 2014. "Sequential Uniformly Reweighted Sum-Product Algorithm for Cooperative Localization in Wireless Networks," International Journal of Distributed Sensor Networks, , vol. 10(8), pages 164816-1648, August.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:8:p:164816
    DOI: 10.1155/2014/164816
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/164816
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/164816?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:10:y:2014:i:8:p:164816. 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.