Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Routing in wireless multihop networks (WMHNs) relies on a delicate balance of diverse and often conflicting parameters, when aiming for maximizing the WMHN performance. Classified as a non-deterministic polynomial-time hard problem, routing in WMHNs requires sophisticated methods. As a benefit of observing numerous variables in parallel, quantum computing offers a promising range of algorithms for complexity reduction by exploiting the principle of quantum parallelism (QP), while achieving the optimum full-search-based performance. In fact, the so-called non-dominated quantum optimization (NDQO) algorithm has been proposed for addressing the multiobjective routing problem with the goal of achieving a near-optimal performance, while imposing a complexity of the order of O(N) and O(N√N) in the best and worst case scenarios, respectively. However, as the number of nodes in the WMHN increases, the total number of routes increases exponentially, making its employment infeasible despite the complexity reduction offered. Therefore, we propose a novel optimal quantum-assisted algorithm, namely, the non-dominated quantum iterative optimization (NDQIO) algorithm, which exploits the synergy between the hardware and the QP for the sake of achieving a further complexity reduction, which is on the order of O(√N) and O(N√N) in the best and worst case scenarios, respectively. In addition, we provide simulation results for demonstrating that our NDQIO algorithm achieves an average complexity reduction of almost an order of magnitude compared with the near-optimal NDQO algorithm, while having the same order of power consumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Grover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
A Quantum Algorithm for Finding the Minimum
Durr, C., & Hoyer, P. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9607014 · Cited by 359
Botsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
Self-citationMulti-objective routing optimization using evolutionary algorithms
Yetgin, H., Cheung, K. T. K., & Hanzo, L. (2012) · 2012 IEEE Wireless Communications and Networking Conference (WCNC) · doi:10.1109/wcnc.2012.6214324 · Cited by 58 · cited 14×
“Furthermore, each WMHN node attempts to optimize its performance in terms of different and often conflicting Quality of Service (QoS) parameters, such as the Bit Error Ratio (BER), the Packet Loss Ratio (PLR) and the end-to-end delay, while having access to a restricted amount of power.”
BackgroundMethodInfluentialSelf-citationBotsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2458857 · Cited by 48
Self-citationQuantum-Assisted Routing Optimization for Self-Organizing Networks
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L. (2014) · IEEE Access · doi:10.1109/access.2014.2327596 · Cited by 46 · cited 10×
“The 8-node WMHN topology considered [5].”
BackgroundMethodInfluentialSelf-citation
Cited by
Nonorthogonal Multiple Access for 5G and Beyond
Liu, Y., Qin, Z., Elkashlan, M., Ding, Z., Nallanathan, A., & Hanzo, L. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2768666 · Cited by 1,369
Self-citationQuantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Self-citationBotsinis, P., Alanis, D., Feng, S., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., Zhang, R., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2733557 · Cited by 37
Self-citationJoint Quantum-Assisted Channel Estimation and Data Detection
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591903 · Cited by 29
Self-citationQuantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming
Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2822626 · Cited by 17
Self-citation
Metadata
- Authors
- Alanis, D., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L.
- Venue
- IEEE Access
- Published
- 2015
- Volume
- 3
- Pages
- 1704-1728
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W1900024896
- Cited by
- 26
- References
- 11
- FWCI
- 5.37
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks. https://app.cochat.ai/papers/10.1109/access.2015.2478793
- The paper
- Alanis, D., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2015). Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks. IEEE Access. https://doi.org/10.1109/access.2015.2478793
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.