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

Weight-Based Clustering Decision Fusion Algorithm for Distributed Target Detection in Wireless Sensor Networks

Author

Listed:
  • Haiping Huang
  • Lei Chen
  • Xiao Cao
  • Ruchuan Wang
  • Qianyi Wang

Abstract

We use a great deal of wireless sensor nodes to detect target signal that is more accurate than the traditional single radar detection method. Each local sensor detects the target signal in the region of interests and collects relevant data, and then it sends the respective data to the data fusion center (DFC) for aggregation processing and judgment making whether the target signal exists or not. However, the current judgment fusion rules such as Counting Rule (CR) and Clustering-Counting Rule (C-CR) have the characteristics on high energy consumption and low detection precision. Consequently, this paper proposes a novel Weight-based Clustering Decision Fusion Algorithm (W-CDFA) to detect target signal in wireless sensor network. It first introduces the clustering method based on tree structure to establish the precursor-successor relationships among the clusters in the region of interests and then fuses the decision data along the direction from the precursor clusters to the successor clusters gradually, and DFC (i.e., tree root) makes final determination by overall judgment values from subclusters and ordinary nodes. Simulation experiments show that the fusion rule can obtain more satisfactory system level performance at the environment of low signal to noise compared with CR and C-CR methods.

Suggested Citation

  • Haiping Huang & Lei Chen & Xiao Cao & Ruchuan Wang & Qianyi Wang, 2013. "Weight-Based Clustering Decision Fusion Algorithm for Distributed Target Detection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(3), pages 192675-1926, March.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:3:p:192675
    DOI: 10.1155/2013/192675
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/192675
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/192675?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:9:y:2013:i:3:p:192675. 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.