Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection
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
Packing equal circles in a square: a deterministic global optimization approach
Discrete Applied Mathematics
A distributed diffusion method for dynamic load balancing on parallel computers
PDP '95 Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing
The optimum sensor redeployment scheme using the most frangible clusters set
Computer Communications
The optimization of sensor relocation in wireless mobile sensor networks
Computer Communications
Hi-index | 0.00 |
In wireless sensor networks (WSNs), a good sensor deployment method is vital to the quality of service (QoS) provided by WSNs. This QoS depends on the coverage of the monitoring area. In WSNs with locomotion facilities, sensors can move around and self-deploy to ensure coverage and load balancing. In SMART [1], various optimization problems are defined to minimize different parameters. In this paper, we focus on minimizing total moving distance and propose an optimal, but centralized solution, based on the Hungarian method. We then propose several efficient, albeit non-optimal, distributed solutions based on the scanbased solution in [1]. Extensive simulations have been done to verify the effectiveness of the proposed solutions.