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

Multi-Hop Data Communication Algorithm for Clustered Wireless Sensor Networks

Author

Listed:
  • Dilip Kumar
  • R. B. Patel

Abstract

Recently, continued advances in wireless communication technologies have enabled the deployment of large-scale wireless sensor networks (WSNs). A key concern in the design and development of such WSNs is energy consumption. The hierarchical clustering algorithm is a kind of a technique which is used to reduce energy consumption. It can also increase the scalability, stability, and network lifetime. In some clustering schemes, the communication between a sensor node and its designated cluster head (CH) is assumed to be single-hop. However, multihop communication is often required when the communication range of the sensor nodes is limited or the number of sensor nodes is very large in a network. In this paper, we propose a distributed, randomized, multi-hop clustering algorithm to organize the sensor nodes in a WSN into clusters. The data collected by each sensor node communicate with their respective CHs by using multi-hop communication. The selected CHs collect data from member nodes in their respective clusters, aggregate the data, and send it to a base using multi-hop communication. Simulation results show that proposed algorithm efficiently mitigates the hot spot problem in heterogeneous WSN and achieves much improvement in network lifetime and load balance compared to the existing algorithms.

Suggested Citation

  • Dilip Kumar & R. B. Patel, 2011. "Multi-Hop Data Communication Algorithm for Clustered Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 7(1), pages 984795-9847, April.
  • Handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:984795
    DOI: 10.1155/2011/984795
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2011/984795
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2011/984795?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:7:y:2011:i:1:p:984795. 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.