An improved quantum-inspired particle swarm optimisation approach to reduce energy consumption in IoT networks
Bibliographic record
Abstract
• Energy-efficient clustering of IoT networks is formulated as a mathematical program that takes into account all the energy constraints and promotes the selection of routing paths that minimize energy consumption. • This is solved with an advanced optimization approach, using the powerful new quantum computing technology to boost efficiency and performance, along with a damping factor to avoid premature convergence to a local optimum and an enhanced heuristic for constructing binary solutions. • Comparison of the proposed approach with existing methods shows that it achieves large energy savings and short execution times. The Internet of Things (IoT) plays a pivotal role in modern society, connecting everyday objects to the internet and enabling smart functionalities that enhance efficiency, convenience, and sustainability across multiple sectors. As IoT networks have expanded in scale and complexity, optimising energy consumption has become critical to ensuring their long-term sustainability and cost-effectiveness. This paper introduces quantum-inspired particle swarm optimisation clustering (QIPSOC), an innovative metaheuristic that relies on a novel mathematical formulation (MPMC) and integrates principles from quantum computing and particle swarm optimisation to achieve energy-efficient clustering, balancing network performance constraints and energy consumption. By encoding particles as n -qubit systems and employing quantum-inspired motion through qubit rotations along with an inertial damping factor, QIPSOC enhances solution diversity, mitigates premature convergence to local optima, and guides the exploration of the solution space to achieve significant energy savings, ranging from 17.99 % to over 91 %, depending on the network configuration. These results underscore QIPSOC's superiority over state-of-the-art methods in optimising energy efficiency and performance in IoT networks, making it well-suited for real-world deployment scenarios requiring rapid decision-making.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".