CoChat

Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks

Open access

The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.

Abstract

The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number of nodes in the operational networks. These devices often suffer from the lack of power and bandwidth. Hence, we have to optimize their message routing for the sake of maximizing their capabilities. However, the optimal routing typically relies on a delicate balance of diverse and often conflicting objectives, such as the route's delay and power consumption. The network design also has to consider the nodes' user-centric social behavior. Hence, the employment of socially aware load balancing becomes imperative for avoiding the potential formation of bottlenecks in the network's packet-flow. In this paper, we propose a novel algorithm, referred to as the multi-objective decomposition quantum optimization (MODQO) algorithm, which exploits the quantum parallelism to its full potential by reducing the database correlations for performing multi-objective routing optimization, while at the same time balancing the teletraffic load among the nodes without imposing a substantial degradation on the network's delay and power consumption. Furthermore, we introduce a novel socially aware load balancing metric, namely, the normalized entropy of the normalized composite betweenness of the associated socially aware network, for striking a better tradeoff between the network's delay and power consumption. We analytically prove that the MODQO algorithm achieves the full-search based accuracy at a significantly reduced complexity, which is several orders of magnitude lower than that of the full search. Finally, we compare the MODQO algorithm to the classic non-dominated sort genetic algorithm II evolutionary algorithm and demonstrate that the MODQO succeeds in halving the network's average delay, while simultaneously reducing the network's average power consumption by 6 dB without increasing the computational complexity.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2016.2629671

Cites

66 of 66 references verified0 citation errors · 0 not checkable

Statistics

Figures

FIGURE 1 Eligible techniques of reducing the computational complexity. Explicitly, QP is capable of reducing the number of database calls from N on the order of O ( p N ), where N is the database length, while HP exhibits a complexity reduction on the order of O ( K ), where K denotes the number of independent parallel processes. Finally, although the database correlation exploitation is problem-dependent and its complexity reduction cannot be readily quantified, it tends to rearrange the database into an uncorrelated one, substantially reducing the complexity imposed by both QP and HP, based on Zalka's [48] proof of Grover's QSA optimality.
FIGURE 1 Eligible techniques of reducing the computational complexity. Explicitly, QP is capable of reducing the number of database calls from N on the order of O ( p N ), where N is the database length, while HP exhibits a complexity reduction on the order of O ( K ), where K denotes the number of independent parallel processes. Finally, although the database correlation exploitation is problem-dependent and its complexity reduction cannot be readily quantified, it tends to rearrange the database into an uncorrelated one, substantially reducing the complexity imposed by both QP and HP, based on Zalka's [48] proof of Grover's QSA optimality.CC-BY · From the PDF
Image 2
CC-BY · From the PDF
FIGURE 3 (a) Exemplified topology with NMC D 4 MCs and NMR D 4 MRs for the twin-layer network considered and (b) presentation of the two layers of (a). In the OSN layer the arrows among the MCs manifest their friendship status, whereas in the WMN layer the resective arrows correspond to links satisfying the QoS criteria. The gray-colored arrows denote the association of each MC with a specific MR.
FIGURE 3 (a) Exemplified topology with NMC D 4 MCs and NMR D 4 MRs for the twin-layer network considered and (b) presentation of the two layers of (a). In the OSN layer the arrows among the MCs manifest their friendship status, whereas in the WMN layer the resective arrows correspond to links satisfying the QoS criteria. The gray-colored arrows denote the association of each MC with a specific MR.CC-BY · From the PDF
FIGURE 4 Complete karate club social relationship [50] used for determining the social relationship of the MCs in the OSN layer.
FIGURE 4 Complete karate club social relationship [50] used for determining the social relationship of the MCs in the OSN layer.CC-BY · From the PDF
FIGURE 5 A graphical example portraying the dominance relationship of the route-solutions x i 6 i D 2 with respect to the route-solution x 1 for a generic Pareto-optimality problem with K D 2 UFs.
FIGURE 5 A graphical example portraying the dominance relationship of the route-solutions x i 6 i D 2 with respect to the route-solution x 1 for a generic Pareto-optimality problem with K D 2 UFs.CC-BY · From the PDF
FIGURE 6 Distribution of the route-solutions into fronts based on the number of route-solutions that dominate a specific route-solution for a generic Pareto-optimality problem with K D 2 UFs.
FIGURE 6 Distribution of the route-solutions into fronts based on the number of route-solutions that dominate a specific route-solution for a generic Pareto-optimality problem with K D 2 UFs.CC-BY · From the PDF
FIGURE 7 Exemplified twin-layer network topology with N MC D 5 MCs and N MR D 7 MRs for a coverage area of (100 100) m 2 square block. The association of a specific MC with a specific MR is annotated using the dashed lines. The presence of a central inteligence cluster head node is assumed, albeit not portrayed in this figure.
FIGURE 7 Exemplified twin-layer network topology with N MC D 5 MCs and N MR D 7 MRs for a coverage area of (100 100) m 2 square block. The association of a specific MC with a specific MR is annotated using the dashed lines. The presence of a central inteligence cluster head node is assumed, albeit not portrayed in this figure.CC-BY · From the PDF
FIGURE 8 Solution space of the route-combinations of the socially-aware network of Fig. 7 in terms of their average power consumtpion N P ,quantified in dBm per route, and their average delay N D , quantified in number of hops per route. For the sake of simplicity, we have opted for only portraying the 100 lowest-rank PFs.
FIGURE 8 Solution space of the route-combinations of the socially-aware network of Fig. 7 in terms of their average power consumtpion N P ,quantified in dBm per route, and their average delay N D , quantified in number of hops per route. For the sake of simplicity, we have opted for only portraying the 100 lowest-rank PFs.CC-BY · From the PDF
FIGURE 9 Quantum circuit of the unitary operator Ugw implementing the weak Pareto dominance comparison.
FIGURE 9 Quantum circuit of the unitary operator Ugw implementing the weak Pareto dominance comparison.CC-BY · From the PDF
FIGURE 10 Multi-Objective Decomposition Quantum Optimization (MODQO) algorithm flowchart. We note that the in parentheses numbers at the begining of each block correspond to the identification number of each block.
FIGURE 10 Multi-Objective Decomposition Quantum Optimization (MODQO) algorithm flowchart. We note that the in parentheses numbers at the begining of each block correspond to the identification number of each block.CC-BY · From the PDF
Image 11
CC-BY · From the PDF
FIGURE 11 Trellis diagram of the merging process solely using (a) CM and (b) QM methods for the outer step optimization. We note that at each stage only S OPF routes continue propagating towards the End node, as denoted by the dotted arrows, while traversing precisely S OPF MC ; i nodes at the i -th step.
FIGURE 11 Trellis diagram of the merging process solely using (a) CM and (b) QM methods for the outer step optimization. We note that at each stage only S OPF routes continue propagating towards the End node, as denoted by the dotted arrows, while traversing precisely S OPF MC ; i nodes at the i -th step.CC-BY · From the PDF
FIGURE 12 Average MODQO inner step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO inner step complexity is compared to that of the exhaustive search and to its respective upper and lower bounds. The results have been averaged over 10 8 runs.
FIGURE 12 Average MODQO inner step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO inner step complexity is compared to that of the exhaustive search and to its respective upper and lower bounds. The results have been averaged over 10 8 runs.CC-BY · From the PDF
FIGURE 13 Order of the surviving route-combinations' growth factor with respect to the average number N N NOPF of Pareto-optimal routes in the MC routing table for twin-layer networks comprised by N MC D f 4 ; 8 ; 16 g MCs and N MR D f 5 ; : : : ; 10 g MRs. The results have been averaged over 10 8 runs.
FIGURE 13 Order of the surviving route-combinations' growth factor with respect to the average number N N NOPF of Pareto-optimal routes in the MC routing table for twin-layer networks comprised by N MC D f 4 ; 8 ; 16 g MCs and N MR D f 5 ; : : : ; 10 g MRs. The results have been averaged over 10 8 runs.CC-BY · From the PDF
FIGURE 14 Average MODQO outer step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO outer step complexity is compared to that of the exhaustive search, that of the CM method and to the lower bound of the NDQIO algorithm invoked jointly for all the available stages. The portrayed results have been averaged over 10 8 runs.
FIGURE 14 Average MODQO outer step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO outer step complexity is compared to that of the exhaustive search, that of the CM method and to the lower bound of the NDQIO algorithm invoked jointly for all the available stages. The portrayed results have been averaged over 10 8 runs.CC-BY · From the PDF
FIGURE 15 Average MODQO outer step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO average complexity is compared to that of the exhaustive search and that of the MODQO using the CM method. The portrayed results have been averaged over 10 8 runs.
FIGURE 15 Average MODQO outer step complexity quantified as a function of the number of CFEs for twin-layer networks consisting of N MR D f 5 ; 6 ; : : : ; 10 g MRs and N MR D f 2 ; 4 ; 8 ; 16 g MCs. The MODQO average complexity is compared to that of the exhaustive search and that of the MODQO using the CM method. The portrayed results have been averaged over 10 8 runs.CC-BY · From the PDF
Image 17
CC-BY · From the PDF
Image 18
CC-BY · From the PDF
FIGURE 17 Average normalized entropy of the normalized composite betweenness N H [ N Bcom ( S )] (a) and standard deviation of the normalized composite betweenness N Bcom (b) for both the MODQO algorithm and the NSGA-II for networks having from 5 to 10 MRs and 16 MCs. The NSGA-II initialization parameters are presented in Table 7. The results have been averaged over 10 8 runs.
FIGURE 17 Average normalized entropy of the normalized composite betweenness N H [ N Bcom ( S )] (a) and standard deviation of the normalized composite betweenness N Bcom (b) for both the MODQO algorithm and the NSGA-II for networks having from 5 to 10 MRs and 16 MCs. The NSGA-II initialization parameters are presented in Table 7. The results have been averaged over 10 8 runs.CC-BY · From the PDF
Image 20
CC-BY · From the PDF
Image 21
CC-BY · From the PDF
Image 22
CC-BY · From the PDF
communications.
communications.CC-BY · From the PDF
Image 24
CC-BY · From the PDF
Image 25
CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 66 references

Research works printed but not linked: 3

  1. steele, 1999, Mobile Radio Communications Second and Third Generation Cellular and WATM Systems
  2. hu, 2016, Cross-layer design for wireless mesh networking aided content sharing in online social networks, IEEE Trans Veh Technol
  3. imre, 2013, Advanced Quantum Communications An Engineering Approach

Cited by

See all 16

Metadata

Authors
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L.
Affiliations
  • University of Southampton (GB)
  • University of Electronic Science and Technology of China (CN)
Venue
IEEE Access
Published
2016
Volume
4
Pages
9993-10028
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2554636950
Cited by
15
References
65
Citations by year
2025: 1 · 2024: 1 · 2022: 2 · 2021: 2 · 2020: 1 · 2019: 2 · 2018: 5 · 2017: 1
FWCI
2.52
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • EPSRC that of the European Research Council, Advanced Fellow Grant (EP/L018659/1)
  • Royal Society’s Wolfson Research Merit Award
  • University of Electronic Science and Technology of China (A03013023601053)
  • National Natural Science Foundation of China (61601097)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
Keywords
quantum-assisted optimization, multi-objective routing, load balancing, mobile devices, power consumption, network latency, entropy measures, NSGA-II comparison

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: Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks. https://app.cochat.ai/papers/10.1109/access.2016.2629671
The paper
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2016). Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks. IEEE Access. https://doi.org/10.1109/access.2016.2629671

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.