Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

ARSH-FATI a novel metaheuristic for cluster head selection in wireless sensor networks

Abstract

IEEE Wireless sensor network (WSN) consists of a large number of sensor nodes distributed over a certain target area. The WSN plays a vital role in surveillance, advanced healthcare, and commercialized industrial automation. Enhancing energy-efficiency of the WSN is a prime concern because higher energy consumption restricts the lifetime (LT) of the network. Clustering is a powerful technique widely adopted to increase LT of the network and reduce the transmission energy consumption. In this article (LT) we develop a novel ARSH-FATI-based Cluster Head Selection (ARSH-FATI-CHS) algorithm integrated with a heuristic called novel ranked-based clustering (NRC) to reduce the communication energy consumption of the sensor nodes while efficiently enhancing LT of the network. Unlike other population-based algorithms ARSH-FATI-CHS dynamically switches between exploration and exploitation of the search process during run-time to achieve higher performance trade-off and significantly increase LT of the network. ARSH-FATI-CHS considers the residual energy, communication distance parameters, and workload during cluster heads (CHs) selection. We simulate our proposed ARSH-FATI-CHS and generate various results to determine the performance of the WSN in terms of LT. We compare our results with state-of-the-art particle swarm optimization (PSO) and prove that ARSH-FATI-CHS approach improves the LT of the network by ∼25%\sim \text{25}\%

Similar works

Full text

thumbnail-image

aCQUIRe

redirect
Last time updated on 20/10/2022

This paper was published in aCQUIRe.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.