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

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

Author

Listed:
  • Zeyu Sun
  • Chuanfeng Li
  • Xiaofei Xing
  • Huihui Wang
  • Ben Yan
  • Xuelun Li

Abstract

In the process of the wireless sensor network research, the issue on the energy consumption and coverage is an essential and critical one. According to the characteristic of the sensor nodes, it is homogeneous, and we proposed the k -degree coverage algorithm based on optimization nodes deployment. First, the algorithm gives the solving procedure of the maximum seamless coverage ratio, when the three-node joint coverage has been provided. Second, when the sensor nodes are covering the monitoring area, the algorithm gives the solving procedure of the expected coverage quality and the judgment methods of the coverage ratio, when the nodes are compared with the nearby ones. And when there is redundancy coverage in the given monitoring area, we have given the solving procedure of any sensor nodes that exist in the redundant nodes coverage. Finally, using the simulation experiment, the results of the coverage algorithm based on optimization nodes deployment are compared with other algorithms in terms of the coverage quality and the network lifetime, the performance indexes have enhanced to 13.36% and 12.92% on average. Thus, the effectiveness and viability of the coverage algorithm based on optimization nodes deployment have been proved.

Suggested Citation

  • Zeyu Sun & Chuanfeng Li & Xiaofei Xing & Huihui Wang & Ben Yan & Xuelun Li, 2017. "k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(2), pages 15501477176, February.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:2:p:1550147717693242
    DOI: 10.1177/1550147717693242
    as

    Download full text from publisher

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

    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:13:y:2017:i:2:p:1550147717693242. 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.