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

A Stochastic and Optimized Energy Efficient Clustering Protocol for Wireless Sensor Networks

Author

Listed:
  • Kyung Tae Kim
  • Hee Yong Youn

Abstract

Wireless sensor network consisting of a large number of small sensors of low-power transceiver is effective for gathering data in a variety of environments. Since the network is built with low-cost sensor nodes of limited battery power, it is a challenging task to design an efficient routing scheme maximizing the network lifetime. In this paper, we propose a new clustering protocol reducing the energy taken for routing, and thus extending the network lifetime. The proposed scheme is based on a newly developed model of optimal number of clusters in the network with which the energy consumption can be minimized. It also includes a method of cluster-head rotation inside each cluster, which avoids the clustering operation during normal operation and evenly distributes the load among the nodes. The performance of the proposed scheme is compared with the clustering-based routing protocols, Low-Energy Adaptive Clustering Hierarchy (LEACH), LEACH-Centralized (LEACH-C), and Adaptive and Energy Efficient Clustering (AEEC) algorithm. Simulation results show that it significantly reduces energy consumption and improves network lifetime. It is thus expected to be effective for large-scale semantic sensor web.

Suggested Citation

  • Kyung Tae Kim & Hee Yong Youn, 2014. "A Stochastic and Optimized Energy Efficient Clustering Protocol for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 828675-8286, March.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:828675
    DOI: 10.1155/2014/828675
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/828675
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/828675?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:3:p:828675. 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.