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

A Uniform Clustering Mechanism for Wireless Sensor Networks

Author

Listed:
  • Rabia Noor Enam
  • Rehan Qureshi
  • Syed Misbahuddin

Abstract

In wireless sensor networks with dynamic clustering, the cluster heads are usually not selected on the basis of their locations. This causes irregular distribution of cluster heads and highly variable number of nodes in the clusters. Also, some of the clusters are spread over large areas within the network, causing limited spatial correlation between associated sensor nodes. These irregularities in cluster placements and dimensions negatively impact the efficiency of a wireless sensor network. For example, for a cooperative data aggregation, it necessitates variable or large sized packets while the aggregations, based on spatial correlation of sensor nodes, cannot be exploited easily. In this paper, we have developed a Distributed Uniform Clustering Algorithm (DUCA) for cluster based WSN. In DUCA, cluster formation mechanism is based on a virtual-grid system and sensing ranges of nodes that provide even distribution of clusters, homogenized cluster sizes, and reduced energy consumption. Simulation results show that DUCA improves the distribution of cluster heads by more than 2 times and reduces the energy consumption within a range of 15% to 50% as compared to the existing protocols.

Suggested Citation

  • Rabia Noor Enam & Rehan Qureshi & Syed Misbahuddin, 2014. "A Uniform Clustering Mechanism for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 924012-9240, March.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:924012
    DOI: 10.1155/2014/924012
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/924012
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/924012?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:924012. 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.