A parallel compact cat swarm optimization and its application in DV-Hop node localization for wireless sensor network

Cat swarm optimization (CSO) has been applied to a variety of fields because of the better capacity of searching for optimum and higher robustness. However, the poor convergency and larger memory consumption are still core defects, which restricts the efficiency of optimization to a larger extent. A new heuristic algorithm named Parallel Compact Cat Swarm Optimization (PCCSO) with three separate communication strategies and the concept of the compact are presented in this article. The advantage of PCCSO is not only reflected in enhancing the ability of local search, but also in saving the computer memory. The experimental results on CEC2013 benchmark functions demonstrate that the PCCSO is always superior to PSO, CSO, and improved CSO in getting convergent. Then, the PCCSO is applied to DV-Hop to effectively improve the localization accuracy of unknown nodes while also saving WSN memory. The experimental results based on PCCSO from the different number of sensor nodes also illustrate that the PCCSO-DV-Hop shows a lower localization error compared to other optimization algorithms based on DV-Hop.