Constrained coverage for mobile sensor networks
Sameera Poduri, Gaurav S. Sukhatme · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 2004
We consider the problem of self-deployment of a mobile sensor network. We are interested in a deployment strategy that maximizes the area coverage of the network with the constraint that each of the nodes has at least K neighbors, where K is a user-specified parameter. We propose an algorithm based on artificial potential fields which is distributed, scalable and does not require a prior map of the environment. Simulations establish that the resulting networks have the required degree with a high probability, are well connected and achieve good coverage. We present analytical results for the coverage achievable by uniform random and symmetrically tiled network configurations and use these to evaluate the performance of our algorithm.
Cited by 537 works. doi:10.1109/robot.2004.1307146
Authors
References
- Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
- Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem
- Connecting the physical world with pervasive networks
- Most valuable player: a robot device server for distributed control
- Introduction to the Theory of Coverage Processes.
- The Number of Neighbors Needed for Connectivity of Wireless Networks
- Command Control for Many-Robot Systems
- Social potential fields: A distributed behavioral control for autonomous robots
- Social potentials for scalable multi-robot formations
- Spreading Out: A Local Approach to Multi-robot Coverage