నైరూప్య

Minimize the end to end delay and Maximize the coverage of Wireless sensor nodes using Data Fusion Distributed Truncated Greedy algorithm

A.Saravanan, M.Rajaguru, S.Kailasam

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.