International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences |
Foundation of Computer Science USA |
ICIIIOES - Number 12 |
December 2013 |
Authors: Tamilselvi. B, Hemalatha. R |
ba09f7a9-a55a-4180-8111-03575a7e49d8 |
Tamilselvi. B, Hemalatha. R . Covergae Verifiction using Dimension Reduction in Wireless Sensor Network. International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences. ICIIIOES, 12 (December 2013), 23-27.
Wireless sensor network (WSN) have recently come forth as an eminent technology for monitoring and event detection application. In WSN a large number of sensor nodes perform sensing of a target field. The target field is said to be ?-covered, if its every point is within the sensing range of at least ?- sensors. The ?-coverage verification algorithm is proposed for verifying ?-coverage of a d-dimensional target field. The coverage verification problem in d-dimensional is reduced to (d-1) dimension by the use of dimension reduction technique based on divide and conquer approach. The algorithm proposed in this paper is distributed polynomial-time coverage verification algorithm which does not use location information. For keeping bandwidth and computational overhead as low as possible the efficient broadcasting is done between the nodes. The simulation result proven that it detects coverage hole if and if only the target field has a coverage hole in it.