下一代RAN中触觉互联网的资源管理和接纳控制
Resource Management and Admission Control for Tactile Internet in Next Generation of RAN
摘要：
针对下一代无线网络的云无线接入网（C-RAN）架构，提出了一种新的触觉互联网（TI）排队模型，5G，通过正交频分多址（OFDMA）技术辅助。该模型包括每对触觉用户之间的每个端到端（E2 E）连接的无线电远程头（RRH）和基带处理单元（BBU）排队延迟和可靠性。对于这种设置，以最小化用户的发射功率为目的，保证用户的可容忍延迟，以及前传和接入限制，我们制定了一个资源分配问题。由于所提出的优化问题是高度非凸的，为了以有效的方式解决它，我们利用了不同的变换技术，如连续凸近似（SCA）和两个凸函数（DC）的差异。此外，我们提出了一个接纳控制（AC）算法，使问题的可行性。在我们提出的系统模型中，我们动态地调整前传和接入链路，以尽量减少发射功率。仿真结果表明，通过动态调整的接入和前传延迟，传输功率可以节省的情况下，每个传输会话的固定方法相比。此外，网络中被拒绝的用户数量显著减少，更多的用户被接受。
英文摘要：
In this paper, a new queuing model for the Tactile Internet (TI) is proposed for the cloud radio access network (C-RAN) architecture of the next generation wireless networks, e.g., 5G, assisted via orthogonal frequency division multiple access (OFDMA) technology. This model includes both the radio remote head (RRH) and baseband processing unit (BBU) queuing delays and reliability for each end to end (E2E) connection between each pair of tactile users. For this setup, with the aim to minimize the transmit power of users subject to guaranteeing tolerable delay of users, and fronthaul and access limitations, we formulate a resource allocation problem. Since the proposed optimization problem is highly non-convex, to solve it in an efficient manner, we utilize diverse transformation techniques such as successive convex approximation (SCA) and difference of two convex functions (DC). In addition, we propose an admission control (AC) algorithm to make problem feasible. In our proposed system model, we dynamically adjust the fronthaul and access links to minimize the transmit power. Simulation results reveal that by dynamic adjustment of the access and fronthaul delays, transmit power can be saved compared to the case of fixed approach per each transmission session. Moreover, the number of rejected users in the network is significantly reduced and more users are accepted.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
