2nd National Conference on Computing, Communication and Sensor Network |
Foundation of Computer Science USA |
CCSN - Number 4 |
None 2011 |
Authors: Prabhudutta Mohanty, Priyaranjan Mohapatra |
c3720b92-72d3-4d75-ad7c-c77d710c4ef6 |
Prabhudutta Mohanty, Priyaranjan Mohapatra . Maximum Coverage in WSN using Optimal Deployment Technique. 2nd National Conference on Computing, Communication and Sensor Network. CCSN, 4 (None 2011), 39-45.
Present sensors are inbuilt with sensing capabilities, battery, mobilization and storage capability, for better monitoring of targets and storage of information regarding targets. The sensors can be static or dynamic, depending upon their application. Since the dynamic sensors are costlier, hence are used for supreme purpose. Here we suggest an algorithm for distributed sensor network consisting of homogeneous static nodes. The nodes are deployed as per the graphical illustration regarding the area. This approach is carried out to solve the hole problem and to perform efficient monitoring with minimum number of nodes. Here nodes are deployed statically, one by one, sensing each target in a given field, and thus completing the entire field. This algorithm produces cover set, consisting of sensor nodes, which would monitor the field consisting of targets, completely. A number of cover sets can be generated using the same technique to improve the life period.