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

A Distributed Reclustering Hierarchy Routing Protocol Using Social Welfare in Wireless Sensor Networks

Author

Listed:
  • Pu-Tai Yang
  • Seokcheon Lee

Abstract

In recent years, there has been a rapid proliferation of research concerning Wireless Sensor Networks (WSNs), due to the wide range of potential applications that they can be used for. Lifetime is one of the most important considerations for WSNs due to their inherent energy constraints, and various protocols have been proposed to overcome these difficulties. This study proposes a novel distributed reclustering routing protocol: Predictive and Adaptive Routing Protocol using Energy Welfare (PARPEW). PARPEW incorporates the concept of energy welfare (EW) to achieve both energy efficiency and energy balance simultaneously. PARPEW is equipped with a cluster head (CH) shift mechanism that utilizes predictive energy after transmission for the computation of EW. The average case time complexity of the shift mechanism belongs to O ( | C | 2 ) , where | C | is the average number of sensors in a cluster in the WSN. Experimental results demonstrate that the new protocol is capable of significantly prolonging the lifetime of WSNs under various scenarios.

Suggested Citation

  • Pu-Tai Yang & Seokcheon Lee, 2012. "A Distributed Reclustering Hierarchy Routing Protocol Using Social Welfare in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(4), pages 681026-6810, April.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:4:p:681026
    DOI: 10.1155/2012/681026
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/681026
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/681026?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:8:y:2012:i:4:p:681026. 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.