— In the existing system is only find in cluster head using cluster based routing protocol algorithm. This algorithm is not based in energy level of cluster head selection. The cluster head can communicate with other cluster heads, member nodes and gateways. That time the cluster head energy level is low. So the cluster head can’t communicate with other nodes. That the same time the congestion will be occurs and packet can’t be transfer in the nodes. It will take more time to complete the packet transmission. This approach illustrates that the proposed method is a routing protocol. The proposed research we have used no of connection in a group or cluster. Every cluster has a cluster head and the cluster head directly interconnect with the improper place. The results of proposed method are comparison with existing Leach Protocol. Here base connection is located to equal distance of a cluster and it’s directly communicating to the cluster connection. When a cluster or group is selected after that it’s force level is not considered. This method is increasing to life instance of network. As compare LEACH and Proposed method, we have noticed proposed methodhave better force, life time, less delay, better transmission and consumed less time. LEACH Protocol is based on the cluster to make comparison of native parameters so that we design the proposed methodl cluster based. Cluster used no of group to increase the performance. This consist many advantages which are listed below. Existing Number of groups are low. We can analyses more number of groups here. Every group’s stage check in this proposed research. Proposed method routing protocol have better result as compared to LEACH protocol. As cluster-head dies, series is rebuilt to bypass the deceased node. So the initial topology is not affected. Head node receives all the aggregated data moreover transmits further to cluster-head.