arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.08676quant-phcs.DS
收藏

基于量子搜索的无线多跳网络Pareto最优路由动态规划框架

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

D. Alanis, P. Botsinis, Z. Babar, H. V. Nguyen, D. Chandra, S. X. Ng, L. Hanzo

摘要:

无线多跳网络(WMHN)必须在各种不同且经常相互冲突的服务质量(QoS)要求之间进行权衡。结果的解决方案可以包括在帕累托最优的概念下的帕累托前沿。然而,在WMHN中找到所有帕累托最优路由的问题被归类为NP难,因为合法路由的数量随着节点的激增而呈指数级增加。量子计算提供了一个有吸引力的框架,使帕累托最优路由问题易于处理。在这种背景下,已经提出了一对量子辅助算法,即非支配量子优化(NDQO)和非支配量子迭代优化(NDQIO)。然而,它们的复杂度与$\sqrt{N}$成正比,其中$N$对应于合法路由的总数,因此仍然不能在“多项式时间”内找到解决方案。作为补救措施,我们设计了一个动态规划框架,并提出了所谓的进化量子帕累托优化(EQPO)算法。我们分析了EQPO算法的复杂性,并证明它成功地解决了帕累托最优路由问题的多项式时间。最后,我们通过模拟证明,EQPO算法实现了复杂性降低,这至少是一个数量级,当与它的前辈相比,虽然在适度的启发式精度降低的成本。

英文摘要:

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 $\sqrt{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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑