Optimization of wireless network node deployment in smart city based on adaptive particle swarm optimization

2020 ◽  
Vol 39 (4) ◽  
pp. 4959-4969
Author(s):  
Weiqiang Wang

In smart city wireless network infrastructure, network node deployment directly affects network service quality. This problem can be attributed to deploying a suitable ordinary AP node as a wireless terminal access node on a given geometric plane, and deploying a special node as a gateway to aggregate. Traffic from ordinary nodes is to the wired network. In this paper, Pareto multi-objective optimization strategy is introduced into the wireless sensor network node security deployment, and an improved multi-objective particle swarm coverage algorithm based on secure connection is designed. Firstly, based on the mathematical model of Pareto multi-objective optimization, the multi-target node security deployment model is established, and the security connectivity and node network coverage are taken as the objective functions, and the problems of wireless sensor network security and network coverage quality are considered. The multi-objective particle swarm optimization algorithm is improved by adaptively adjusting the inertia weight and particle velocity update. At the same time, the elite archive strategy is used to dynamically maintain the optimal solution set. The high-frequency simulation software Matlab and simulation platform data interaction are used to realize the automatic modeling, simulation analysis, parameter prediction and iterative optimization of wireless network node deployment in smart city based on adaptive particle swarm optimization. Under the premise of meeting the performance requirements of wireless network nodes in smart cities, the experimental results show that although the proposed algorithm could not achieve the accuracy of using only particle swarm optimization algorithm to optimize the parameters of wireless network nodes in smart cities, the algorithm is completed. The antenna parameter optimization process takes less time and the optimization efficiency is higher.

Water ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1334
Author(s):  
Mohamed R. Torkomany ◽  
Hassan Shokry Hassan ◽  
Amin Shoukry ◽  
Ahmed M. Abdelrazek ◽  
Mohamed Elkholy

The scarcity of water resources nowadays lays stress on researchers to develop strategies aiming at making the best benefit of the currently available resources. One of these strategies is ensuring that reliable and near-optimum designs of water distribution systems (WDSs) are achieved. Designing WDSs is a discrete combinatorial NP-hard optimization problem, and its complexity increases when more objectives are added. Among the many existing evolutionary algorithms, a new hybrid fast-convergent multi-objective particle swarm optimization (MOPSO) algorithm is developed to increase the convergence and diversity rates of the resulted non-dominated solutions in terms of network capital cost and reliability using a minimized computational budget. Several strategies are introduced to the developed algorithm, which are self-adaptive PSO parameters, regeneration-on-collision, adaptive population size, and using hypervolume quality for selecting repository members. A local search method is also coupled to both the original MOPSO algorithm and the newly developed one. Both algorithms are applied to medium and large benchmark problems. The results of the new algorithm coupled with the local search are superior to that of the original algorithm in terms of different performance metrics in the medium-sized network. In contrast, the new algorithm without the local search performed better in the large network.


Sign in / Sign up

Export Citation Format

Share Document