Abdulla Juwaied
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abdulla Juwaied has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Lidia Jackowska-Strumiłło
Institute of Applied Computer Science, Lodz University of Technology, ul. Stefanowskiego 18, 90-537 Lodz, Poland
6 shared publications - Andrzej Romanowski
Lodz University of Technology, Lodz, Poland
1 shared publication Artur Sierszeń
Lodz University of Technology
1 shared publication- Artur Sierszeń
Lodz University of Technology
1 shared publication Lidia Jackowska-Strumillo
Institute of Applied Computer Science, Lodz University of Technology, Lodz, Poland
1 shared publicationLidia Jackowska-Strumiłło
Lodz University of Technology
1 shared publication
Latest Publications
- Open Access
- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9736
SecureFresh-WSN: An Energy-Aware and Trust-Based Clustering and Routing Protocol for Cyberattack-Resilient Wireless Sensor Networks
Wireless sensor networks (WSNs) in critical environments need to conserve energy and deliver fresh information despite possible cyberattacks. Meeting these requirements remains a challenge. Classical protocols such as LEACH optimise energy but neglect security and freshness, while recent reinforcement-learning and fuzzy-trust methods address security at the expense of energy balance or data freshness. This paper proposes SecureFresh-WSN, a unified clustering and routing protocol that jointly balances the optimisation of energy consumption, cyberattack resilience, and Age-of-Information (AoI) freshness in terrestrial WSNs. The framework integrates (1) K-Means spatial clustering for stable topology formation; (2) a temporal anomaly-detection mechanism with per-node risk memory over a six-round sliding window; (3) a multi-criteria, trust-aware cluster-head (CH) selection mechanism that penalises suspicious, attacked, and energy-depleted nodes; and (4) confidence-weighted routing that prioritises fresh data delivery while reducing exposure to compromised forwarding nodes. MATLAB R2025a simulations were conducted for the network sizes of 100, 500, and 1000 nodes. Each of the four independent attack types (Denial of Service, False Data Injection, Selective Forwarding, Sinkhole) was injected independently with the probability of 0.015 per node per round, which led to an overall attack probability of approximately 5.87% per node per round. Over 20 independent random seeds, SecureFresh-WSN decreased the mean network Age-of-Information (AoI) by 66.4% compared to the LEACH protocol, increased the network lifetime (LND) by 28.4%, improved the packet delivery ratio by 11.3%, and reduced false suspicion of selected CHs by 41.7% in the case of 100 nodes, with similar trends observed for larger network sizes. Energy consumption was reduced in most cases while maintaining a good level of performance.
- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9736
Open AccessSecureFresh-WSN: An Energy-Aware and Trust-Based Clustering and Routing Protocol for Cyberattack-Resilient Wireless Sensor Networks
Wireless sensor networks (WSNs) in critical environments need to conserve energy and deliver fresh information despite possible cyberattacks. Meeting these requirements remains a challenge. Classical protocols such as LEACH optimise energy but neglect security and freshness, while recent reinforcement-learning and fuzzy-trust methods address security at the expense of energy balance or data freshness. This paper proposes SecureFresh-WSN, a unified clustering and routing protocol that jointly balances the optimisation of energy consumption, cyberattack resilience, and Age-of-Information (AoI) freshness in terrestrial WSNs. The framework integrates (1) K-Means spatial clustering for stable topology formation; (2) a temporal anomaly-detection mechanism with per-node risk memory over a six-round sliding window; (3) a multi-criteria, trust-aware cluster-head (CH) selection mechanism that penalises suspicious, attacked, and energy-depleted nodes; and (4) confidence-weighted routing that prioritises fresh data delivery while reducing exposure to compromised forwarding nodes. MATLAB R2025a simulations were conducted for the network sizes of 100, 500, and 1000 nodes. Each of the four independent attack types (Denial of Service, False Data Injection, Selective Forwarding, Sinkhole) was injected independently with the probability of 0.015 per node per round, which led to an overall attack probability of approximately 5.87% per node per round. Over 20 independent random seeds, SecureFresh-WSN decreased the mean network Age-of-Information (AoI) by 66.4% compared to the LEACH protocol, increased the network lifetime (LND) by 28.4%, improved the packet delivery ratio by 11.3%, and reduced false suspicion of selected CHs by 41.7% in the case of 100 nodes, with similar trends observed for larger network sizes. Energy consumption was reduced in most cases while maintaining a good level of performance.
- Top Cited PapersOpen Access
- 24 April 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Analysis and comparison of two selected machine learning algorithms for enhancing wireless sensor network protocols
Wireless Sensor Networks (WSNs) consist of low-power, battery-powered sensor nodes that collaborate to monitor the environment and transmit data to a base station. However, their efficiency is mainly constrained by energy usage and limited network lifespan. Among cluster‑based routing protocols, the Deterministic Energy‑Efficient Clustering (DEC) protocol is a recognised hierarchical scheme for heterogeneous WSNs; however, DEC still faces several challenges, particularly with energy consumption. This paper presents a unified comparative study of two machine learning-enhanced modifications to the DEC protocol for WSNs. Unlike our previous protocol proposals, this work integrates DEC-KNN (K-Nearest Neighbours) and DEC-KM (K-Means) within a single simulation framework, systematically compares their energy, distance, and stability performance, and provides practical deployment guidelines based on application-specific trade-offs. The simulations are conducted through MATLAB R2024b simulations on a 50-node heterogeneous WSN covering a 100 m × 100 m area. Both protocols show a substantial benefit over the original protocol baseline. DEC-KM leads to a small reduction in both total and average energy consumption and provides a good balance between clustering performance and energy consumption, making it an attractive option for energy-limited WSN applications in Internet of Things (IoT) and smart environments.
- 24 April 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Top Cited PapersOpen AccessAnalysis and comparison of two selected machine learning algorithms for enhancing wireless sensor network protocols
Wireless Sensor Networks (WSNs) consist of low-power, battery-powered sensor nodes that collaborate to monitor the environment and transmit data to a base station. However, their efficiency is mainly constrained by energy usage and limited network lifespan. Among cluster‑based routing protocols, the Deterministic Energy‑Efficient Clustering (DEC) protocol is a recognised hierarchical scheme for heterogeneous WSNs; however, DEC still faces several challenges, particularly with energy consumption. This paper presents a unified comparative study of two machine learning-enhanced modifications to the DEC protocol for WSNs. Unlike our previous protocol proposals, this work integrates DEC-KNN (K-Nearest Neighbours) and DEC-KM (K-Means) within a single simulation framework, systematically compares their energy, distance, and stability performance, and provides practical deployment guidelines based on application-specific trade-offs. The simulations are conducted through MATLAB R2024b simulations on a 50-node heterogeneous WSN covering a 100 m × 100 m area. Both protocols show a substantial benefit over the original protocol baseline. DEC-KM leads to a small reduction in both total and average energy consumption and provides a good balance between clustering performance and energy consumption, making it an attractive option for energy-limited WSN applications in Internet of Things (IoT) and smart environments.
- Top Cited PapersOpen Access
- 16 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (8) , 1686
Intelligence-Driven Leader Selection in PEGASIS: A Data-Driven Machine Learning Framework for Sustainable and Secure Wireless Sensor Networks
Energy-efficient routing is critical for extending the operational lifespan of wireless sensor networks (WSNs). While the Power-Efficient Gathering in Sensor Information Systems (PEGASIS) protocol achieves high efficiency through chain-based data aggregation, its standard round-robin leader selection fails to account for dynamic node factors, such as residual energy and historical reliability. This often leads to premature energy depletion and network instability. To address these limitations, this paper proposes K-NN-PEGASIS, a data-driven machine learning framework that utilises a weighted k-nearest neighbours (K-NN) algorithm for intelligent leader selection. By processing a normalised feature vector comprising residual energy, distance to the base station (BS), node degree, and historical performance, the framework adaptively identifies optimal leaders in each round. Simulations conducted in MATLAB for networks ranging from 100 to 1000 nodes demonstrate that K-NN-PEGASIS improves network lifetime by up to 47.3% and reduces total energy dissipation by 52.8% compared to baseline algorithms. Furthermore, the framework provides passive resilience against routing attacks, reducing the selection of malicious leaders by 96% and maintaining a 32.3% higher packet delivery ratio under attack scenarios.
- 16 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (8) , 1686
Top Cited PapersOpen AccessIntelligence-Driven Leader Selection in PEGASIS: A Data-Driven Machine Learning Framework for Sustainable and Secure Wireless Sensor Networks
Energy-efficient routing is critical for extending the operational lifespan of wireless sensor networks (WSNs). While the Power-Efficient Gathering in Sensor Information Systems (PEGASIS) protocol achieves high efficiency through chain-based data aggregation, its standard round-robin leader selection fails to account for dynamic node factors, such as residual energy and historical reliability. This often leads to premature energy depletion and network instability. To address these limitations, this paper proposes K-NN-PEGASIS, a data-driven machine learning framework that utilises a weighted k-nearest neighbours (K-NN) algorithm for intelligent leader selection. By processing a normalised feature vector comprising residual energy, distance to the base station (BS), node degree, and historical performance, the framework adaptively identifies optimal leaders in each round. Simulations conducted in MATLAB for networks ranging from 100 to 1000 nodes demonstrate that K-NN-PEGASIS improves network lifetime by up to 47.3% and reduces total energy dissipation by 52.8% compared to baseline algorithms. Furthermore, the framework provides passive resilience against routing attacks, reducing the selection of malicious leaders by 96% and maintaining a 32.3% higher packet delivery ratio under attack scenarios.
- Top Cited PapersOpen Access
EMO-PEGASIS: A Dual-Phase Machine Learning Protocol for Energy Delay Optimisation in WSNs
Wireless sensor networks (WSNs) contend with the critical challenge of balancing energy conservation against data transmission delay, a trade-off that protocols such as PEGASIS—while being strong in energy efficiency—fail to manage optimally due to resulting high latency, unbalanced load distribution, and suboptimal cluster formation. To address these limitations, this paper introduces the Enhanced Multi-Objective PEGASIS (EMO-PEGASIS) protocol, which is designed and implemented using a dual-phase machine learning strategy. This multi-objective approach works in two stages. First, it utilises K-means clustering to achieve robust spatial partitioning of the network. Second, it employs K-Nearest Neighbours (K-NN) classification to enable adaptive and intelligent routing. The simulation was performed using MATLAB R2025a, and the results show that EMO-PEGASIS addresses this multi-objective optimisation problem. The proposed EMO-PEGASIS protocol achieves a 45% reduction in average energy consumption, a 38% decrease in end-to-end delay, and a 67% increase in network lifetime compared to the original PEGASIS protocol. Additionally, EMO-PEGASIS demonstrates enhanced stability and effective load balancing under heterogeneous network configurations, while maintaining an excellent packet delivery ratio of 96.8%. These findings underscore the effectiveness of integrating machine learning techniques, which ultimately yield enhanced performance and enable reliable multi-objective optimisation within energy- and delay-constrained WSN environments.
Top Cited PapersOpen AccessEMO-PEGASIS: A Dual-Phase Machine Learning Protocol for Energy Delay Optimisation in WSNs
Wireless sensor networks (WSNs) contend with the critical challenge of balancing energy conservation against data transmission delay, a trade-off that protocols such as PEGASIS—while being strong in energy efficiency—fail to manage optimally due to resulting high latency, unbalanced load distribution, and suboptimal cluster formation. To address these limitations, this paper introduces the Enhanced Multi-Objective PEGASIS (EMO-PEGASIS) protocol, which is designed and implemented using a dual-phase machine learning strategy. This multi-objective approach works in two stages. First, it utilises K-means clustering to achieve robust spatial partitioning of the network. Second, it employs K-Nearest Neighbours (K-NN) classification to enable adaptive and intelligent routing. The simulation was performed using MATLAB R2025a, and the results show that EMO-PEGASIS addresses this multi-objective optimisation problem. The proposed EMO-PEGASIS protocol achieves a 45% reduction in average energy consumption, a 38% decrease in end-to-end delay, and a 67% increase in network lifetime compared to the original PEGASIS protocol. Additionally, EMO-PEGASIS demonstrates enhanced stability and effective load balancing under heterogeneous network configurations, while maintaining an excellent packet delivery ratio of 96.8%. These findings underscore the effectiveness of integrating machine learning techniques, which ultimately yield enhanced performance and enable reliable multi-objective optimisation within energy- and delay-constrained WSN environments.
- Open Access
- 14 August 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (16) , 8996
DL-HEED: A Deep Learning Approach to Energy-Efficient Clustering in Heterogeneous Wireless Sensor Networks
Wireless sensor networks (WSNs) are widely used in environmental monitoring, industrial automation, and smart cities. The Hybrid Energy-Efficient Distributed (HEED) protocol is a popular clustering algorithm designed to prolong network lifetime by balancing energy consumption among sensor nodes. However, HEED relies on simple heuristics for cluster-head (CH) selection, which may not fully exploit the complex spatiotemporal patterns in node energy and topology. This paper introduces a novel protocol, Deep Learning–Hybrid Energy-Efficient Distributed (DL-HEED), which, for the first time, integrates a Graph Neural Network (GNN) into the clustering process. By leveraging the relational structure of WSNs and a comprehensive set of node and network features—including residual energy, node degree, spatial position, and signal strength—DL-HEED enables intelligent, context-aware, and adaptive CH selection. DL-HEED leverages the relational structure of WSNs through deep learning, enabling more adaptive and energy-efficient cluster head selection than traditional heuristic-based protocols. Extensive simulations demonstrate that DL-HEED significantly outperforms classic HEED achieving up to 60% improvement in the network lifetime and energy efficiency as the network size increases. This work establishes DL-HEED as a robust, scalable, and practical solution for next-generation WSN deployments, marking a substantial advancement in the application of deep learning to resource-constrained IoT environments.
- 14 August 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (16) , 8996
Open AccessDL-HEED: A Deep Learning Approach to Energy-Efficient Clustering in Heterogeneous Wireless Sensor Networks
Wireless sensor networks (WSNs) are widely used in environmental monitoring, industrial automation, and smart cities. The Hybrid Energy-Efficient Distributed (HEED) protocol is a popular clustering algorithm designed to prolong network lifetime by balancing energy consumption among sensor nodes. However, HEED relies on simple heuristics for cluster-head (CH) selection, which may not fully exploit the complex spatiotemporal patterns in node energy and topology. This paper introduces a novel protocol, Deep Learning–Hybrid Energy-Efficient Distributed (DL-HEED), which, for the first time, integrates a Graph Neural Network (GNN) into the clustering process. By leveraging the relational structure of WSNs and a comprehensive set of node and network features—including residual energy, node degree, spatial position, and signal strength—DL-HEED enables intelligent, context-aware, and adaptive CH selection. DL-HEED leverages the relational structure of WSNs through deep learning, enabling more adaptive and energy-efficient cluster head selection than traditional heuristic-based protocols. Extensive simulations demonstrate that DL-HEED significantly outperforms classic HEED achieving up to 60% improvement in the network lifetime and energy efficiency as the network size increases. This work establishes DL-HEED as a robust, scalable, and practical solution for next-generation WSN deployments, marking a substantial advancement in the application of deep learning to resource-constrained IoT environments.
- Open Access
Applying Machine Learning to DEEC Protocol: Improved Cluster Formation in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are specialised ad hoc networks composed of small, low-power, and often battery-operated sensor nodes with various sensors and wireless communication capabilities. These nodes collaborate to monitor and collect data from the physical environment, transmitting it to a central location or sink node for further processing and analysis. This study proposes two machine learning-based enhancements to the DEEC protocol for Wireless Sensor Networks (WSNs) by integrating the K-Nearest Neighbours (K-NN) and K-Means (K-M) machine learning (ML) algorithms. The Distributed Energy-Efficient Clustering with K-NN (DEEC-KNN) and with K-Means (DEEC-KM) approaches dynamically optimize cluster head selection to improve energy efficiency and network lifetime. These methods are validated through extensive simulations, demonstrating up to 110% improvement in packet delivery and significant gains in network stability compared with the original DEEC protocol. The adaptive clustering enabled by K-NN and K-Means is particularly effective for large-scale and dynamic WSN deployments where node failures and topology changes are frequent. These findings suggest that integrating ML with clustering protocols is a promising direction for future WSN design.
Open AccessApplying Machine Learning to DEEC Protocol: Improved Cluster Formation in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are specialised ad hoc networks composed of small, low-power, and often battery-operated sensor nodes with various sensors and wireless communication capabilities. These nodes collaborate to monitor and collect data from the physical environment, transmitting it to a central location or sink node for further processing and analysis. This study proposes two machine learning-based enhancements to the DEEC protocol for Wireless Sensor Networks (WSNs) by integrating the K-Nearest Neighbours (K-NN) and K-Means (K-M) machine learning (ML) algorithms. The Distributed Energy-Efficient Clustering with K-NN (DEEC-KNN) and with K-Means (DEEC-KM) approaches dynamically optimize cluster head selection to improve energy efficiency and network lifetime. These methods are validated through extensive simulations, demonstrating up to 110% improvement in packet delivery and significant gains in network stability compared with the original DEEC protocol. The adaptive clustering enabled by K-NN and K-Means is particularly effective for large-scale and dynamic WSN deployments where node failures and topology changes are frequent. These findings suggest that integrating ML with clustering protocols is a promising direction for future WSN design.
- Open Access
Enhanced Distributed Energy-Efficient Clustering (DEEC) Protocol for Wireless Sensor Networks: A Modular Implementation and Performance Analysis
Wireless Sensor Networks (WSNs) are a component of various applications, including environmental monitoring and the Internet of Things (IoT). Energy efficiency is one of the significant issues in WSNs, since sensor nodes are usually battery-powered and have limited energy resources. The Enhanced Distributed Energy-Efficient Clustering (DEEC) protocol is one of the most common methods for improving energy efficiency and network lifespan by selecting cluster heads according to residual energy. Nevertheless, standard DEEC methods are limited in dynamic environments because of their fixed nature. This paper presents a novel modular implementation of the DEEC protocol for Wireless Sensor Networks, addressing the limitations of the standard DEEC in dynamic and heterogeneous environments. Unlike the typical DEEC protocol, the proposed approach incorporates realistic energy models, supports heterogeneous nodes, implements load balancing, and enables dynamic cluster head selection Numerical simulations in MATLAB® demonstrate that the improved DEEC protocol achieves a 133% longer stability period (first node death at 1166 rounds vs. 472 rounds), nearly doubles the network lifetime (4000 rounds vs. 2111 rounds), and significantly enhances energy efficiency compared to the standard DEEC. These results verify the effectiveness of the proposed enhancements, making the protocol a robust solution for modern WSN and IoT applications.
Open AccessEnhanced Distributed Energy-Efficient Clustering (DEEC) Protocol for Wireless Sensor Networks: A Modular Implementation and Performance Analysis
Wireless Sensor Networks (WSNs) are a component of various applications, including environmental monitoring and the Internet of Things (IoT). Energy efficiency is one of the significant issues in WSNs, since sensor nodes are usually battery-powered and have limited energy resources. The Enhanced Distributed Energy-Efficient Clustering (DEEC) protocol is one of the most common methods for improving energy efficiency and network lifespan by selecting cluster heads according to residual energy. Nevertheless, standard DEEC methods are limited in dynamic environments because of their fixed nature. This paper presents a novel modular implementation of the DEEC protocol for Wireless Sensor Networks, addressing the limitations of the standard DEEC in dynamic and heterogeneous environments. Unlike the typical DEEC protocol, the proposed approach incorporates realistic energy models, supports heterogeneous nodes, implements load balancing, and enables dynamic cluster head selection Numerical simulations in MATLAB® demonstrate that the improved DEEC protocol achieves a 133% longer stability period (first node death at 1166 rounds vs. 472 rounds), nearly doubles the network lifetime (4000 rounds vs. 2111 rounds), and significantly enhances energy efficiency compared to the standard DEEC. These results verify the effectiveness of the proposed enhancements, making the protocol a robust solution for modern WSN and IoT applications.
- Open Access
Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm
Wireless Sensor Networks are formed by tiny, self-contained, battery-powered computers with radio links that can sense their surroundings for events of interest and store and process the sensed data. Sensor nodes wirelessly communicate with each other to relay information to a central base station. Energy consumption is the most critical parameter in Wireless Sensor Networks (WSNs). Network lifespan is directly influenced by the energy consumption of the sensor nodes. All sensors in the network send and receive data from the base station (BS) using different routing protocols and algorithms. These routing protocols use two main types of clustering: hierarchical clustering and flat clustering. Consequently, effective clustering within Wireless Sensor Network (WSN) protocols is essential for establishing secure connections among nodes, ensuring a stable network lifetime. This paper introduces a novel approach to improve energy efficiency, reduce the length of network connections, and increase network lifetime in heterogeneous Wireless Sensor Networks by employing the K-Nearest Neighbours (KNN) algorithm to optimise node selection and clustering mechanisms for four protocols: Low-Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP), Threshold-sensitive Energy Efficient sensor Network (TEEN), and Distributed Energy-efficient Clustering (DEC). Simulation results obtained using MATLAB (R2024b) demonstrate the efficacy of the proposed K-Nearest Neighbours algorithm, revealing that the modified protocols achieve shorter distances between cluster heads and nodes, reduced energy consumption, and improved network lifetime compared to the original protocols. The proposed KNN-based approach enhances the network’s operational efficiency and security, offering a robust solution for energy management in WSNs.
Open AccessEnhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm
Wireless Sensor Networks are formed by tiny, self-contained, battery-powered computers with radio links that can sense their surroundings for events of interest and store and process the sensed data. Sensor nodes wirelessly communicate with each other to relay information to a central base station. Energy consumption is the most critical parameter in Wireless Sensor Networks (WSNs). Network lifespan is directly influenced by the energy consumption of the sensor nodes. All sensors in the network send and receive data from the base station (BS) using different routing protocols and algorithms. These routing protocols use two main types of clustering: hierarchical clustering and flat clustering. Consequently, effective clustering within Wireless Sensor Network (WSN) protocols is essential for establishing secure connections among nodes, ensuring a stable network lifetime. This paper introduces a novel approach to improve energy efficiency, reduce the length of network connections, and increase network lifetime in heterogeneous Wireless Sensor Networks by employing the K-Nearest Neighbours (KNN) algorithm to optimise node selection and clustering mechanisms for four protocols: Low-Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP), Threshold-sensitive Energy Efficient sensor Network (TEEN), and Distributed Energy-efficient Clustering (DEC). Simulation results obtained using MATLAB (R2024b) demonstrate the efficacy of the proposed K-Nearest Neighbours algorithm, revealing that the modified protocols achieve shorter distances between cluster heads and nodes, reduced energy consumption, and improved network lifetime compared to the original protocols. The proposed KNN-based approach enhances the network’s operational efficiency and security, offering a robust solution for energy management in WSNs.
- Open Access
Improving Performance of Cluster Heads Selection in DEC Protocol Using K-Means Algorithm for WSN
Wireless sensor networks (WSN) have found more and more applications in remote control and monitoring systems. Energy management in the network is crucial because all nodes in the WSN are energy constrained. Therefore, the design and implementation of WSN protocols that reduce energy depletion in the network is still an open scientific problem. In this paper, we propose a new clustering protocol that combines DEC (deterministic energy-efficient clustering) protocol with K-means clustering, called DEC-KM (deterministic energy-efficient clustering protocol with K-means). DEC is a very energy-efficient clustering protocol that outperforms its predecessors, such as LEACH and SEP. K-means ensures more effective clustering and shorter data transmission distances within the network. The shorter distances improve the network’s lifetime and stability and reduce power consumption. Additional heuristic rules in DEC-KM ensure improved cluster head selection, taking into account node energy level and position and minimising the risk of premature cluster head exhaustion. The simulation results for the DEC-KM protocol using MATLAB show that cluster heads have shorter distances to nodes in cluster areas than for the original DEC protocol. The proposed protocol ensures reduced energy consumption, outperforms the standard DEC, and extends the stability period and lifetime of the network.
Open AccessImproving Performance of Cluster Heads Selection in DEC Protocol Using K-Means Algorithm for WSN
Wireless sensor networks (WSN) have found more and more applications in remote control and monitoring systems. Energy management in the network is crucial because all nodes in the WSN are energy constrained. Therefore, the design and implementation of WSN protocols that reduce energy depletion in the network is still an open scientific problem. In this paper, we propose a new clustering protocol that combines DEC (deterministic energy-efficient clustering) protocol with K-means clustering, called DEC-KM (deterministic energy-efficient clustering protocol with K-means). DEC is a very energy-efficient clustering protocol that outperforms its predecessors, such as LEACH and SEP. K-means ensures more effective clustering and shorter data transmission distances within the network. The shorter distances improve the network’s lifetime and stability and reduce power consumption. Additional heuristic rules in DEC-KM ensure improved cluster head selection, taking into account node energy level and position and minimising the risk of premature cluster head exhaustion. The simulation results for the DEC-KM protocol using MATLAB show that cluster heads have shorter distances to nodes in cluster areas than for the original DEC protocol. The proposed protocol ensures reduced energy consumption, outperforms the standard DEC, and extends the stability period and lifetime of the network.
- 1 November 2018
- Published by Springer Nature
- p. 161-168
Modified TEEN Protocol in Wireless Sensor Network Using KNN Algorithm
- 1 November 2018
- Published by Springer Nature
- p. 161-168
Modified TEEN Protocol in Wireless Sensor Network Using KNN Algorithm