Systematic Review of Stable Election Protocols Variants

Abstract

Energy management is one of the critical parameters in large scale WSN. If an individual node in the network communicates and forwards its data directly to BS, there is a maximum probability of network congestion and data collisions. As the sensor nodes have limited battery power, it will result in energy depletion faster and will degrade the overall network lifetime. To optimize the network life and management strategies certain goals like, prolonged network lifetime, scalability, coverage and network simplicity are desirable. To achieve these goals, it is essential to propose an efficient and scalable network layer protocol. To address the above-mentioned issues clustering protocol has been proposed by various researchers. Clustering protocols provide the solution to utilize the network energy uniformly to enhance the network lifetime, maximize the packet delivery ratio and throughput as well clustering of nodes avoids long-distance communication of nodes to BS. Many novel techniques have been proposed by the researchers related to heterogeneous sensor networks and have made their best efforts to overcome the challenges and obstacles but somewhere these theoretically proposed protocols lack deficiencies. In this paper, we have investigated a different variant of Stable Election Protocol which was proposed by various researchers in terms of stable and unstable regions and the number of cluster heads per round.