No abstract

Energy conservation in Wireless Sensor Networks (WSNs) is essential for improving the stability of sensor nodes and network lifetime. An energyproficient clustering-based routing protocol is necessary for efficient cluster formation and Cluster Head (CH) selection to sustain Quality of Service (QoS). In this paper, an Improved Bkd-Tree-Inspired Energy-eFficient Clusteringbased Routing Protocol (IBkd-Tree-IEFCRP) is propounded as a potential strategy for guaranteeing significant cluster formation and management. It is proposed as an effective strategy in CH node allocation that handles the impacts of QoS during the process of data dissemination. This IBkd-Tree-IEFCRP is proposed to deal with energy saving with respect to data traffic by including a strategy of cluster formation which incorporates the benefits of partition data structure that incorporates animprovedBkd-treealgorithm.Italsoconcentrates ontheprocessofCHselection by integrating a reactive approach that enhances throughput with minimized energy, delay and jitter. The simulation experiments of the proposed IBkd-Tree-IEFCRP confirm a better performance in improving the average throughput by 13.21%, reducing the energy consumptions by 12.96%, minimizing the delay by 11.98% and reducing the jitter by 14.24% when compared to the baseline kdimensional tree algorithm (kd-tree algorithm), Weighting and Parameter Optimization-based Energy-Efficient Clustering Routing Protocol (WPO-EECRP), Improved Clustering by Fast Search and Finding of Density Peaks (ICFSFDP), and Energy-based Cluster Centered Routing Protocol (ECCRP) taken for comparison. The proposed IBkd-Tree-IEFCRP is also identified to reduce delay by 8.42% and jitter by 7.18% and increase throughput by 6.84% when compared to the benchmarked protocols for different number of rounds.

No abstract

No abstract

No abstract