• Shiv Kumar

A wireless sensor network (WSN) is consisting of a set of sensor nodes with a limited energy stored in their batteries. Generally, replacing or charging the battery is hard and inefficient. Further, the main critical aspect of applications based on wireless sensor networks is their lifetime. Therefore, judicious power management with optimized routing protocols can effectively optimize the energy consumption of sensor nodes and thus extend the network lifetime. In this paper, an optimized routing protocol for wireless sensor nodes is proposed. We are interested in constructing an efficient routing spanning tree that minimizes the energy consumption among all nodes in the network and fit for WSN with reduced energy for achieving a longer lifetime. The main idea of this algorithm comes from the Minimum Spanning Tree (MST) graph theory. The MMSTC focuses on the minimal hop count of each node to reach the destination (sink node) within an optimal path in a heterogeneous wireless sensor network.

Wireless Sensor Networks; Network lifetime; Energy consumption; Routing protocols; Minimum Spanning Tree

"MMSTC: Modified Minimum Spanning Tree Clustering Scheme Energy Efficient Heterogeneous Wireless Sensor Network", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.629-638, May-2019, Available :http://www.jetir.org/papers/JETIR1905D89.pdf

"MMSTC: Modified Minimum Spanning Tree Clustering Scheme Energy Efficient Heterogeneous Wireless Sensor Network", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp629-638, May-2019, Available at : http://www.jetir.org/papers/JETIR1905D89.pdf