ABSTRACT: As sensors are energy constrained devices, the main challenge is to minimize the end to end delay by maximizing the coverage area of sensor nodes. Instead of considering the whole network for packet transmission, nodes are formed as clusters based on region. To achieve energy balanced clustering in the network we use the concept called Minimum Weight Sub modular Set Cover (MWSSC), Distributed Truncated Greedy Algorithm (DTGA) can provide a better solution for Minimum Weight Sub modular Set Cover (MWSSC). Though it can achieve Minimum Weight Sub modular Set Cover (MWSSC), but it consumes more energy for data transmission and for sharing local information among their neighbour nodes in the same cluster. This problem can be solved by infusing Data Fusion in Distributed truncated greedy algorithm. . These collected data are sent to base station which acts like a control room. Recent advancement in wireless sensor networks has resulted in a unique capability to the remote sensing environment. These systems are often implemented in remote or the areas where it is hard to be reached. Hence, it is difficult in such networks that operate unattended for long durations. Therefore, extending network lifetime through the efficient use of energy has been a key issue in the development of wireless sensor networks Wireless sensor network typically consist of tens to thousands of nodes. These nodes collect process and Cooperatively pass this collected information to a central location The process of grouping the sensor nodes in a densely deployed large-scale sensor network is known as clustering. The intelligent way to combine and compress the data belonging to a single cluster is known as data aggregation in cluster based environment. The information from the nodes to the sink should be in time. If any delay occurs in transferring the packet, then the packet will be useless. So the network should have minimum delay. So optimally choosing the any cast forwarding policy to minimize the expected end-end delay from all sensor nodes to the sink Communication among number of nodes in a large network for relaying packets consumes lot of energy and takes multi-hop to reach sink node. Rather we can form clusters with small numbers of nodes. Initially, clusters will be formed and we can"t assure that the single node has participated in single cluster. This can be solved using Data fusion Distributed truncated greedy algorithm (DTGA). In which there is no need for all the nodes to be in active in the clusters. Only cluster head needs to be in active and the sensor node will wake up when an event occurs. This clearly shows that the network lifetime can be increased through this data fusio
