Abstract
Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.
Highlights
As the cornerstone of the system of the Internet of ings, wireless sensor networks (WSNs) are distributed network systems in which numerous microsensor nodes cooperate to detect, process, and transmit various information of interest in the way of wireless [1, 2]
Several dynamic cluster heads (CHs) role rotation algorithms have been suggested to eliminate the deficiencies of LEACH by multihops and energy awareness, including I-LEACH [22], EEUC [23], HEED [24], DEEC [25], and DDEEC [26]. ese block clustering-based protocols can alleviate unbalanced energy consumption through CH selection based on residual energy and more relevant criteria
These algorithms suffer from colossal data delay and are not proper for large scale networks [36]. rough the above analysis, it can be inferred that the combination of advantages of both block clusteringbased and chain clustering-based protocols is undoubtedly practicable and reliable option for energy-efficiency maximization in WSNs. us, we propose a cluster-head rotating election routing protocol (CHRERP) to efficiently manage energy consumption in this study. e main contributions of this study are summarized as follows: (1) To reduce the number of nodes competing for CHs and the energy overhead in intracluster communication, the sensing area is segmented into multiple clusters by regular hierarchical pattern, and the central region in each cluster is utilized as the CH election area
Summary
As the cornerstone of the system of the Internet of ings, wireless sensor networks (WSNs) are distributed network systems in which numerous microsensor nodes cooperate to detect, process, and transmit various information of interest in the way of wireless [1, 2]. Hierarchical cluster-based routing protocols have been considered as the most effective network organization scheme in improving the energy-efficiency for WSNs [14,15,16]. E use of chainbased routing protocols can significantly prolong network lifetime by minimizing transfer distance between nodes and avoiding the energy overhead of periodic head voting with a chain topology [35]. These algorithms suffer from colossal data delay and are not proper for large scale networks [36].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
