Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 38, Issue 6, Pages 6599-6605Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2010.11.079
Keywords
Ant colony optimization (ACO); Coverage; Sensor deployment; Lifetime
Categories
Funding
- National Science Council, Taiwan [NSC 99-2221-E-036-036-MY2]
- Tatung University [B99-N03-065]
Ask authors/readers for more resources
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. (c) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available