INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
Design and Performance Analysis of Optimization Algorithms for  
Wireless Sensor Networks  
1 Krishna Kumar, 1 Arvind Kumar, 1 Sharad Kumar, 2 Vikas Sharma  
1 School of Engineering & Technology, Shri Venkateshwara University, Gajraula, U.P. India  
2 Department of Computer Applications, SRM Institute of Science and Technology, Delhi NCR Campus,  
Ghaziabad, U.P. India  
DOI : https://doi.org/10.51583/IJLTEMAS.2025.1412000072  
Received: 21 December 2025; Accepted: 26 December 2025; Published: 05 January 2026  
ABSTRACT  
Wireless Sensor Networks (WSNs) are widely deployed in applications such as environmental monitoring,  
healthcare, smart cities, and industrial automation, where network performance and energy efficiency are  
critical constraints. Due to limited battery power, computational capability, and communication bandwidth of  
sensor nodes, the design of efficient optimization algorithms plays a vital role in enhancing overall network  
performance. This paper presents the design and performance analysis of optimization algorithms aimed at  
improving key WSN performance metrics, including energy consumption, network lifetime, throughput,  
packet delivery ratio, and end-to-end delay. The proposed approach focuses on algorithmic optimization at the  
routing and resource management levels to achieve balanced energy utilization and reduced communication  
overhead. Analytical evaluation and simulation-based results demonstrate that the optimized algorithms  
significantly outperform conventional schemes in terms of energy efficiency and network stability under  
varying network conditions. The findings highlight the effectiveness of optimization-driven algorithm design  
in addressing the inherent challenges of Wireless Sensor Networks and provide insights for future algorithm  
development in resource-constrained wireless environments.  
Keywords—Wireless Sensor Networks, Optimization Algorithms, Energy Efficiency, Network Lifetime,  
Performance Analysis, Routing Algorithm.  
INTRODUCTION  
Wireless Sensor Networks (WSNs) have emerged as a key enabling technology for a wide range of  
applications including environmental monitoring, disaster management, healthcare systems, smart agriculture,  
industrial automation, and military surveillance. A WSN typically consists of a large number of low-cost,  
resource-constrained sensor nodes that are deployed to sense, process, and transmit data to a central base  
station or sink. Despite their widespread adoption, WSNs face significant challenges due to limitations in  
battery power, processing capability, memory, and communication bandwidth. These constraints make  
performance optimization a critical research problem in the design and deployment of efficient wireless sensor  
networks. One of the most critical challenges in WSNs is energy efficiency, as sensor nodes are usually  
powered by non-rechargeable batteries and are often deployed in inaccessible or harsh environments.  
Excessive energy consumption directly reduces network lifetime and degrades overall system performance.  
Communication operations, particularly data transmission and reception, consume a major portion of the  
node’s energy budget. Therefore, the design of optimization algorithms that minimize communication  
overhead while maintaining acceptable levels of data reliability and latency is essential. Efficient algorithmic  
solutions can significantly enhance network lifetime without compromising the quality of service (QoS)  
requirements of WSN applications. In addition to energy constraints, WSNs must address issues related to  
scalability, dynamic network topology, node failures, and varying traffic loads. As the number of sensor nodes  
increases, traditional algorithms often fail to scale efficiently, leading to increased congestion, packet loss, and  
delay. Furthermore, sensor nodes may fail due to energy depletion or environmental factors, causing frequent  
topology changes. Optimization algorithms that are adaptive and robust to such dynamics are therefore  
www.ijltemas.in  
Page 780  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
required to ensure reliable data delivery and sustained network performance. Routing and resource  
management are among the most extensively studied areas for performance enhancement in WSNs.  
Conventional routing protocols often rely on static paths or shortest-distance metrics, which may result in  
uneven energy consumption and the premature death of critical nodes, commonly referred to as energy holes.  
Optimization-based routing algorithms aim to distribute the communication load evenly across the network by  
considering multiple performance parameters such as residual energy, hop count, link quality, and traffic  
conditions. Similarly, resource allocation and scheduling algorithms play a crucial role in reducing collisions,  
improving throughput, and minimizing end-to-end delay.  
Architectural View of Nature-Inspired Optimization Algorithms for Performance Analysis  
Recent research has also explored the application of heuristic, metaheuristic, and hybrid optimization  
techniques to address the complex and multi-objective nature of WSN performance optimization. Algorithms  
inspired by natural processes, such as genetic algorithms, particle swarm optimization, and ant colony  
optimization, have demonstrated promising results in balancing conflicting objectives like energy efficiency  
and latency. However, the effectiveness of these algorithms depends heavily on their design, parameter  
selection, and adaptability to varying network conditions. A comprehensive performance analysis is therefore  
necessary to evaluate their suitability for real-world WSN deployments. In this context, this paper focuses on  
the design and performance analysis of optimization algorithms for Wireless Sensor Networks. The primary  
objective is to enhance key performance metrics, including energy consumption, network lifetime, throughput,  
packet delivery ratio, and delay. The proposed algorithms are analysed under different network scenarios to  
assess their efficiency and robustness compared to conventional approaches. By providing a systematic  
evaluation of optimization-driven algorithmic strategies, this study aims to contribute to the development of  
energy-aware and performance-efficient WSN solutions suitable for next-generation wireless sensing  
applications.  
LITERATURE REVIEW  
Wireless Sensor Networks (WSNs) have received significant attention in recent years due to their diverse  
applications in environmental monitoring, healthcare, industrial automation, and military operations. A primary  
concern in WSNs is the efficient processing and transmission of data under stringent resource constraints.  
D’Olne et al. [1] explored latency-agnostic speech enhancement in wireless acoustic sensor networks using  
polynomial eigenvalue decomposition, highlighting the importance of signal processing techniques for timely  
and accurate data delivery. This study underlines the role of advanced algorithms in improving data quality and  
minimizing delays in sensor networks. Routing and energy efficiency are pivotal aspects of WSN design. Fakhri  
et al. [2] proposed a PSO-based cluster head selection (PSO-CHS) protocol aimed at reducing energy  
consumption and enhancing network lifetime. Their findings emphasized the effectiveness of metaheuristic  
optimization techniques for energy-aware routing, which serves as a foundational approach for energy-efficient  
WSN algorithms. Complementing this, Manna et al. [3] presented a hybrid optimization strategy for  
www.ijltemas.in  
Page 781  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
maximizing k-coverage in WSN and IoT networks, addressing both energy efficiency and coverage  
optimization to ensure that sensing tasks are reliably performed without excessive energy expenditure. Security  
and reliability in WSNs have also been a major focus. Zhukabayeva et al. [4] investigated intrusion detection  
and security enhancements in military WSNs, demonstrating the need to integrate algorithmic security  
mechanisms to prevent unauthorized access and maintain network integrity. In parallel, Dhanraj et al. [5]  
emphasized the application of WSNs in biomedical research and healthcare, highlighting challenges related to  
data accuracy, timely delivery, and energy-efficient operation in critical environments. Energy management  
through hardware-software co-optimization has been another key research direction. Kamaruzzaman et al. [6]  
proposed enhancing energy efficiency in wireless rechargeable sensor networks through mobile charger  
scheduling, showing how optimization at the system level can complement algorithmic improvements to extend  
network lifetime. Similarly, Priyadarshi et al. [7] utilized transfer learning for efficient node placement in  
dynamic WSNs, highlighting the importance of adaptive strategies for maintaining connectivity and  
performance under changing network conditions. Communication performance improvements through  
advanced modulation and clustering techniques have been explored by several researchers. V. J et al. [8]  
investigated cooperative virtual MIMO for cluster-based WSNs using DQPSK modulation, demonstrating how  
physical layer enhancements can significantly improve throughput and reliability. Didier et al. [9] proposed  
one-shot distributed node-specific signal estimation in acoustic sensor networks, focusing on reducing  
estimation errors and improving network efficiency by leveraging non-overlapping latent subspaces.  
Hierarchical clustering and protocol optimization have continued to evolve to address energy and scalability  
challenges. Pandey and Malik [10] reviewed trends in energy-efficient hierarchical clustering, from  
enhancements to LEACH to multi-level protocols for emerging IoT applications, indicating the sustained  
relevance of clustering strategies in large-scale WSNs. Hegde and K. V [11] analysed node placement and  
interconnectivity, demonstrating the impact of topology design on energy efficiency and network resilience.  
Finally, Yang et al. [12] focused on enhancing security for intra- and intergroup communications, stressing the  
integration of secure routing and data protection mechanisms as an essential consideration in modern WSN  
deployments.  
PROPOSED METHODOLOGY  
The proposed methodology focuses on the design and performance evaluation of optimization algorithms  
aimed at enhancing the overall efficiency of Wireless Sensor Networks (WSNs). The methodology is  
structured into distinct phases to ensure systematic algorithm development, implementation, and analysis while  
addressing key performance challenges such as energy efficiency, network lifetime, throughput, packet  
delivery ratio, and end-to-end delay.  
1. Network Model and Assumptions: A homogeneous WSN model is considered, where sensor nodes are  
randomly deployed over a predefined sensing area. Each node is equipped with limited battery power,  
processing capability, and communication range. A stationary base station (sink) is located either within or  
outside the sensing field. All nodes are assumed to be static after deployment and capable of adjusting their  
transmission power based on communication distance. The network operates in discrete rounds, and energy  
consumption follows a first-order radio energy model for transmission and reception.  
2. Problem Formulation: The performance enhancement problem is formulated as a multi-objective  
optimization task. The primary objectives include minimizing overall energy consumption, maximizing  
network lifetime, improving packet delivery ratio, and reducing end-to-end delay. These objectives are subject  
to constraints such as limited node energy, bandwidth availability, and network connectivity. A weighted  
fitness function is defined to balance conflicting objectives, enabling the algorithm to select optimal solutions  
based on current network conditions.  
3. Optimization Algorithm Design: The core of the proposed methodology lies in the design of an  
optimization-based algorithm for efficient routing and resource utilization. The algorithm dynamically selects  
optimal communication paths by considering parameters such as residual energy of nodes, distance to the sink,  
link quality, and traffic load. An iterative optimization process is employed to update routing decisions in each  
network round, ensuring balanced energy dissipation and avoidance of overburdened nodes. This adaptive  
www.ijltemas.in  
Page 782  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
behavior enhances network stability and prolongs operational lifetime. To enhance implementation clarity and  
reproducibility, the proposed optimization algorithm follows a well-defined procedural flow. Initially, sensor  
nodes are deployed and initialized with energy, position, and communication parameters. In each network  
round, nodes evaluate their residual energy, distance to the sink, and link quality to identify optimal routing  
paths. A fitness function is computed to balance energy efficiency, communication cost, and network  
performance. Based on the optimization outcome, routing decisions are updated dynamically to ensure  
balanced energy consumption and avoid overloading specific nodes. This iterative process continues until  
termination conditions such as node energy depletion or maximum simulation rounds are reached. The  
structured flow of the algorithm ensures transparent decision-making and facilitates practical implementation  
in real WSN environments.  
4. Energy-Aware Routing and Load Balancing: To prevent premature node failure and energy holes, an  
energy-aware routing mechanism is integrated into the optimization framework. Nodes with higher residual  
energy and better link conditions are prioritized during route formation. Load balancing is achieved by  
periodically updating routes to distribute traffic evenly across multiple paths. This reduces excessive energy  
consumption on critical nodes and improves fault tolerance in the presence of node failures.  
5. Simulation Setup and Performance Evaluation: The proposed optimization algorithm is implemented and  
evaluated using a network simulation environment. Performance metrics such as energy consumption, network  
lifetime, throughput, packet delivery ratio, and end-to-end delay are measured and compared with conventional  
routing and optimization techniques. Simulations are conducted under varying network densities, traffic rates,  
and node energy levels to assess scalability and robustness.  
6. Comparative Analysis and Validation: The final phase involves a comparative analysis between the  
proposed algorithm and existing baseline methods. The results are analysed to highlight performance  
improvements and trade-offs. Sensitivity analysis is also performed to study the impact of algorithm  
parameters on network performance. This comprehensive evaluation ensures that the proposed methodology is  
both efficient and adaptable for real-world WSN applications. The computational complexity of the proposed  
optimization algorithm is primarily dependent on the number of sensor nodes and routing updates performed in  
each round. For a network with N nodes, the algorithm incurs a computational complexity of  
approximately O(N) per round due to local parameter evaluation and routing updates. Since the optimization  
process relies on localized decision-making rather than global network information, control overhead is  
minimized. Periodic routing updates introduce limited control messages, which are significantly lower  
compared to centralized or flooding-based approaches. As a result, the proposed algorithm achieves a  
favorable balance between optimization effectiveness and communication overhead, making it suitable for  
resource-constrained WSN deployments.  
RESULT & ANALYSIS  
This section presents the performance evaluation of the proposed optimization algorithm for Wireless Sensor  
Networks (WSNs). The effectiveness of the proposed approach is analyzed through extensive simulations and  
is compared with conventional routing and optimization schemes. Key performance metrics such as energy  
consumption, network lifetime, throughput, packet delivery ratio (PDR), and end-to-end delay are considered  
to demonstrate the superiority of the proposed algorithm.  
1. Dataset and Simulation Setup: For the performance evaluation of the proposed optimization algorithm, a  
synthetic yet realistic dataset was generated to simulate the behavior of a Wireless Sensor Network. Real-  
world WSN datasets tend to be highly application-specific, making direct comparison difficult; therefore, a  
simulation-based approach was adopted to ensure controlled, reproducible, and benchmark-compliant results.  
The simulation environment was designed using a standard network simulator, with parameters reflecting  
typical WSN deployments and operational conditions. The network configurations included variable numbers  
of sensor nodes—50, 100, 150, and 200—randomly deployed over a square area of 100 meters by 100 meters.  
Each sensor node was initialized with an energy of 2 Joules, while the sink node was fixed at the center of the  
deployment area to facilitate data collection. A first-order radio energy model was used to calculate  
www.ijltemas.in  
Page 783  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
communication energy consumption, accounting for both transmission and reception energy costs. Data traffic  
was generated as Constant Bit Rate (CBR) packets of 512 bytes each, and the simulation was run for 2000  
rounds to capture both short-term and long-term performance trends. The performance of the proposed  
optimization algorithm (POA) was compared against conventional routing protocols, specifically the LEACH  
(Low-Energy Adaptive Clustering Hierarchy) protocol and an Energy-Aware Routing (EAR) scheme. This  
comparative analysis allowed for evaluation under multiple network sizes and performance scenarios,  
highlighting the improvements achieved by the POA in terms of energy efficiency, network lifetime,  
throughput, and packet delivery ratio. Although the primary evaluation is simulation-based, the proposed  
optimization algorithm is designed using standard WSN assumptions and radio energy models commonly  
adopted in real-world deployments. The network parameters and traffic patterns reflect realistic sensing and  
communication behavior observed in practical applications. Moreover, the proposed approach can be readily  
validated using publicly available WSN datasets or small-scale testbeds such as environmental monitoring  
networks, where node energy consumption and data delivery performance can be directly measured. This  
demonstrates the applicability of the proposed algorithm beyond simulation environments and supports its  
potential deployment in real-world WSN scenarios.  
2. Energy Consumption Analysis: Energy consumption is one of the most critical performance metrics in  
Wireless Sensor Networks, as sensor nodes are typically battery-powered and have limited energy resources.  
Efficient energy utilization directly impacts the network’s lifetime and reliability. In this study, the energy  
consumption of the proposed optimization algorithm (POA) was evaluated and compared with the  
conventional LEACH protocol and the Energy-Aware Routing (EAR) scheme across various network sizes.  
The average energy consumption per node was calculated over 2000 simulation rounds, considering both data  
transmission and reception operations. The analysis demonstrates that the proposed algorithm effectively  
balances the communication load among nodes, reducing redundant transmissions and minimizing energy  
depletion in cluster heads and other critical nodes.  
Throughput at Sink Node (Packets)  
Number of Nodes  
50  
LEACH  
0.92  
EAR  
0.78  
Proposed Algorithm  
0.64  
100  
150  
200  
1.48  
2.11  
2.85  
1.26  
1.83  
2.42  
1.02  
1.47  
1.98  
The proposed algorithm achieves a higher PDR due to stable routing paths and reduced congestion, especially  
in dense network scenarios.  
Sink Node Throughput Comparison with Increasing Network Size  
www.ijltemas.in  
Page 784  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
Fig. 2. showing Throughput at the Sink Node (packets) versus Number of Nodes (50, 100, 150, 200) for three  
routing protocols: LEACH, EAR, and the Proposed Algorithm. Throughput increases as the number of nodes  
increases for all protocols. LEACH achieves the highest throughput, followed by EAR, while the Proposed  
Algorithm records comparatively lower throughput across all network sizes.  
3. Network Lifetime Analysis: Network lifetime is a fundamental performance metric in Wireless Sensor  
Networks, indicating the duration for which the network remains operational before critical nodes exhaust their  
energy. One common measure is the number of rounds until the first node dies, which reflects the network’s  
resilience and energy balancing capability. In this study, the network lifetime of the proposed optimization  
algorithm (POA) was evaluated and compared with the conventional LEACH protocol and Energy-Aware  
Routing (EAR) across different network sizes. The POA incorporates energy-aware routing and load-balancing  
strategies that distribute communication tasks more evenly among nodes, preventing premature energy  
depletion in specific nodes or cluster heads. As a result, the proposed algorithm demonstrates a significantly  
longer network lifetime compared to LEACH and EAR, particularly as network density increases. This  
improvement underscores the effectiveness of the POA in extending operational periods, ensuring reliable data  
transmission, and enhancing the overall sustainability of the WSN.  
Network Lifetime (Rounds Until First Node Dies)  
Number of Nodes  
50  
LEACH  
780  
EAR  
940  
Proposed Algorithm  
1120  
100  
150  
200  
620  
470  
350  
810  
650  
520  
980  
830  
710  
The proposed optimization algorithm significantly extends network lifetime by preventing early depletion of  
critical nodes, demonstrating better load distribution across the network.  
Comparison of Network Lifetime Across Different Network Sizes  
Fig. 3. illustrating Network Lifetime (rounds until the first node dies) versus Number of Nodes (50, 100, 150,  
200) for LEACH, EAR, and the Proposed Algorithm. Network lifetime decreases as the number of nodes  
increases for all schemes. The Proposed Algorithm consistently achieves the longest network lifetime,  
followed by EAR, while LEACH shows the shortest lifetime across all network sizes.  
4. Throughput Performance: Throughput is a critical metric for evaluating the efficiency and reliability of  
data delivery in Wireless Sensor Networks. It measures the total number of packets successfully received at the  
www.ijltemas.in  
Page 785  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
sink node over a given period, reflecting the network’s capacity to handle traffic under different conditions. In  
this study, the throughput of the proposed optimization algorithm (POA) was analyzed and compared with the  
conventional LEACH protocol and Energy-Aware Routing (EAR) for varying network sizes. The POA  
improves throughput by optimizing routing paths, minimizing packet collisions, and balancing the data  
transmission load among nodes. Simulation results indicate that the proposed algorithm consistently achieves  
higher throughput at the sink node, even as network density increases, demonstrating its ability to support  
efficient and reliable data communication. This enhancement is particularly important for applications  
requiring timely and accurate data collection.  
Throughput at Sink Node (Packets)  
Number of Nodes  
LEACH  
18,200  
EAR  
21,450  
Proposed Algorithm  
25,300  
50  
100  
150  
200  
29,600  
37,800  
44,200  
34,100  
42,900  
49,700  
39,800  
48,600  
56,400  
Higher throughput in the proposed approach indicates efficient data aggregation and reduced packet loss  
during transmission.  
Sink Node Throughput Comparison for Large-Scale Networks  
Fig. 4. showing Throughput at the Sink Node (packets) versus Number of Nodes (50, 100, 150, 200) for  
LEACH, EAR, and the Proposed Algorithm. Sink node throughput increases with network size for all  
schemes. The Proposed Algorithm consistently achieves the highest throughput, followed by EAR, while  
LEACH records the lowest throughput across all node densities. The performance results highlight an inherent  
trade-off between energy efficiency and throughput in Wireless Sensor Networks. While aggressive data  
transmission strategies can improve throughput, they often lead to rapid energy depletion and reduced network  
lifetime. The proposed optimization algorithm addresses this trade-off by prioritizing balanced energy  
consumption while maintaining acceptable throughput levels. By distributing communication loads and  
avoiding energy-intensive routing paths, the algorithm slightly limits peak throughput in favor of prolonged  
network operation and sustained reliability. This trade-off is particularly suitable for long-term monitoring  
applications where network longevity is more critical than maximum data rate.  
5. Packet Delivery Ratio Analysis: Packet Delivery Ratio (PDR) is a vital performance metric in Wireless  
Sensor Networks, representing the reliability of the network by measuring the percentage of data packets  
successfully received at the sink node compared to those transmitted by the sensor nodes. A higher PDR  
www.ijltemas.in  
Page 786  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
indicates better network reliability and efficient data transmission. In this study, the PDR of the proposed  
optimization algorithm (POA) was evaluated against the conventional LEACH protocol and Energy-Aware  
Routing (EAR) across various network sizes. The POA enhances packet delivery by selecting optimal routing  
paths, reducing packet collisions, and effectively managing network congestion. Simulation results  
demonstrate that the POA consistently achieves a higher packet delivery ratio, even as the number of nodes  
increases, indicating its robustness and reliability in maintaining consistent data transmission. This  
improvement highlights the algorithm’s effectiveness in supporting applications where dependable and  
accurate data delivery is critical.  
Packet Delivery Ratio (%)  
Number of Nodes  
50  
LEACH  
88.6  
EAR  
91.4  
Proposed Algorithm  
95.2  
100  
150  
200  
84.3  
80.7  
76.5  
89.1  
86.8  
83.2  
93.6  
91.9  
89.4  
The proposed algorithm achieves a higher PDR due to stable routing paths and reduced congestion, especially  
in dense network scenarios.  
Packet Delivery Performance Across Different Network Sizes  
Fig. 5. illustrating Packet Delivery Ratio (%) versus Number of Nodes (50, 100, 150, 200) for LEACH, EAR,  
and the Proposed Algorithm. Packet delivery ratio decreases as network size increases for all schemes. The  
Proposed Algorithm consistently achieves the highest packet delivery ratio, followed by EAR, while LEACH  
shows the lowest performance across all node densities.  
3. End-to-End Delay Analysis: End-to-end delay is a key performance metric in Wireless Sensor Networks,  
representing the total time taken for a data packet to travel from a source node to the sink node. It reflects the  
network’s responsiveness and efficiency in data delivery, which is particularly important in time-sensitive  
applications such as environmental monitoring, healthcare, and industrial automation. In this study, the  
average end-to-end delay was measured for the proposed optimization algorithm (POA) and compared with the  
conventional LEACH protocol and Energy-Aware Routing (EAR) under varying network sizes. The analysis  
accounts for factors such as routing efficiency, congestion, and packet retransmissions. Results indicate that  
the POA significantly reduces end-to-end delay by optimizing routing paths and balancing traffic loads,  
ensuring faster and more reliable data delivery even in dense networks. This improvement demonstrates the  
algorithm’s ability to enhance network performance without compromising energy efficiency or reliability.  
www.ijltemas.in  
Page 787  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
Average End-To-End Delay (MS)  
Number of Nodes LEACH  
50 148  
EAR  
132  
Proposed Algorithm  
108  
100  
150  
200  
196  
238  
289  
174  
212  
261  
145  
176  
214  
The reduction in delay highlights the efficiency of the proposed optimization algorithm in selecting reliable  
and shorter communication paths.  
End-to-End Delay Comparison Across Different Network Sizes  
Fig. 6. showing Average End-to-End Delay (milliseconds) versus Number of Nodes (50, 100, 150, 200) for  
LEACH, EAR, and the Proposed Algorithm. End-to-end delay increases as the number of nodes increases for  
all schemes. The Proposed Algorithm consistently exhibits the lowest delay, followed by EAR, while LEACH  
experiences the highest delay across all network sizes.  
CONCLUSION  
This paper presented the design and performance analysis of a proposed optimization algorithm (POA) for  
enhancing the efficiency and reliability of Wireless Sensor Networks. Through comprehensive simulations, the  
POA demonstrated significant improvements over conventional protocols such as LEACH and Energy-Aware  
Routing in terms of energy consumption, network lifetime, throughput, end-to-end delay, and packet delivery  
ratio. The algorithm effectively balances communication loads, optimizes routing paths, and minimizes energy  
depletion, thereby extending the operational lifetime of the network while maintaining high data reliability.  
These results highlight the potential of optimization-driven approaches in addressing the inherent limitations of  
resource-constrained WSNs. For future research, the proposed algorithm can be further enhanced by  
incorporating machine learning techniques for adaptive routing, supporting heterogeneous networks with  
varied node capabilities, and integrating security-aware optimization to protect against data attacks, making it  
suitable for large-scale, real-world WSN deployments in dynamic environments.  
REFERENCES  
1. E. D’Olne, V. W. Neo and P. A. Naylor, "Latency-Agnostic Speech Enhancement for Wireless  
Acoustic Sensor Networks Using Polynomial Eigenvalue Decomposition," 2024 18th International  
www.ijltemas.in  
Page 788  
INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,  
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)  
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIV, Issue XII, December 2025  
Workshop on Acoustic Signal Enhancement (IWAENC), Aalborg, Denmark, 2024, pp. 235-239, doi:  
10.1109/IWAENC61483.2024.10694321.  
2. I. S. Fakhri, H. A. Marhoon and M. H. Hussein, "PSO-CHS Routing Protocol for Energy Consumption  
Enhancement in Wireless Sensor Networks," 2024 4th International Conference on Mobile Networks  
and  
Wireless  
Communications  
(ICMNWC),  
Tumkuru,  
India,  
2024,  
pp.  
1-6,  
doi:  
10.1109/ICMNWC63764.2024.10872010.  
3. P. Manna, S. Majumder and N. H. Singh, "A Hybrid Optimization Strategy for k-Coverage  
Maximization in Wireless Sensor and IoT Networks," 2025 3rd International Conference on Intelligent  
Systems, Advanced Computing and Communication (ISACC), Silchar, India, 2025, pp. 659-665, doi:  
10.1109/ISACC65211.2025.10969350.  
4. T. Zhukabayeva, A. Adamova and N. Karabayev, "Design of Intrusion Detection and Security  
Enhancements in Military Wireless Sensor Networks," 2024 7th International Conference on Signal  
Processing and Information Security (ICSPIS), Dubai, United Arab Emirates, 2024, pp. 1-6, doi:  
10.1109/ICSPIS63676.2024.10812627.  
5. A. Dhanraj, B. A. Attar, S. Sharma and U. Kshirsagar, "Applications Of Wireless Sensor Networks in  
Biomedical Research and Healthcare," 2024 IEEE International Conference on Control & Automation,  
Electronics, Robotics, Internet of Things, and Artificial Intelligence (CERIA), Bandung, Indonesia,  
2024, pp. 1-5, doi: 10.1109/CERIA64726.2024.10915089.  
6. M. Kamaruzzaman, A. Chandra and M. Azharuddin, "On the Enhancement of Energy Efficiency of  
Wireless Rechargeable Sensor Networks through Mobile Charger Scheduling," 2024 International  
Conference on Distributed Computing and Optimization Techniques (ICDCOT), Bengaluru, India,  
2024, pp. 1-5, doi: 10.1109/ICDCOT61034.2024.10515335.  
7. R. Priyadarshi, S. S. Bagri, R. Ranjan and Sundaram, "Transfer Learning for Efficient Node Placement  
in Dynamic Wireless Sensor Networks," 2024 IEEE 16th International Conference on Computational  
Intelligence and Communication Networks (CICN), Indore, India, 2024, pp. 147-152, doi:  
10.1109/CICN63059.2024.10847348.  
8. V. J, B. K, N. K and A. M, "Performance Enhancement of Co-Operative Virtual MIMO for Cluster  
Based Wireless Sensor Network using DQPSK Modulation Scheme," 2025 1st International  
Conference on Radio Frequency Communication and Networks (RFCoN), Thanjavur, India, 2025, pp.  
1-5, doi: 10.1109/RFCoN62306.2025.11085338.  
9. P. Didier, P. Behmandpoor, T. v. Waterschoot and M. Moonen, "One-Shot Distributed Node-Specific  
Signal Estimation with Non-Overlapping Latent Subspaces in Acoustic Sensor Networks," 2024 18th  
International Workshop on Acoustic Signal Enhancement (IWAENC), Aalborg, Denmark, 2024, pp.  
260-264, doi: 10.1109/IWAENC61483.2024.10694548.  
10. A. Pandey and A. Malik, "Trends in energy efficient hierarchical clustering for wireless sensor  
networks: from LEACH enhancements to multi-level protocols in emerging IoT applications," 2025  
International Conference on Electronics, AI and Computing (EAIC), Jalandhar, India, 2025, pp. 1-6,  
doi: 10.1109/EAIC66483.2025.11101509.  
11. M. S. Hegde and S. K. V, "Placement and Interconnectivity in Wireless Sensor Networks," 2024 Third  
International Conference on Artificial Intelligence, Computational Electronics and Communication  
System (AICECS), MANIPAL, India, 2024, pp. 1-6, doi: 10.1109/AICECS63354.2024.10957262.  
12. C. -N. Yang, J. -C. You and P. -C. Yu, "Enhancement of Security for Intragroup and Intergroup  
Wireless Sensor Network," 2025 10th International Conference on Computer and Communication  
System (ICCCS), Chengdu, China, 2025, pp. 1-6, doi: 10.1109/ICCCS65393.2025.11069573.  
www.ijltemas.in  
Page 789