Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  studies the sensor placement problem for ensuring complete coverage in an area with obstacles. Instead of using the simplistic disk coverage model,  adopt our recently proposed confident information coverage model for field attribute monitoring applications.  propose a node placement algorithm based on iterative Delaunay triangulation, which is to first obtain Delaunay triangles for some initial seed nodes. Among all Delaunay triangles,  propose algorithms to find a valid one yet with the largest coverage hole for placing a new node. The Delaunay triangulation process is then repeated, until all the Delaunday triangles can be completely covered. Simulation results show that our algorithm has comparable performance in terms of the number of placed nodes, compared with a peer algorithm based on a grid approach to discretize the continuous field. Hover, our algorithm can truly achieve complete coverage yet with significantly smaller computation time.
['Lu Dai', 'Bang Wang']
I am writing a research paper on a idea Sensor placement based on Delaunay triangulation for complete confident information coverage in an area with obstacles
[{"from": "human", "value": "I am writing a research paper on a idea Sensor placement based on Delaunay triangulation for complete confident information coverage in an area with obstacles"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  studies the sensor placement problem for ensuring complete coverage in an area with obstacles. Instead of using the simplistic disk coverage model,  adopt our recently proposed confident information coverage model for field attribute monitoring applications.  propose a node placement algorithm based on iterative Delaunay triangulation, which is to first obtain Delaunay triangles for some initial seed nodes. Among all Delaunay triangles,  propose algorithms to find a valid one yet with the largest coverage hole for placing a new node. The Delaunay triangulation process is then repeated, until all the Delaunday triangles can be completely covered. Simulation results show that our algorithm has comparable performance in terms of the number of placed nodes, compared with a peer algorithm based on a grid approach to discretize the continuous field. Hover, our algorithm can truly achieve complete coverage yet with significantly smaller computation time."}]