Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Practical genetic algorithms
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
A survey of application distribution in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Impact of heterogeneity on the deployment of sensor networks
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Structured and real time heterogeneous sensor deployment in preferential areas
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A Best Fit Relocation Approach for Heterogeneous Sensor Networks
Wireless Personal Communications: An International Journal
Genetic algorithm and pure random search for exosensor distribution optimisation
International Journal of Bio-Inspired Computation
Hi-index | 0.00 |
A modeling framework for the problem of deploying a set of heterogeneous sensors in a field with time-varying differential surveillance requirements is presented. The problem is formulated as mixed integer mathematical programwith the objective tomaximize coverage of a given field. Two metaheuristics are used to solve this problem. The first heuristic adopts a genetic algorithm (GA) approach while the second heuristic implements a simulated annealing (SA) algorithm. A set of experiments is used to illustrate the capabilities of the developed models and to compare their performance. The experiments investigate the effect of parameters related to the size of the sensor deployment problem including number of deployed sensors, size of the monitored field, and length of the monitoring horizon. They also examine several endogenous parameters related to the developed GA and SA algorithms.