AHSWN Home • Issue Contents • Forthcoming Papers
A Coverage-Hole Boundary Detection approach based on Tree-Traversal in Wireless Sensor Networks
Smita Das and Mrinal Kanti Debbarma
Abstract—Coverage-hole is an uncovered region that can seriously affect the performance of the Wireless Sensor Networks (WSNs) by causing permanent or temporary interruption in data transmission task. While detecting such coverage-holes, the most important task is to identify the bdry nodes outlining those holes. In this paper, our main goal is to identify the hole-boundary using the computational geometry based technique so that we can prevent the enlargement of coverage-holes. Initially, a rough hole-boundary is identified followed by tree-formulation for actual hole-boundary detection. Finally, refined hole-boundary is determined from the rough hole-boundary, based on binary tree traversal. Performance analysis of the algorithm is done on the basis of relation between number of deployed nodes, communication radius and size of Region of Interest (RoI) with average node degree and average number of boundary nodes. In addition, we also have carried out comparison with various existing algorithms on the basis of true-rate and false rate of boundary node detection in association with average hole-boundary identification time and average energy consumption.
Keywords: Wireless Sensor Network; Coverage-hole; Hole-boundary detection; Boundary refinement; Tree conversion