Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Proceedings of the 3rd international conference on Embedded networked sensor systems
Deploying a Wireless Sensor Network on an Active Volcano
IEEE Internet Computing
Probabilistic model of triangulation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Can you see me now? sensor positioning for automated and persistent surveillance
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An underwater sensor allocation scheme for a range dependent environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Supporting range queries on web data using k-nearest neighbor search
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Vector method based coverage hole recovery in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication
International Journal of Sensor Networks
Hi-index | 0.00 |
To obtain a satisfied performance of wireless sensor network, an adaptable sensor deployment method for various applications is essential. In this paper, we propose a centralized sensor deployment method, DT-Score, aims to maximize the coverage of a given sensing area with obstacles. The DT-Score consists of two phases. In the first phase, we use a contour-based deployment to eliminate the coverage holes near the boundary of sensing area and obstacles. In the second phase, a deployment method based on the Delaunay Triangulation is applied for the uncovered regions. Before deploying a sensor, each candidate position generated from the current sensor configuration is scored by a probabilistic sensor detection model. A new sensor is placed to the position with the most coverage gains. According to the simulation results, DT-Score can reach higher coverage than grid-based and random deployment methods with the increasing of deployable sensors.