论文标题

用于毫米波细胞网络中联合路由和调度的最佳和近似算法

Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

论文作者

Yuan, Dingwen, Lin, Hsuan-Yin, Widmer, Jörg, Hollick, Matthias

论文摘要

毫米波(MMWave)通信是一项有前途的技术,可以应对5G数据流量的指数增加。 这样的网络通常需要非常密集的基站部署。 这些所谓的宏基站的子集具有与核心网络的高带宽连接,而中继基站则无线连接。 为了降低成本并提高灵活性,需要进行无线进行回程,以将宏连接到继电器以及继电器接力站。 MMWave通信的特征要求新的路由和调度范式。 该论文研究了不同干扰模型下的调度算法。 为了展示调度方法,我们研究了最大的吞吐公平调度问题。然而,提出的算法可以很容易地扩展到其他问题。 对于NO干扰模型下的全双工网络,我们提出了一种有效的多项式时间调度方法,即{\ em面向计划的优化}。此外,如果我们假设成对的链接干扰模型或半双链收音机,我们证明问题是NP-HARD。 对于这些NP-硬化病例,提出了基于加权着色的分数近似算法。 此外,在无干涉模型下,为半双链网络提出了近似算法并行数据流计划。它具有比基于加权的算法更好的近似值,甚至达到了针对均匀正交反向通知网络特殊情况的最佳解决方案。

Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base stations, feature high-bandwidth connection to the core network, while relay base stations are connected wirelessly. To reduce cost and increase flexibility, wireless backhauling is needed to connect both macro to relay as well as relay to relay base stations. The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models. To showcase the scheduling methods, we study the maximum throughput fair scheduling problem. Yet the proposed algorithms can be easily extended to other problems. For a full-duplex network under the no interference model, we propose an efficient polynomial-time scheduling method, the {\em schedule-oriented optimization}. Further, we prove that the problem is NP-hard if we assume pairwise link interference model or half-duplex radios. Fractional weighted coloring based approximation algorithms are proposed for these NP-hard cases. Moreover, the approximation algorithm parallel data stream scheduling is proposed for the case of half-duplex network under the no interference model. It has better approximation ratio than the fractional weighted coloring based algorithms and even attains the optimal solution for the special case of uniform orthogonal backhaul networks.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源