A Novel Enhanced Quantum PSO for Optimal Network Configuration in Heterogeneous Industrial IoT

A novel enhanced quantum particle swarm optimization algorithm for IIoT deployments is proposed. It provides enhanced connectivity, reduced energy consumption, and optimized delay. We consider heterogeneous scenarios of network topologies for optimal path configuration by exploring and exploiting th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2021, Vol.9, p.134022-134036
Main Authors: Ghorpade, Sheetal N., Zennaro, Marco, Chaudhari, Bharat S., Saeed, Rashid A., Alhumyani, Hesham, Abdel-Khalek, S.
Format: Article
Language:English
Subjects:
Algorithms
Configurations
Connectivity
Delays
Energy consumption
Energy efficiency
Evolutionary computation
Industrial applications
Industrial Internet of Things
Network topologies
Network topology
Nodes
Operators (mathematics)
optimization
Optimization techniques
Particle swarm optimization
PSO
QPSO
Robot sensing systems
route configuration
Sensors
throughput
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel enhanced quantum particle swarm optimization algorithm for IIoT deployments is proposed. It provides enhanced connectivity, reduced energy consumption, and optimized delay. We consider heterogeneous scenarios of network topologies for optimal path configuration by exploring and exploiting the hunts. It uses multiple inputs from heterogeneous IIoT into quantum and bio-inspired optimization techniques. The differential evolution operator and crossover operations are used for information interchange among the nodes to avoid trapping into local minima. The different topology scenarios are simulated to study the impact of p -degrees of connectivity concerning objective functions' evaluation and compared with existing techniques. The results demonstrate that our algorithm consumes a minimum of 30.3% lesser energy. Furthermore, it offers improved searching precision and convergence swiftness in the possible search space for p -disjoint paths and reduces the delay by a minimum of 26.7%. Our algorithm also improves the throughput by a minimum of 29.87% since the quantum swarm inclines to generate additional diverse paths from multiple source nodes to the gateway.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2021.3115026