Dynamic clustering and routing using multi‐objective particle swarm optimization with Levy distribution for wireless sensor networks
S. Jagadeesh, I. Muthulakshmi · International Journal of Communication Systems · 2021
Summary Energy‐efficient clustering and routing are two well‐known optimization problems, mainly employed to achieve energy efficiency and maximum network lifetime in wireless sensor networks (WSNs). The clustering and routing processes can be considered as an NP‐hard problem, and metaheuristic algorithms can be applied to resolve it. In this paper, a dynamic clustering and process protocol based on multi‐objective particle swarm optimization with Levy distribution (MOPSO‐L) algorithm. Since the parameters in WSN are related to one another, multi‐objective parameters should be included in the process of cluster head selection and routing. The proposed MOPSO‐L technique is presented for organizing the clusters and CH chosen by merging consolidated and shared models. The MOPSO‐L algorithm incorporates the benefits of PSO algorithm along with the merits of Levy distribution to escape from trapping into local optima. The presented model undergoes comparison with existing techniques under three different scenarios based on the location of the BS with respect to average energy consumption, number of data transmission, and network lifetime. The experimental outcome reveals that the proposed model attains extended network lifetime as well as efficient energy over its comparatives.