An energy-aware scheme for solving the routing problem in the internet of things based on jaya and flower pollination algorithms
Abstract
Clustering and routing protocols for Internet of Things (IoT) need to consider energy usage and how to reduce it. Unbalanced power usage is a common concern with current solutions to cluster-based routing problems in the IoT ecosystem. This research developed a swarm intelligence-based clustering technique to achieve a more uniform dispersion of cluster heads. The data packets across cluster heads and the sink are routed via a Jaya algorithm. Based on average remaining energy, number of active nodes, number of nodes that have failed or have been removed from the network, and overall network throughput, this combined clustering and routing method's quality has been assessed. The integrative clustering and routing protocol based on the flower pollination algorithm and Jaya algorithm described here exhibit considerable improvements over the current state-of-the-art. The network throughput and the number of the alive node are essential statistics for evaluating IoT in which battery-powered devices periodically acquire surroundings data and transmit gathered samples to a base station. The proposed strategy improved network throughput and the number of dead nodes by at least 14% and 18%, respectively. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
Volume
14Issue
8Collections
Related items
Showing items related by title, author, creator and subject.
-
Improving the accuracy of indoor positioning system
Hameez, Mohammed Muwafaq Noori (Kadir Has Üniversitesi, 2019)Indoor positioning applications needs high accuracy and precision to overcome the existing obstacles and relatively small areas. There are several methods which could be used to locate an object or people in an indoor ... -
Leveraging saving-based algorithms by master-slave genetic algorithms
Battarra, Maria; Benedettini, Stefano; Roli, Andrea (Pergamon-Elsevier Science Ltd, 2011)Saving-based algorithms are commonly used as inner mechanisms of efficient heuristic construction procedures. We present a general mechanism for enhancing the effectiveness of such heuristics based on a two-level genetic ... -
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
Samanlıoğlu, Funda; Ferrell, William G., Jr.; Kurz, Mary E. (Pergamon-Elsevier Science Ltd, 2008)This paper proposes a methodology to find weakly Pareto optimal solutions to a symmetric multi-objective traveling salesman problem using a memetic random-key genetic algorithm that has been augmented by a 2-opt local ...