Extending the Lifespan of Wireless Sensor Networks using Graph Theory Approaches

Wireless sensor networks (WSNs) are initiated with a number of sensor nodes with limited resources like energy, memory, and processing power. Among these limitations, minimum availability of energy is a key issue in WSNs. It can be used to create clustering protocols in WSNs that fulfil important system architecture criteria such as secure communication, node movement, multihop technology, energy competence, and on-time data delivery. A number of clustering methods are also used to build a network using graph theory. This reduces the energy consumption and make the network last longer. To some extent, this article provides an overview of graph theory for creating a clustering network in WSNs. This article has estimated the comparison between chain based and tree based/hierarchical routing protocols, which enhance the network lifetime and mitigate the dead nodes in the network. The results of these simulations showed that the proposed LEACH-C protocol can make networks that last much longer than traditional LEACH and PEGASIS protocols.