Computational geometry based coverage hole-detection and hole-area estimation in wireless sensor network

Article type: Research Article

Authors: Das, Smita^{; *} | Kanti DebBarma, Mrinal

Affiliations: Department of Computer Science & Engineering, National Institute of Technology, Agartala, Tripura, India. E-mails: [email protected], [email protected]

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: Now-a-days Wireless Sensor Networks (WSNs) have massive significance in different surveillance related applications where coverage plays an important role. While arranging the sensor nodes in a large scale WSN, covering the region of interest (ROI) is a complicated job and this quality of coverage is compromised in the presence of coverage holes. As holes can cause permanent or temporary interruption in sensing or in communicating task, therefore detection of holes in a coverage area is an essential job. In this paper, we first construct a Delaunay Triangle on the basis of node location information. Then we propose an algorithm based on the property of empty circle to recognize whether coverage hole is present or not in the given ROI of a large scale WSN. Also, we have estimated the area of the coverage-hole based on computational geometry. We have shown the correctness of the algorithm based on the theoretical proofs. Simulations are also conducted to show the effectiveness of the algorithm for coverage-hole detection and area estimation (CHDAE).

Keywords: Wireless sensor networks, sensor nodes, coverage, coverage hole-detection, empty circle, Delaunay Triangulation

DOI: 10.3233/JHS-180595

Journal: Journal of High Speed Networks, vol. 24, no. 4, pp. 281-296, 2018