Energy-Efficient Cluster Head Selection via Quantum Approximate Optimization
Open accessAbstract
This paper proposes an energy-efficient cluster head selection method in the wireless ad hoc network by using a hybrid quantum-classical approach. The wireless ad hoc network is divided into several clusters via cluster head selection, and the performance of the network topology depends on the distribution of these clusters. For an energy-efficient network topology, none of the selected cluster heads should be neighbors. In addition, all the selected cluster heads should have high energy-consumption efficiency. Accordingly, an energy-efficient cluster head selection policy can be defined as a maximum weight independent set (MWIS) formulation. The cluster head selection policy formulated with MWIS is solved by using the quantum approximate optimization algorithm (QAOA), which is a hybrid quantum-classical algorithm. The accuracy of the proposed energy-efficient cluster head selection via QAOA is verified via simulations.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Standard QAOA has been applied to the cluster head selection problem, the wireless scheduling problem, the vehicle routing problem, multi-coloring graph problems, the graph isomorphism problem, and a satellite scheduling problem.
“Standard QAOA has been applied to: the cluster head selection problem [28], the wireless scheduling problem [29], the vehicle routing problem [14], multi-coloring graph problems [104], the graph isomorphism problem [66], and a satellite scheduling problem [128].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [28]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830 · see citing works
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · see citing works
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · see citing works
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982 · see citing works
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,786 · see citing works
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_8 · Cited by 2,322 · see citing works
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056 · see citing works
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · see citing works
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639 · see citing works
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913 · see citing works
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 820 · see citing works
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772 · see citing works
Viswanathan, H., & Mogensen, P. (2020) · IEEE Access · doi:10.1109/access.2020.2981745 · Cited by 743 · see citing works
Future Intelligent and Secure Vehicular Network Toward 6G: Machine-Learning Approaches
Tang, F., Kawamoto, Y., Kato, N., & Liu, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954595 · Cited by 620 · see citing works
Quantum advantage with shallow circuits
Bravyi, S. B., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406 · see citing works
Quantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353 · see citing works
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337 · see citing works
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331 · see citing works
TensorFlow Quantum: A Software Framework for Quantum Machine Learning
Broughton, M., Verdon, G., McCourt, T., Martinez, A. J., Yoo, J. H., Isakov, S. V., Massey, P., Halavati, R., Niu, M. Y., Zlokapa, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2003.02989 · Cited by 308 · see citing works
Multiobject tracking as maximum weight independent set
Brendel, W., Amer, M., & Todorović, S. (2011) · doi:10.1109/cvpr.2011.5995395 · Cited by 269 · see citing works
Quality-Aware Streaming and Scheduling for Device-to-Device Video Delivery
Kim, J., Caire, G., & Molisch, A. F. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2452272 · Cited by 188 · see citing works
Self-citationAghili, S. F., Mala, H., Shojafar, M., & Lopez, P. P. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.02.020 · Cited by 187 · see citing works
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125 · see citing works
A Tutorial on Quantum Approximate Optimization Algorithm (QAOA): Fundamentals and Applications
Choi, J., & Kim, J. (2019) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc46691.2019.8939749 · Cited by 121 · see citing works
Self-citationAwan, K. A., Din, I. U., Almogren, A., Guizani, M., & Khan, S. (2020) · IEEE Access · doi:10.1109/access.2020.2968948 · Cited by 117 · see citing works
Message Passing for Maximum Weight Independent Set
Sanghavi, S., Shah, D., & Willsky, A. S. (2007) · Cited by 107 · see citing works
BQP-completeness of scattering in scalar quantum field theory
Jordan, S. P., Krovi, H., Lee, K. S. M., & Preskill, J. P. (2018) · Quantum · doi:10.22331/q-2018-01-08-44 · Cited by 100 · see citing works
Message Passing for Maximum Weight Independent Set
Sanghavi, S., Shah, D., & Willsky, A. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030448 · Cited by 90 · see citing works
Wecker, D., Hastings, M. B., & Troyer, M. (2016) · Physical Review A · doi:10.1103/physreva.94.022309 · Cited by 88 · see citing works
Lin, D., & Wang, Q. (2019) · IEEE Access · doi:10.1109/access.2019.2911190 · Cited by 86 · see citing works
Adavoudi-Jolfaei, A., Ashouri-Talouki, M., & Aghili, S. F. (2017) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-017-0627-8 · Cited by 78 · see citing works
Clustering in Multi-Channel Cognitive Radio Ad Hoc and Sensor Networks
Özger, M., Alagöz, F., & Akan, Ö. B. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700767 · Cited by 71 · see citing works
Clustering Ad Hoc Networks: Schemes and Classifications
Wei, D., & Chan, H. A. (2006) · doi:10.1109/sahcn.2006.288583 · Cited by 62 · see citing works
Evaluating Quantum Approximate Optimization Algorithm: A Case Study
Shaydulin, R., & Alexeev, Y. (2019) · 2019 Tenth International Green and Sustainable Computing Conference (IGSC) · doi:10.1109/igsc48788.2019.8957201 · Cited by 55 · see citing works
Segmentation as Maximum-Weight Independent Set
Brendel, W., & Todorović, S. (2010) · Cited by 53 · see citing works
Accelerating Quantum Approximate Optimization Algorithm using Machine Learning
Alam, M., Saki, A. A., & Ghosh, S. (2020) · Design, Automation, and Test in Europe · doi:10.23919/date48585.2020.9116348 · Cited by 46 · see citing works
Scheduling Policy and Power Allocation for Federated Learning in NOMA based MEC
Ma, X., Sun, H., & Hu, R. Q. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322270 · Cited by 44 · see citing works
Channel Decoding with Quantum Approximate Optimization Algorithm
Matsumine, T., Koike–Akino, T., & Wang, Y. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849710 · Cited by 31 · see citing works
Stochastic Coalitional Games for Cooperative Random Access in M2M Communications
Soorki, M. N., Saad, W., Manshaei, M. H., & Saidi, H. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2720658 · Cited by 29 · see citing works
A Review of Security Aspects in Vehicular Ad-Hoc Networks
Talavera, E., Díaz-Álvarez, A., & Naranjo, J. E. (2019) · IEEE Access · doi:10.1109/access.2019.2907861 · Cited by 17 · see citing works
Asynchronous Ad Hoc Networks With Wireless Powered Cognitive Communications
Demarchou, E., Psomas, C., & Krikidis, I. (2019) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2019.2908855 · Cited by 15 · see citing works
Li, J., Alam, M., Saki, A. A., & Ghosh, S. (2020) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed48828.2020.9136973 · Cited by 9 · see citing works
Scheduling Policy and Power Allocation for Federated Learning in NOMA Based MECPreprint
Ma, X., Sun, H., & Hu, R. Q. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.13044 · Cited by 8 · see citing works
Channel Decoding with Quantum Approximate Optimization AlgorithmPreprint
Matsumine, T., Koike–Akino, T., & Wang, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02537 · Cited by 6 · see citing works
A Cluster Head Selection Algorithms in Wireless Network Based on Maximal Weighted Independent Set
Zhu, G., Jiang, X., Wu, C. Y., & He, Z. (2010) · International Conference on Ubiquitous Information Technologies & Applications (ICUT) · doi:10.1109/icut.2010.5678667 · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 1
- Kingma, D.P.; Ba, J. Adam: A Method for Stochastic Optimization. arXiv 2014, arXiv:1412.6980. · arXiv
Cited by
Sorted by citations
Quantum Neural Networks: Concepts, Applications, and Challenges
Kwak, Y., Yun, W. J., Jung, S., & Kim, J. (2021) · International Conference on Ubiquitous and Future Networks · doi:10.1109/icufn49451.2021.9528698 · Cited by 121 · see citing works
Self-citationDuong, T. Q., Nguyen, L. D., Narottama, B., Ansere, J. A., Huynh, D. V., & Shin, H. (2022) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2022.3195219 · Cited by 105 · see citing works
The quantum internet: A synergy of quantum information technologies and 6G networks
Rozenman, G. G., Kundu, N. K., Liu, R., Zhang, L., Maslennikov, A., Reches, Y., & Youm, H. Y. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12069 · Cited by 84 · see citing works
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 53 · see citing works
Self-citationLink Scheduling Using Graph Neural Networks
Zhao, Z., Verma, G., Rao, C. R., Swami, A., & Segarra, S. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3222781 · Cited by 51 · see citing works
Massaro, A. S., & Starace, G. (2022) · Sensors · doi:10.3390/s22134929 · Cited by 33 · see citing works
A New Quantum Circuits of Quantum Convolutional Neural Network for X-Ray Images Classification
Yousif, M., Al‐Khateeb, B., & García-Zapirain, B. (2024) · IEEE Access · doi:10.1109/access.2024.3396411 · Cited by 32 · see citing works
Quantum technologies for climate change: Preliminary assessmentPreprint
Berger, C., Paolo, A. D., Forrest, T., Hadfield, S., Sawaya, N. P. D., Stęchły, M., & Thibault, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.05362 · Cited by 47 · see citing works
Quantum approximate optimization for combinatorial problems with constraints
Ruan, Y., Yuan, Z., Xue, X., & Liu, Z. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.020 · Cited by 24 · see citing works
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22 · see citing works
“Standard QAOA has been applied to: the cluster head selection problem [28], the wireless scheduling problem [29], the vehicle routing problem [14], multi-coloring graph problems [104], the graph isomorphism problem [66], and a satellite scheduling problem [128].”
MethodOptimizing the Energy Efficiency Using Quantum Based Load Balancing in Open Radio Access Networks
Al-Karawi, Y., Al-Raweshidy, H. S., & Nilavalan, R. (2024) · IEEE Access · doi:10.1109/access.2024.3375530 · Cited by 16 · see citing works
Roy, K., & Kim, M.-K. (2022) · Electronics · doi:10.3390/electronics12010063 · Cited by 13 · see citing works
Quality of Service of Quantum Entanglement in Mobile Networks
Al-Karawi, Y., Alhumaima, R. S., & Al-Raweshidy, H. S. (2021) · IEEE Access · doi:10.1109/access.2021.3136782 · Cited by 7 · see citing works
Radhika, S., & Sharada, G. (2025) · Discover Computing · doi:10.1007/s10791-025-09634-x · Cited by 3 · see citing works
Applying the Quantum Grover Algorithm to Improve the Efficiency of Growth Models
Muhamediyeva, D., Mamatov, N., Samijonov, B. N., Ametova, G., & Turgunova, N. M. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-94273-0_7 · Cited by 1 · see citing works
An Enhanced Study of Quantum Computing in the View of Machine Learning
Muthusamy, A., Ramprasath, M., Kalpana, A. V., & Ravishankar, T. N. (2023) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-6684-7535-5.ch009 · Cited by 1 · see citing works
Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach
Choi, J., Oh, S., Park, S., Kim, J., & Kim, J. (2021) · International Conference on Information Networking · doi:10.1109/icoin50884.2021.9333931
Self-citationQIRA: A Quantum-Inspired Cluster Head Selection Algorithm for Wireless Sensor Networks
Sindhuja, M. (2024) · International Conference on Inventive Computation Technologies (ICICT) · doi:10.1109/icict60155.2024.10544444
Freshness flavour perception via quantum-inspired and quantum ligand-based virtual screening
Rodríguez-Otero, A., Juane, M. M., Paredes-Ramos, M., Nelen, J., Rentero, A. B., Pérez‐Sánchez, H., Tato, A. G., & Vilariño, J. M. L. (2026) · Scientific Reports · doi:10.1038/s41598-026-66827-0
Quantum Computing-Based Hyperparameter Optimization of Neural Networks
Chowdhury, P., & Sharma, K. (2026) · Studies in autonomic, data-driven and industrial computing · doi:10.1007/978-981-96-9083-1_24
- Authors
- Choi, J., Oh, S., & Kim, J.
- Affiliations
- Chung-Ang University (KR)
- Korea University (KR)
- Corresponding author
- Kim, Joongheon
- Venue
- Electronics
- Publisher
- MDPI AG
- Published
- 2020-10-13
- Volume
- 9
- Issue
- 10
- Pages
- 1669
- ISSN
- 2079-9292 (ISSN-L)
- OpenAlex
- W3092994636
- Cited by
- 20
- References
- 45
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 3 · 2023: 4 · 2022: 5 · 2021: 4
- FWCI
- 1.53
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Electronics (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- Physical Sciences › Computer Science › Computer Networks and Communications › Energy Efficient Wireless Sensor Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- cluster head selection, energy efficiency, wireless ad hoc networks, quantum approximate optimization algorithm, maximum weight independent set, hybrid quantum-classical algorithms, network topology
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
