Minimum Clustering based Spanning Tree with Optimal Energy Routing for Wireless Sensor Network - A Survey

Authors : R.S.Janani; Dr. R.Asokan; Dr. K.Muthumanickam

Volume/Issue : Volume 5 - 2020, Issue 9 - September

Google Scholar :

Scribd :

Wireless Sensor Network (WSN) clustering structure offer many features like network scalability, communication overhead reduction, and fault tolerance. When aggregate information is transferred to sink node, it reducing unnecessary redundant data transfer, reduces nodes transmitting and saves energy consumption. In addition, WSN allows scalability nodes, reduces communication overhead, and allows efficient use of WSN resources. Cluster based routing methods manage network energy consumption efficiently. Building spanning trees for data collection rooted at a sink node fundamental data aggregation method in sensor networks. The Minimum Spanning Tree (MST) based clustering approach can identify clusters of arbitrary form by using eliminating inconsistent edges that be addressed MST-primarily based clustering algorithms. In this paper, we present a modified minimum spanning tree algorithm with optimal route discovery for WSN. The proposed algorithm is capable of route data to the destination with maximum throughput, minimum delay and reduces packet loss. Moreover, performs better than existing routing algorithm in WSN

Keywords : Wireless Sensor Network, Minimum Spanning Tree, Transmitting, Clustering and Data Transfer


Paper Submission Last Date
30 - September - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.