HLBC: A Hierarchical Layer-Balanced Clustering Scheme for Energy Efficient Wireless Sensor Networks

Prasad, Ikkurthi Bhanu; Yogita, .; Yadav, Satyendra Singh; Pal, Vipin

doi:10.1109/jsen.2021.3114506

Cited by 18 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we can minimize network energy consumption related to the number of cluster heads by setting the derivative of E Network with respect to K to zero. The optimal number of cluster heads can be computed by (9).…”

Section: Node Energy Consumption and Optimal Cluster Head Numbermentioning

confidence: 99%

“…Therefore, designing an energy-efficient routing protocol is a key issue to prolong the network lifetime. Clustering routing protocol is envisioned as a promising solution [6], [9], becoming one of the research hotspots of WSNs routing protocol because of its strong scalability, low load and energy consumption, and support for data fusion. In the cluster routing protocol, all nodes are divided by clusters, and a certain node in the cluster is elected as the cluster head.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks

Yao

Cui

et al. 2022

IEEE Sensors J.

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are selforganizing monitoring networks with a large number of randomly deployed micro sensor nodes to collect various physical information so as to realize tasks such as intelligent perception, efficient control and decision-making. However, WSNs nodes are powered by batteries, so they will run out of energy after a certain time. This energy limitation will greatly constrain the network performance like network lifetime and energy efficiency. In this study, for the purpose of prolonging network lifetime, we proposed a multi-hop routing protocol based on game theory and coverage optimization (MRP-GTCO). Briefly, in the stage of setup, two innovational strategies including clustering game with penalty function and cluster head coverage set were designed to realize the uniformity of cluster head distribution and improve the rationality of cluster head election. In the data transmission stage, we firstly derived the applicable conditions theorem of intercluster multi-hop routing. Based on this, a novel multi-hop path selection algorithm related to residual energy and node degree was proposed to provide an energy-efficient data transmission path. The simulation results showed that MRP-GTCO protocol can effectively reduce the network energy consumption and extend the network lifetime 159.22%, 50.76% and 16.46% compared with LGCA, RLEACH and ECAGT protocols.

show abstract

Section: Node Energy Consumption and Optimal Cluster Head Numbermentioning

confidence: 99%

mentioning

confidence: 99%

Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks

Yao

Cui

et al. 2022

IEEE Sensors J.

View full text Add to dashboard Cite

show abstract

“…The attained results showed a noticeable improvement in terms of lifespan, however the drawbacks of this approach are augmented computation cost and reduced packet delivery ratio efficiency. In the same context, a hierarchical layer balanced clustering pattern to optimize the routing protocol in WSN was introduced by Prasad et al [26]. The authors separated WSNs into diverse size hierarchical layers and maintained the computational complexity.…”

Section: Introductionmentioning

confidence: 99%

An Advanced Approach of Optimal Routing Protocol for WSN Using Grey Wolf Optimizer

2024

IJSER

View full text Add to dashboard Cite

This study investigates the performance of an optimal routing protocol in Wireless Sensor Networks (WSNs) based on the Grey Wolf Optimizer (GWO), which is considered an outstanding Metaheuristic optimization technique. Unlike numerous previous studies, this research develops an advanced approach by optimizing the cluster head nodes and sink node mobility, which are essential elements for achieving an optimal routing protocol in WSNs. Several crucial factors, including the rate of energy consumption, and others are considered to ensure trustworthy routing. To demonstrate the feasibility of the proposed approach, three other methods are utilized in a comparative study. Various evaluation measures are exploited, including the number of alive nodes, mean throughput, probability of avoiding unsuitable cluster heads, energy consumption, and computation cost. The simulation results clearly reveal the superiority of the GWO compared to the aforementioned schemes over 5000 implementation rounds. Throughout the simulations, the total number of nodes (700) in the proposed WSN remained operational up to 4500 rounds, with the attained throughput staying above 1000 (bit/sec). Notably, the number of dead nodes remains at 0 after 1500 rounds. Moreover, the probability of avoiding unsuitable cluster heads is the highest, and the packet delivery ratio consistently remains at or above 68%. Additionally, the energy consumption of nodes achieved by the GWO is the lowest and does not exceed 200 Joules, while the computational cost significantly declines to reach 30.5%.

show abstract

“…While considerable research attention has been paid to sensor networks on the topics such as data dissemination [7], [8], energy management [9], [10], and node deployment [11], [12], one of the fundamental issues is how to use the sensor network for state estimation and filtering of dynamic systems [13]- [15]. Compared with the centralized algorithms, the filtering methods for sensor networks need to handle the information exchange between different nodes, which preferably should be performed in a distributed fashion [2], [16].…”

Section: Introductionmentioning

confidence: 99%

Mesh-Based Consensus Distributed Particle Filtering for Sensor Networks

Liu

Coombes

Liu

2023

IEEE Trans. on Signal and Inf. Process. over Networks

View full text Add to dashboard Cite

HLBC: A Hierarchical Layer-Balanced Clustering Scheme for Energy Efficient Wireless Sensor Networks

Cited by 18 publications

References 18 publications

Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks

Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks

An Advanced Approach of Optimal Routing Protocol for WSN Using Grey Wolf Optimizer

Mesh-Based Consensus Distributed Particle Filtering for Sensor Networks

Contact Info

Product

Resources

About