IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v8y2016i3p27-d72995.html
   My bibliography  Save this article

Density Self-Adaptive Hybrid Clustering Routing Protocol for Wireless Sensor Networks

Author

Listed:
  • Ting Ye

    (School of Computer and Software, Nanjing University of Information Science & Technology, Nanjing 210044, Jiangsu, China)

  • Baowei Wang

    (Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology, Nanjing 210044, Jiangsu, China
    Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science and Technology, Nanjing 210044, Jiangsu, China)

Abstract

Energy efficiency is of major concern in wireless sensor networks, especially in difficult node deployment environments. Clustering is an effective method to save energy consumption and prolong the network lifetime. There are two kinds of clustering methods in hierarchical routing protocols, namely distributed control and centralized control. In the distributed strategy, the algorithm has good scalability, but it can easily lead to an uneven distribution of cluster heads. When the centralized strategy is used, the network is balanced and robust, but the overhead of clustering is large and the network latency is increased. In our proposed protocol, named DAHC, a mixture algorithm of distributed and centralized control is used to select a cluster head (CH). Simultaneously, we propose a novel approach to judge the cluster density and adjust according to the preset threshold. The simulation results show that our methods can evenly distribute the energy load on all nodes, save the energy consumption of communication and extend the network lifetime concurrently.

Suggested Citation

  • Ting Ye & Baowei Wang, 2016. "Density Self-Adaptive Hybrid Clustering Routing Protocol for Wireless Sensor Networks," Future Internet, MDPI, vol. 8(3), pages 1-12, June.
  • Handle: RePEc:gam:jftint:v:8:y:2016:i:3:p:27-:d:72995
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/8/3/27/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/8/3/27/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:8:y:2016:i:3:p:27-:d:72995. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.