Ant colony optimization based sensor deployment protocol for wireless sensor networks

被引:48
作者
Liao, Wen-Hwa [1 ]
Kao, Yucheng [1 ]
Wu, Ru-Ting [1 ]
机构
[1] Tatung Univ, Dept Informat Management, Taipei 104, Taiwan
关键词
Ant colony optimization (ACO); Coverage; Sensor deployment; Lifetime;
D O I
10.1016/j.eswa.2010.11.079
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:6599 / 6605
页数:7
相关论文
共 18 条
[1]  
[Anonymous], ACM INT WORKSH WIR S
[2]  
[Anonymous], IEEE WIR COMM NETW C
[3]  
[Anonymous], ACM INT C INF PROC S
[4]  
[Anonymous], INT C WIR INT WICON
[5]  
[Anonymous], IEEE COMPUTER INFORM
[6]  
[Anonymous], IEEE EVOLUTIONARY CO
[7]  
[Anonymous], ACM EMBEDDED NETWORK
[8]  
[Anonymous], ACM MOBILE TECHNOLOG
[9]  
[Anonymous], ACM EMBEDDED NETWORK
[10]  
Cardei M., 2008, Proc. Of WoWMoM, P1