A Theoretical Analysis Of The Lifetime And Energy Hole In Cluster Based Wireless Sensor Networks

Cluster-based routing in Wireless Sensor Network (WSN) is a well-known technique for efficient communication and scalability. Nevertheless, in many cluster based protocols, due to the complexity of the problem, theoretical analysis and optimality still remains a difficult challenge. This thesis theoretically studies the optimization performance of four selected protocols, which are LEACH (Low Energy Adaptive Clustering Hierarchy), MLEACH (Multihop LEACH), HEED (Hybrid Energy-Efficient Distributed Clustering Approach), and UCR (Unequal Cluster-based Routing).It significant to indicate that, this thesis is the first to talk about maximum FIRST node DIED TIME (FDT) and the maximum ALL node DIED TIME (ADT) as well as the optimal parameters which maximize the network lifetime. Different from the previous analysis of network lifetime, this thesis analyzes the node energy consumption in different regions through mathematical differentiation. Thus, in this thesis the optimal parameters which maximize network lifetime are obtained alongside detailed energy consumption for different regions at different times. Besides, we have also established the time and space evolution of the network, which starts from a steady state (without any death), moves to a non-steady state (with some death of nodes) and finally to the death state (all nodes die). This considerably acquaints us, with the network state from the time and space.To validate our findings, our analytical results have been subjected to series of extensive simulations using Omnet++platform. And it important mention that the margin of variance between the theoretical analysis results and the experimental results is within the acceptable range in application, and for that matter, we confidently say that there is enough scientific evidence to support our findings as a reliable guide for the deployment and optimization of cluster based networks.