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

An Optimized Strategy Coverage Control Algorithm for WSN

Author

Listed:
  • Zeyu Sun
  • Weiguo Wu
  • Huanzhao Wang
  • Heng Chen
  • Wei Wei

Abstract

The problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a relation mapping model of sensor nodes and target nodes is established by OSCC which is based on geometric figure and related theories, probability theory, converge property, and so forth to complete effective reasoning and calculate certain network models. Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area. Thirdly, OSCC picks out the optimal routing solution while conducting combinatorial optimization of routing path using ant colony optimization (ACO) algorithm, thus reducing the energy spending of whole network. In the end, this paper verifies OSCC algorithm by simulation experiment and proves it can use least sensor nodes to effectively cover target area. Also, OSCC helps greatly reduce network energy consuming, minimize network resources layout costs, and enhance network life cycle, simultaneously.

Suggested Citation

  • Zeyu Sun & Weiguo Wu & Huanzhao Wang & Heng Chen & Wei Wei, 2014. "An Optimized Strategy Coverage Control Algorithm for WSN," International Journal of Distributed Sensor Networks, , vol. 10(7), pages 976307-9763, July.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:7:p:976307
    DOI: 10.1155/2014/976307
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/976307
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/976307?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:7:p:976307. 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.