There are several application have been developed with need of self organization for network. To fulfill this requirement need of wireless sensor network in such applications. To manage network efficiently clustering is used. Lots of works have been done in field of wireless sensor networks (WSNs) in last few years. These researches have boost potential of WSNs in applications such as security monitoring, disaster management, military area, border protection and health monitoring systems. Such applications are required to be remotely deployed sensor nodes in huge numbers and to operate autonomously. So there need to scalability, nodes are often collected into disjoint clusters. This paper, presents a categorization and common organization of available clustering proposal. This work analysis various clustering algorithms used for WSNs and give a review with focusing on their objectives features, etc. and proposed efficient clustering method for stable cluster formation and maintenance.

Wireless Sensor Networks (WSNs) are consists of huge number of sensor nodes, restricted with limited power,  for provide services with cooperation to sense data and send to server. Various routing techniques are introduced for managing data transmission in WSNs in last decade. This work proposes novel method with compare distance of sensor nodes to base station in heterogeneous WSN. The sensor nodes near to base station are likely to send data direct to base station and nodes are long distance to base station would form cluster to send data using Stable Election Protocol (SEP) method. This work considers distance parameter to compare with base station position to decide whether need for nodes clustering or not. The proposed method further compare with existing Low Energy adaptive clustering hierarchy (LEACH) protocol and SEP protocol for WSN data transmission. The proposed method simulation results show the effectiveness with compare to existing methods.