An Energy‐Proficient Clustering‐Inspired Routing Protocol using Improved Bkd‐tree for Enhanced Node Stability and Network Lifetime in Wireless Sensor Networks. (11th August 2020)

• Record Type: Journal Article
• Authors: Janakiraman, Sengathir; M., Deva Priya
• Is Part Of: International journal of communication systems. Volume 33:Number 16(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-08-11
• Subjects: cluster head selection -- clustering‐based routing protocol -- energy efficiency -- improved Bkd‐tree -- network lifetime -- wireless sensor networks; Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.4575
• Languages: English
• ISSNs: 1074-5351

Abstract

Summary: Energy conservation in Wireless Sensor Networks (WSNs) is essential for improving the stability of sensor nodes and network lifetime. An energy‐proficient 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 Clustering‐based 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 an improved Bkd‐tree algorithm. It also concentrates on the process of CH selection 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 k‐dimensional 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. Abstract : Improved Bkd‐Tree‐Inspired Energy‐eFficient Clustering‐based Routing Protocol (IBkd‐Tree‐IEFCRP) is propounded for guaranteeing significant cluster formation, management and strategies to CH allocation in order to handle the impact on the aspects of QoS. This IBkd‐Tree‐IEFCRP is proposed with the capability to deal with energy saving with respect to data traffic and its applications. It includes the strategy of cluster formation by incorporating improved Bkd‐tree algorithm with the benefits of partition data structure.