Ant colony optimization based sensor deployment protocol for wireless sensor networks
Ant colony optimization based sensor deployment protocol for wireless sensor networks
复制标题
DOI：
10.1016/j.eswa.2010.11.079
复制
发表时间：
2011-06
期刊：
影响因子：
--
通讯作者：
Wen-Hwa Liao;Yucheng Kao;Ru-Ting Wu
中科院分区：
文献类型：
--
作者：
Wen-Hwa Liao;Yucheng Kao;Ru-Ting Wu
传感器部署是无线传感器网络中最重要的问题之一，因为有效的部署方案可以降低部署成本，提高无线传感器网络的检测能力。此外，它可以提高无线传感器网络的监测质量，通过增加覆盖区域。蚁群算法为求解多背包问题提供了一种自然的、内在的搜索空间探索方式。在这项工作中，我们考虑的问题，传感器的部署，以实现完全覆盖的服务区域，并最大限度地提高网络的生命周期。我们将部署问题建模为多背包问题。基于蚁群优化算法，提出了一种在保证服务区域完全覆盖的同时延长网络生存时间的部署方案。仿真结果表明，该算法可以延长网络的生存时间。
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.