Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
On the complexity of integer programming
Journal of the ACM (JACM)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Packing equal circles in a square: a deterministic global optimization approach
Discrete Applied Mathematics
Uncertainty-aware and coverage-oriented deployment for sensor networks
Journal of Parallel and Distributed Computing
A Probabilistic Signal-Strength-Based Evaluation Methodology for Sensor Network Deployment
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Potential field approach to ensure connectivity and differentiated detection in WSN deployment
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Detection and replacement of a failing node in the wireless sensors networks
Computers and Electrical Engineering
Hi-index | 0.00 |
In this paper, we address a wireless sensor network deployment problem. It is considered when the deployment field is characterized by a geographical irregularity of the monitored event. Each point in the deployment area requires a specific minimum guarantee of event detection probability. Our objective is to generate the best network topology while minimizing cost of deployment, ensuring quality of monitoring and network connectivity, and optimizing network lifetime. The problem is formulated as combinatorial optimization problem, which is NP-complete. Unfortunately, due to the large solution state space and the exponential computational complexity, the exact methods can be applied only in the case of small-scale problem. To overcome the complexity of an optimal resolution, we propose new scalable deployment heuristics based on artificial potential field and Tabu search metaheuristic, namely potential field deployment algorithm (PFDA) and multi-objective deployment algorithm (MODA). We compare our proposal to the related deployment strategies, the obtained results show that PFDA and MODA obtain the best performances.