Maximizing the network lifetime of clustered-based WSN using probability of residual energy

• Published in: 2014 IEEE International Conference on Control System, Computing and Engineering (ICCSCE 2014) pp. 178 - 183
• Main Authors: Abdullah, Jiwa, Zeni, Saltihie
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-11-2014
• Subjects: Analytical models; Base stations; Clustering algorithms; LEACH; modified algorithm; network lifetime; power consumption; Protocols; Steady-state; Time division multiple access; Wireless sensor networks; WSN
• DOI: 10.1109/ICCSCE.2014.7072711

The deployment of Wireless Sensor Network(WSN) must be done with some kind of advanced techniques so that it can mitigate the energy constraints. An existing, clustered-based routing protocol known as Low-Energy Adaptive Clustering Hierarchy (LEACH) was studied, the outcome is an improved algorithm based on LEACH. The performance of these algorithms was studied through simulations using OMNeT++. In the original LEACH, the Cluster Heads selections were based on a distributed algorithm. For the modified algorithm, the improvement was done in the Cluster Head selection process. The selection process takes into account the residual energy of each node and used its probability outcome for the determination of the threshold value for next round. The results concluded that the performance of the modified algorithm is better than the original LEACH, the outcome will result in maximizing network lifetime.