Surface Coverage in Wireless Sensor Networks Based on Delaunay Tetrahedralization

3rd International Conference on Mathematical Modeling in Physical Sciences

物理学;数学

Ribeiro, M.G.^1 ; Neves, L.A.^1 ; Pinto, A.R.^2 ; Nascimento, M.Z.^3 ; Zafalon, G.F.D.^1 ; Valêncio, C.^1

São Paulo State University (UNESP), Department of Computer Science and Statistics (DCCE), Brazil^1

Universidade Federal de Santa Catarina, Campus de Blumenau, Brazil^2

Federal University of Uberlandia, FACOM, Brazil^3

关键词: 3D Voronoi diagrams;    Candidate positions;    Delaunay algorithm;    Delaunay tetrahedralization;    Dijkstra algorithms;    Performance evaluations;    Spatial coordinates;    Surface coverages;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/574/1/012083/pdf
DOI  :  10.1088/1742-6596/574/1/012083

来源: IOP

【 摘 要 】

In this work is presented a new method for sensor deployment on 3D surfaces. The method was structured on different steps. The first one aimed discretizes the relief of interest with Delaunay algorithm. The tetrahedra and relative values (spatial coordinates of each vertex and faces) were input to construction of 3D Voronoi diagram. Each circumcenter was calculated as a candidate position for a sensor node: the corresponding circular coverage area was calculated based on a radius r. The r value can be adjusted to simulate different kinds of sensors. The Dijkstra algorithm and a selection method were applied to eliminate candidate positions with overlapped coverage areas or beyond of surface of interest. Performance evaluations measures were defined using coverage area and communication as criteria. The results were relevant, once the mean coverage rate achieved on three different surfaces were among 91% and 100%.