Integrated Trust-Clustering and Dijkstra Routing Algorithms for Energy-Efficient WSNs

Wireless Sensor Networks (WSNs) playa crucial role in various fields but are highly susceptible to external attacks, making the development of secure data aggregation methods in WSNs imperative. To enhance the security of WSNs, this study introduces a Trust-Based Clustering and Dijkstra-Based Routing algorithm (TBC-DBR). The proposed algorithm aims to establish a secure and efficient data aggregation mechanism in WSNs. It begins by dividing the sensor nodes into clusters, creating a structured network architecture. Within each cluster, the members undergo a three-phase trust evaluation process: direct trust, indirect trust, and overall trust. These trust metrics enable the selection of the most trustworthy node as the cluster head, ensuring reliable data aggregation and routing. To evaluate the effectiveness of the proposed algorithm, extensive simulations are performed using MATLAB R2022a. The simulation framework enables a comprehensive performance analysis, comparing the proposed TBC-DBR algorithm with the well-known LEACH algorithm. The evaluation focuses on critical performance metrics such as energy consumption and packet rate delivery throughout the network's lifetime. The results obtained from the simulations demonstrate the superiority of the proposed TBC-DBR algorithm. It exhibits lower energy consumption compared to the LEACH algorithm, indicating improved energy efficiency in the network. Moreover, the proposed algorithm achieves a higher packet rate delivery, emphasizing its effectiveness in maintaining reliable and timely data transmission within the network.