Surface coverage in wireless sensor networks based on delaunay tetrahedralization

• Main Author: Ribeiro, Matheus Gonçalves [UNESP]
• Publication Date: 2015
• Other Authors: Neves, Leandro Alves [UNESP], Pinto, Alex Sandro Roschildt, Nascimento, Marcelo Zanchetta do, Zafalon, Geraldo Francisco Donegá [UNESP], Valêncio, Carlos Roberto [UNESP]
• Format: Conference object
• Language: eng
• Source: Repositório Institucional da UNESP
• Download full: http://iopscience.iop.org/article/10.1088/1742-6596/574/1/012083/meta; http://hdl.handle.net/11449/128823

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%.