Abstract: In general, the sensor nodes are constrained by their limited battery power for their energy. The objective is to increase the network life time by gathering and uploading data in a reliable manner. In order to maximize the sensor network life span, the energy management techniques are necessary to minimize the total power consumption of all the nodes in the network. When the sink node seeks data and the node which gathers sensory information which communicates with other connectednodesin the network may affect due to the search of polling point and in turn energy may get wasted. So, our proposed work is to find an exact node efficiently by using a collectible node called CONODE to collect the data at regular intervals of time. Firstly, cluster head is chosen for each cluster by selecting the node which is having the highest energy level and then the Not_Event nodes called CONODE are placed in the range of each cluster. The Not_Event nodes does not sense any event, it has the information about all the sensor nodes event name and its id. Whenever the sink request for the data, the Not_Event node check its buffer and provide its address of its CH and the CH node gathers the data from its members and send that data to the base station. If the data is available at different cluster all the data’s are gathered and fused at fusion centre. The implementation of CONODE is done by region based approach. And also in the case of node failure in the network, i.e., the emergency case, the CONODE collects the data immediately from the particular node. The proposed idea simplifies the previously proposed methods and reduces latency in data collection and improves network lifetime. In the current study, we have proposed an idea to minimize the energy by iterative allocation of CONODE and maximize the data gathering by using a ping pong algorithm. Extensive simulation results have been obtained and analyzed to demonstrate the performance.