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

Optimization coverage conserving protocol with authentication in wireless sensor networks

Author

Listed:
  • Zeyu Sun
  • Longxing Li
  • Xuelun Li
  • Xiaofei Xing
  • Yuanbo Li

Abstract

In the k -coverage process of target nodes, substantial data redundancy occurs, which leads to the phenomenon of congestion, reducing the network communication capability and coverage as well as accelerating network energy consumption. Therefore, this article proposes an Optimization Coverage Conserving Protocol with Authentication. This protocol provides a solution to obtain the largest coverage probability for multi-nodes. In the optimization and authenticated calculation, the protocol provides the calculation method and verification process of the expected value of multi-node coverage; when the moving target nodes are continuously covered, this protocol provides a process to solve for the focused target nodes; when there is redundancy coverage, this article provides a process to calculate the coverage probability when any sensor node is covered by a redundant node. Furthermore, through comparisons of the coverage quality and network lifetime with other algorithms, the performance indexes of this protocol have been substantially increased by the simulation experiment, which verified the effectiveness and viability of the protocol in this article.

Suggested Citation

  • Zeyu Sun & Longxing Li & Xuelun Li & Xiaofei Xing & Yuanbo Li, 2017. "Optimization coverage conserving protocol with authentication in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(3), pages 15501477176, March.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:3:p:1550147717695561
    DOI: 10.1177/1550147717695561
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717695561
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717695561?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:3:p:1550147717695561. 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.