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