Visible light communications (VLC) is gaining interest as one of the enablers of short-distance, high-data-rate applications, in future beyond 5G networks. Moreover, non-orthogonal multiple-access (NOMA)-enabled schemes have recently emerged as a promising multiple-access scheme for these networks that would allow realization of the target spectral efficiency and user fairness requirements. The integration of NOMA in the widely adopted orthogonal frequency-division multiplexing (OFDM)-based VLC networks would require an optimal resource allocation for the pair or the cluster of users sharing the same subcarrier(s). In this paper, the max-min rate of a multi-cell indoor centralized VLC network is maximized through optimizing user pairing, subcarrier allocation, and power allocation. The joint complex optimization problem is tackled using a low-complexity solution. At first, the user pairing is assumed to follow the divide-and-next-largest-difference user-pairing algorithm (D-NLUPA) that can ensure fairness among the different clusters. Then, subcarrier allocation and power allocation are solved iteratively through both the Simulated Annealing (SA) meta-heuristic algorithm and the bisection method. The obtained results quantify the achievable max-min user rates for the different relevant variants of NOMA-enabled schemes and shed new light on both the performance and design of multi-user multi-carrier NOMA-enabled centralized VLC networks.
翻译:作为未来超过5G网络的短距离高数据速率应用程序的促进者之一,可见光通信(VLC)作为未来在5G网络之外的短期高数据速率应用程序之一越来越受到关注。此外,非横向多接入(NOMA)机制最近成为这些网络的一个充满希望的多接入机制,可以实现目标光谱效率和用户公平性要求。将NOMA纳入广泛采用或多频分多路(OFDM)的VLC网络,将需要为共享同一子载体的对口用户或用户群的最佳资源分配。在本文中,通过优化用户配对配对、亚闭路机分配和电力分配,使多端中央多端多端多端多端多端接入网络的最大速度率最大化。联合复杂的优化问题正在通过低兼容性解决方案加以解决。首先,假设用户配对将遵循能够确保不同组合之间公平性(D-NLUPA)的双端用户双向用户双向用户双向选择的用户双端配置和双端配置(Simerimal-imalal-assalal-alal-al-al-assal-assal-assal-assal-assal-assal-assal-assal-assal-leval-lation-lation-lation-lational-lational-lational-lational-lational-lational-lational-lational-lation-lational-lation-lational-lational-lation-lational-l-l-lation-lation-lation-lation-lation-l-lation-l-lation-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-