An Efficient Approach of Deployment and Target Coverage in Wireless Sensor Networks
Surbhi Sachdeva1, Naresh Kumar2
1Surbhi Sachdeva, Research Scholar, HCTM Technical Campus, Kaithal (Haryana), India.
2Er. Naresh Kumar, Assistant Professor, HCTM Technical Campus, Kaithal (Haryana), India.
Manuscript received on 10 August 2017 | Revised Manuscript received on 18 August 2017 | Manuscript Published on 30 August 2017 | PP: 145-149 | Volume-6 Issue-6, August 2017 | Retrieval Number: F5151086617/17©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Sensing a given particular zone is one of the main goals of wireless sensor networks. This consists of deploying the sensor nodes in order to detect any event occurring in a particular zone of interest and gives this information to the sink. It should also be energy efficient so as to maximize the network lifetime. The lifetime maximization in sensors network with target coverage can be considered as: To divide the sensors in set covers in such a way that each set cover can cover all the targets at a particular instant of time. We have to find maximal number of set covers which becomes active successively. This arrangement can maximize the lifetime of the network. In this paper, I have proposed an efficient SDSG algorithm that produces maximum number of disjoint sets of the sensors, such that each sensor set is a set-cover. I have also compared proposed algorithm with Simple Greedy and Greedy MSSC algorithm.
Keywords: SDSG, Greedy MSSC, Networks
Scope of the Article: WSN