The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor network-based countersniper system
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Proceedings of the 5th international conference on Information processing in sensor networks
Ants and Multiple Knapsack Problem
CISIM '07 Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications
Movement-assisted sensor redeployment scheme for network lifetime increase
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
A new ant colony optimization algorithm for the multidimensional Knapsack problem
Computers and Operations Research
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data aggregation in wireless sensor networks using ant colony algorithm
Journal of Network and Computer Applications
A moving algorithm for non-uniform deployment in mobile sensor networks
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Non-uniform sensor deployment in mobile wireless sensor networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 12.05 |
Sensor deployment is one of the most important issues in wireless sensor networks, because an efficient deployment scheme can reduce the deployment cost and enhance the detection capability of the wireless sensor networks. In addition, it can enhance the quality of monitoring in wireless sensor networks by increasing the coverage area. Ant colony optimization (ACO) algorithm provides a natural and intrinsic way of exploration of search space for multiple knapsack problem (MKP). In this work, we consider the problem of sensor deployment to achieve complete coverage of the service region and maximize the lifetime of the network. We model the deployment problem as the multiple knapsack problem. Based on ACO algorithm, we proposed a deployment scheme to prolong the network lifetime, while ensuring complete coverage of the service region. The simulations show that our algorithm can prolong the lifetime of the network.