Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

Duty Cycling Centralized Hierarchical Routing Protocol With Content Analysis Duty Cycling Mechanism for Wireless Sensor Networks

Anar A. Hady

Computer & Systems Department, Electronics Research Institute, Cairo, Egypt

* Corresponding Author: Anar A. Hady, email

Computer Systems Science and Engineering 2020, 35(5), 347-355. https://doi.org/10.32604/csse.2020.35.347

Abstract

In this paper, a Duty Cycling Centralized Hierarchical Protocol (DCCHP) has been proposed for wireless sensor networks. DCCHP is an energy efficient protocol that prolongs the lifetime of the network by applying a duty cycling mechanism named DCM that chooses the nodes that send unimportant data in a certain epoch to be candidates to be put to sleep. But if the proposed equations for choosing the cluster head nodes put any of them in a high priority it works in the active mode. When comparing DCCHP to the previously proposed LEACH-CS, LEACH-C protocols, using a simulation study, DCCHP in average extends the network lifetime 50% more than LEACH-CS and about 60% more than LEACH-C across a different number of nodes in the network scaled up to 1000 nodes. That is because DCCHP chooses the definite number of nodes of unimportant data to be switched to sleeping mode unlike LEACH-CS and unlike LEACH- C which keeps all nodes in active mode. Also an analytical study of energy consumption proves that DCCHP preserves energy consumption more than LEACH-CS and DCCHP. DCCHP has been proposed for applications with scarce resources.

Keywords


Cite This Article

A. A. Hady, "Duty cycling centralized hierarchical routing protocol with content analysis duty cycling mechanism for wireless sensor networks," Computer Systems Science and Engineering, vol. 35, no.5, pp. 347–355, 2020. https://doi.org/10.32604/csse.2020.35.347

Citations




cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2084

    View

  • 1338

    Download

  • 1

    Like

Share Link