Improved Cuckoo Search and Chaotic Flower Pollination optimization algorithm for maximizing area coverage in Wireless Sensor Networks

被引:69
作者
Huynh Thi Thanh Binh [1 ]
Nguyen Thi Hanh [1 ,2 ]
La Van Quan [1 ]
Dey, Nilanjan [3 ]
机构
[1] Hanoi Univ Sci & Technol, Hanoi, Vietnam
[2] Phuong Dong Univ, Hanoi, Vietnam
[3] Techno India Coll Technol, Kolkata, India
关键词
Wireless Sensor Networks; Chaotic Flower Pollination algorithm; Improved Cuckoo Search algorithm; Area coverage in Wireless Sensor Networks;
D O I
10.1007/s00521-016-2823-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The popularity of Wireless Sensor Networks (WSNs) is rapidly growing due to its wide-ranged applications such as industrial diagnostics, environment monitoring or surveillance. High-quality construction of WSNs is increasingly demanding due to the ubiquity of WSNs. The current work is focused on improving one of the most crucial criteria that appear to exert an enormous impact on the WSNs performance, namely the area coverage. The proposed model is involved with sensor nodes deployment which maximizes the area coverage. This problem is proved to be NP-hard. Although such algorithms to handle this problem with fairly acceptable solutions had been introduced, most of them still heavily suffer from several issues including the large computation time and solution instability. Hence, the existing work proposed ways to overcome such difficulties by proposing two nature-based algorithms, namely Improved Cuckoo Search (ICS) and Chaotic Flower Pollination algorithm (CFPA). By adopting the concept of calculating the adaptability and a well-designed local search in previous studies, those two algorithms are able to improve their performance. The experimental results on 15 instances established a huge enhancement in terms of computation time, solution quality and stability.
引用
收藏
页码:2305 / 2317
页数:13
相关论文
共 11 条
[1]  
[Anonymous], [No title captured]
[2]  
Hanh NT, 2016, SAI INT SYST C 2016
[3]   Spatial-Temporal Coverage Optimization in Wireless Sensor Networks [J].
Liu, Changlei ;
Cao, Guohong .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (04) :465-478
[4]  
Ly D.T. H., 2015, P 6 INT S INFORM COM, P61
[5]  
Nakisa Bahareh, 2014, Journal of Computer Science, V10, P1758, DOI 10.3844/jcssp.2014.1758.1765
[6]   Probabilistic Dynamic Deployment of Wireless Sensor Networks by Artificial Bee Colony Algorithm [J].
Ozturk, Celal ;
Karaboga, Dervis ;
Gorkemli, Beyza .
SENSORS, 2011, 11 (06) :6056-6065
[7]   Survey on Coverage Problems in Wireless Sensor Networks [J].
Sangwan, Anju ;
Singh, Rishi Pal .
WIRELESS PERSONAL COMMUNICATIONS, 2015, 80 (04) :1475-1500
[8]   Coverage Problems in Sensor Networks: A Survey [J].
Wang, Bang .
ACM COMPUTING SURVEYS, 2011, 43 (04)
[9]   Cuckoo Search via Levey Flights [J].
Yang, Xin-She ;
Deb, Suash .
2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009), 2009, :210-+
[10]   Multi-objective Flower Algorithm for Optimization [J].
Yang, Xin-She ;
Karamanoglu, Mehmet ;
He, Xingshi .
2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 :861-868