IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v8y2017i3p43-66.html
   My bibliography  Save this article

An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks

Author

Listed:
  • Alphonse PJA

    (National Institute of Technology, Department of Computer Applications, Tiruchirappalli, India)

  • Sivaraj C

    (National Institute of Technology, Department of Computer Applications, Tiruchirappalli, India)

  • Janakiraman T N.

    (National Institute of Technology, Department of Mathematics, Tiruchirappalli, India)

Abstract

Efficient energy management is a key issue in battery equipped wireless sensor networks (WSNs). The cluster based routing in WSNs is a prominent approach for energy conservation of the network which provides a hierarchical data collection mechanism. In order to maximize the energy conservation of sensor nodes, this paper proposes an Energy-efficient Layered Clustering Algorithm (ELCA) for routing in wireless sensor networks. ELCA constructs two layers of clusters to reduce the transmission rate and to balance the energy consumption of sensors. As early energy depletion of clusterheads (CHs) is a major limitation in clustering, this algorithm provides local remedy for energy suffering CHs through efficient CH substitution scheme. The performance of the proposed algorithm is analysed through extensive simulation experiments and verified by compared results with existing clustering algorithms.

Suggested Citation

  • Alphonse PJA & Sivaraj C & Janakiraman T N., 2017. "An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 8(3), pages 43-66, July.
    • Handle: RePEc:igg:jdst00:v:8:y:2017:i:3:p:43-66
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDST.2017070103
    Download Restriction: no
    ---><---

    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:igg:jdst00:v:8:y:2017:i:3:p:43-66. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.