.png){kind=icon}
返回
Ant colony optimization based sensor deployment protocol for wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.11.079.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Ant colony optimization (ACO)
Coverage
Sensor deployment
Lifetime
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
A new ant colony optimization algorithm for the multidimensional Knapsack problem求解多维背包问题的一种新的蚁群优化算法
PREAI
分享收藏
没有更多内容
没有更多内容