Wireless Sensor Networks (WSN) consists of nodes with limited power deployed in the area of interest. Nodes cooperate to collect, transmit and forward data to a base station. In WSN, clustering and scheduling techniques ensure collecting data in an energy efficient manner. In this work, we have reviewed many papers relating to clustering and scheduling of sensor network. After reviewing many papers and considering the latest one as the base paper we believe that the work done in it is the latest one, modifications in the work is suggested in this report. This proposal give the basic description of wireless sensor network and their importance in energy efficiency and give a brief about most famous protocol is describes leach and their improved version In this work we have proposed a novel self organizing clustering scheme which considers the real time parameters for setting up the clusters for data collection. Unlike several proposed algorithm, this scheme re-clusters the network only when CH fall below a threshold level. Repeated unnecessary clustering in every round depletes the energy of the network more quickly. We have introduced heterogeneity in the proposed work. By virtue of heterogeneity in terms of energy, lifetime of the network can be extended. An algorithm is functional if the area of interest is covered by active nodes. The period for which the network is functional is termed as persistent period in our work. Simulation results show that the proposed scheme is comparatively more energy efficient, scalable robust and has longer persistent period. And later part of the proposal gives the advantage and disadvantage of these protocols.