Art gallery theorems and algorithms
Art gallery theorems and algorithms
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
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
A frontier-based approach for autonomous exploration
CIRA '97 Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Deploying a Wireless Sensor Network on an Active Volcano
IEEE Internet Computing
A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Experiment design for parameter estimation in sensing models
WiFlex'13 Proceedings of the First international conference on Wireless Access Flexibility
Hi-index | 0.00 |
The paper studies the deployment problem of wireless sensor networks using one or multiple autonomous agents. An online incremental algorithm based on Voronoi partition is proposed to solve the problem, for which each agent deploys sensors one-at-a-time with the objective of using less number of sensors to cover an area and maintain communication connectivity. A probabilistic sensor sensing model is applied for area coverage evaluation. The shape of target area is assumed to be known by the agents, but how the environment affects the communication is unknown a priori. Therefore, the agents are desired to autonomously place every new sensor at an appropriate location based on deployed sensors to ensure connectivity and coverage specifications. Both simulations and experiments using our self-made wireless sensors are conducted to validate the algorithm.