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

Energy-Efficient Prediction Clustering Algorithm for Multilevel Heterogeneous Wireless Sensor Networks

Author

Listed:
  • Jian Peng
  • Tang Liu
  • Hongyou Li
  • Bing Guo

Abstract

In designing wireless sensor networks, it is important to reduce energy dissipation and prolong network lifetime. This paper presents research on the existing clustering algorithm applied in heterogeneous sensor networks and then puts forward an energy-efficient prediction clustering algorithm, which is adaptive to sensor networks with energy and objects heterogeneous. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residual energy, so that the network energy can be dissipated uniformly. In order to reduce energy consumption when broadcasting in clustering phase and prolong network lifetime, an energy consumption prediction model is established for regular data acquisition nodes. Simulation results show that compared with current clustering algorithms, this algorithm can achieve longer sensor network lifetime, higher energy efficiency, and superior network monitoring quality.

Suggested Citation

  • Jian Peng & Tang Liu & Hongyou Li & Bing Guo, 2013. "Energy-Efficient Prediction Clustering Algorithm for Multilevel Heterogeneous Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(2), pages 678214-6782, February.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:2:p:678214
    DOI: 10.1155/2013/678214
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1155/2013/678214?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:2:p:678214. 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.