A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

02/23/2018
by   D. Alanis, et al.
0

Wireless Multihop Networks (WMHNs) have to strike a trade-off among diverse and often conflicting Quality-of-Service (QoS) requirements. The resultant solutions may be included by the Pareto Front under the concept of Pareto Optimality. However, the problem of finding all the Pareto-optimal routes in WMHNs is classified as NP-hard, since the number of legitimate routes increases exponentially, as the nodes proliferate. Quantum Computing offers an attractive framework of rendering the Pareto-optimal routing problem tractable. In this context, a pair of quantum-assisted algorithms have been proposed, namely the Non-Dominated Quantum Optimization (NDQO) and the Non-Dominated Quantum Iterative Optimization (NDQIO). However, their complexity is proportional to √(N), where N corresponds to the total number of legitimate routes, thus still failing to find the solutions in "polynomial time". As a remedy, we devise a dynamic programming framework and propose the so-called Evolutionary Quantum Pareto Optimization (EQPO) algorithm. We analytically characterize the complexity imposed by the EQPO algorithm and demonstrate that it succeeds in solving the Pareto-optimal routing problem in polynomial time. Finally, we demonstrate by simulations that the EQPO algorithm achieves a complexity reduction, which is at least an order of magnitude, when compared to its predecessors, albeit at the cost of a modest heuristic accuracy reduction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2018

Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming

Pareto optimality is capable of striking the optimal trade-off amongst t...
research
10/21/2020

Smoothed Analysis of Pareto Curves in Multiobjective Optimization

In a multiobjective optimization problem a solution is called Pareto-opt...
research
11/11/2021

A 2-Dimensional Binary Search for Integer Pareto Frontiers

For finite integer squares, we consider the problem of learning a classi...
research
06/06/2018

Clustering in a 2d Pareto Front: p-median and p-center are solvable in polynomial time

This paper is motivated by a real life application of multi-objective op...
research
08/19/2019

Planar p-center problems are solvable in polynomial time when clustering a Pareto Front

This paper is motivated by real-life applications of bi-objective optimi...
research
06/07/2023

Dynamic Programming on a Quantum Annealer: Solving the RBC Model

We introduce a novel approach to solving dynamic programming problems, s...
research
11/01/2022

Quantum-inspired optimization for routing and wavelength assignment

Problems related to routing and wavelength assignment (RWA) in optical c...

Please sign up or login with your details

Forgot password? Click here to reset