The University of Southampton
University of Southampton Institutional Repository

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

Research Data: Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
Research Data: Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
This DOI contains the datasets of Figures 7,8,12-17 of the paper titled "Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks". Each folder is named according to the corresponding figure, where the dataset of each curve is stored in a .dat file. To regenerate the figures please use the command "gle Figure_Name.gle" (Graphics Layout Engine -GLE- should be installed on your machine).Paper Abstract: The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number of nodes in the 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 treatise, we propose a novel algorithm, referred to as the \emph{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 tele-traffic 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 trade-off 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 NSGA-II evolutionary algorithm and demonstrate that the MODQO succeeds in halving the network's average delay, whilst simultaneously reducing the network's average power consumption by 6 dB without increasing the computational complexity.Funded by: Royal Society Wolfson Research Merit Award.
University of Southampton
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Hu, Jie
84967196-e5da-49dc-8a0d-4e2507a5fcde
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Babar, Zunaira
23ede793-1796-449d-b5aa-93a297e5677a
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Hu, Jie
84967196-e5da-49dc-8a0d-4e2507a5fcde
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Babar, Zunaira
23ede793-1796-449d-b5aa-93a297e5677a
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Alanis, Dimitrios, Hu, Jie, Botsinis, Panagiotis, Babar, Zunaira, Ng, Soon and Hanzo, Lajos (2016) Research Data: Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks. University of Southampton doi:10.5258/SOTON/403120 [Dataset]

Record type: Dataset

Abstract

This DOI contains the datasets of Figures 7,8,12-17 of the paper titled "Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks". Each folder is named according to the corresponding figure, where the dataset of each curve is stored in a .dat file. To regenerate the figures please use the command "gle Figure_Name.gle" (Graphics Layout Engine -GLE- should be installed on your machine).Paper Abstract: The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number of nodes in the 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 treatise, we propose a novel algorithm, referred to as the \emph{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 tele-traffic 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 trade-off 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 NSGA-II evolutionary algorithm and demonstrate that the MODQO succeeds in halving the network's average delay, whilst simultaneously reducing the network's average power consumption by 6 dB without increasing the computational complexity.Funded by: Royal Society Wolfson Research Merit Award.

Text
ReadMe.txt - Text
Available under License Creative Commons Attribution.
Download (8kB)
Archive
Dataset_SN_JRLB.tar.gz - Dataset
Available under License Creative Commons Attribution.
Download (2MB)

More information

Published date: 2016
Organisations: Southampton Wireless Group, Electronics & Computer Science
Projects:
Cooperative Classical and Quantum Communications Systems
Funded by: UNSPECIFIED (EP/L018659/1)
31 October 2014 to 30 October 2017
Royal Society Wolfson Research Merit Award
Funded by: UNSPECIFIED (UNSPECIFIED)
UNSPECIFIED to UNSPECIFIED
From Radio-Frequency to Giga-Bit Optical- and Quantum-Wireless (BEAM-ME-UP)
Funded by: UNSPECIFIED (321097)
1 March 2013 to 28 February 2018

Identifiers

Local EPrints ID: 403120
URI: https://eprints.soton.ac.uk/id/eprint/403120
PURE UUID: 38845f8c-18a2-415f-8a6a-9d536f63ae8c
ORCID for Dimitrios Alanis: ORCID iD orcid.org/0000-0002-6654-1702
ORCID for Zunaira Babar: ORCID iD orcid.org/0000-0002-7498-4474
ORCID for Soon Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 23 Nov 2016 16:40
Last modified: 06 Jun 2018 13:15

Export record

Altmetrics

Contributors

Creator: Dimitrios Alanis ORCID iD
Creator: Jie Hu
Creator: Panagiotis Botsinis
Creator: Zunaira Babar ORCID iD
Creator: Soon Ng ORCID iD
Creator: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×