Target coverage is considered as a major problem in case of wireless sensor network. This kind of condition can consequentially reduce the minimum energy consumption. One of the well known technique for this problem is non disjoint set cover problem. In this paper we are trying to realize this target coverage problem in a wireless sensor network environment. Basically we need to consume the energy in various nodes so that the critical period can be handled. A Euclidean based approach is taken where the concept of non disjoint set cover is used for efficient energy consumption. Then a greedy algorithm based approach is proposed where we introduce a uncovered function to find the best solution among a no of solutions (i.e. the nodes) with an aim to maximize the network lifetime with minimum no of utilized sensor nodes.