IDEAS home Printed from https://ideas.repec.org/a/igg/jitwe0/v6y2011i1p49-58.html
   My bibliography  Save this article

PECA: Power Efficient Clustering Algorithm for Wireless Sensor Networks

Author

Listed:
  • Maytham Safar

    (Kuwait University, Kuwait)

  • Hasan Al-Hamadi

    (Kuwait National Petroleum Company, Kuwait)

  • Dariush Ebrahimi

    (Kuwait University, Kuwait)

Abstract

Wireless sensor networks (WSN) have emerged in many applications as a platform to collect data and monitor a specified area with minimal human intervention. The initial deployment of WSN sensors forms a network that consists of randomly distributed devices/nodes in a known space. Advancements have been made in low-power micro-electronic circuits, which have allowed WSN to be a feasible platform for many applications. However, there are two major concerns that govern the efficiency, availability, and functionality of the network—power consumption and fault tolerance. This paper introduces a new algorithm called Power Efficient Cluster Algorithm (PECA). The proposed algorithm reduces the power consumption required to setup the network. This is accomplished by effectively reducing the total number of radio transmission required in the network setup (deployment) phase. As a fault tolerance approach, the algorithm stores information about each node for easier recovery of the network should any node fail. The proposed algorithm is compared with the Self Organizing Sensor (SOS) algorithm; results show that PECA consumes significantly less power than SOS.

Suggested Citation

  • Maytham Safar & Hasan Al-Hamadi & Dariush Ebrahimi, 2011. "PECA: Power Efficient Clustering Algorithm for Wireless Sensor Networks," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 6(1), pages 49-58, January.
  • Handle: RePEc:igg:jitwe0:v:6:y:2011:i:1:p:49-58
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitwe.2011010104
    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:jitwe0:v:6:y:2011:i:1:p:49-58. 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.