Sensor placement based on Delaunay triangulation for complete confident information coverage in an area with obstacles

摘要: This paper studies the sensor placement problem for ensuring complete coverage in an area with obstacles. Instead of using simplistic disk model, we adopt our recently proposed confident information model field attribute monitoring applications. We propose a node algorithm based on iterative Delaunay triangulation, which is to first obtain triangles some initial seed nodes. Among all triangles, algorithms find valid one yet largest hole placing new node. The triangulation process then repeated, until Delaunday can be completely covered. Simulation results show that has comparable performance terms number placed nodes, compared peer grid approach discretize continuous field. However, truly achieve significantly smaller computation time.