ترغب بنشر مسار تعليمي؟ اضغط هنا

Rate-Splitting Multiple Access in Cache-Aided Cloud-Radio Access Networks

94   0   0.0 ( 0 )
 نشر من قبل Robert-Jeron Reifert
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Rate-splitting multiple access (RSMA) has been recognized as a promising physical layer strategy for 6G. Motivated by ever increasing popularity of cache-enabled content delivery in wireless communications, this paper proposes an innovative multigroup multicast transmission scheme based on RSMA for cache-aided cloud-radio access networks (C-RAN). Our proposed scheme not only exploits the properties of content-centric communications and local caching at the base stations (BSs), but also incorporates RSMA to better manage interference in multigroup multicast transmission with statistical channel state information (CSI) known at the central processor (CP) and the BSs. At the RSMA-enabled cloud CP, the message of each multicast group is split into a private and a common part with the former private part being decoded by all users in the respective group and the latter common part being decoded by multiple users from other multicast groups. Common message decoding is done for the purpose of mitigating the interference. In this work, we jointly optimize the clustering of BSs and the precoding with the aim of maximizing the minimum rate among all multicast groups to guarantee fairness serving all groups. The problem is a mixed-integer non-linear stochastic program (MINLSP), which is solved by a practical algorithm we proposed including a heuristic clustering algorithm for assigning a set of BSs to serve each user followed by an efficient iterative algorithm that combines the sample average approximation (SAA) and weighted minimum mean square error (WMMSE) to solve the stochastic non-convex sub-problem of precoder design. Numerical results show the explicit max-min rate gain of our proposed transmission scheme compared to the state-of-the-art trivial interference processing methods. Therefore, we conclude that RSMA is a promising technique for cache-aided C-RAN.



قيم البحث

اقرأ أيضاً

Rate-Splitting Multiple Access (RSMA) is a flexible and robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA under the practical important setup of imperfect Channel State Information at Transmitter (CSIT) originating from user mobility and latency in the network. First, we derive a lower bound on the ergodic sum-rate of RSMA for an arbitrary number of transmit antennas, number of users, user speeds and transmit power. Then, we study the power allocation between common and private streams and obtain a closed-form solution for the optimal power allocation that maximizes the obtained lower bound. The proposed power allocation greatly reduces precoder design complexity for RSMA. By Link-Level Simulations (LLS), we demonstrate that RSMA with the proposed power allocation is robust to degrading effects of user mobility and has significantly higher performance compared to conventional multi-user (massive) Multiple-Input Multiple-Output (MIMO) strategies. The work has important practical significance as results demonstrate that, in contrast to conventional multi-user (massive) MIMO whose performance collapse under mobility, RSMA can maintain reliable multi-user connectivity in mobile deployments.
Rate-Splitting Multiple Access (RSMA) is a flexible and robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA in the scenarios related with the important core services of New Radio (NR) and 6G, namely, enhanced Ultra-Reliable and Low-Latency (URLLC) and enhanced Mobile Broadband Communications (eMBB). We present the optimal system designs employing RSMA that target short-packet and low-latency communications as well as robust communications with high-throughput under the practical and important setup of imperfect Channel State Information at Transmitter (CSIT) originating from user mobility and feedback latency in the network. We demonstrate via numerical results that RSMA achieves significantly higher performance than Space Division Multiple Access (SDMA) and Non-Orthogonal Multiple Access (NOMA), and is capable of addressing the requirements for enhanced URLLC and eMBB in 6G efficiently.
337 - Onur Dizdar , Bruno Clerckx 2021
With the increasing number of wireless communication systems and the demand for bandwidth, the wireless medium has become a congested and contested environment. Operating under such an environment brings several challenges, especially for military co mmunication systems, which need to guarantee reliable communication while avoiding interfering with other friendly or neutral systems and denying the enemy systems of service. In this work, we investigate a novel application of Rate-Splitting Multiple Access(RSMA) for joint communications and jamming with a Multi-Carrier(MC) waveform in a multiantenna Cognitive Radio(CR) system. RSMA is a robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. Our aim is to simultaneously communicate with Secondary Users(SUs) and jam Adversarial Users(AUs) to disrupt their communications while limiting the interference to Primary Users(PUs) in a setting where all users perform broadband communications by MC waveforms in their respective networks. We consider the practical setting of imperfect CSI at transmitter(CSIT) for the SUs and PUs, and statistical CSIT for AUs. We formulate a problem to obtain optimal precoders which maximize the mutual information under interference and jamming power constraints. We propose an Alternating Optimization-Alternating Direction Method of Multipliers(AOADMM) based algorithm for solving the resulting non-convex problem. We perform an analysis based on Karush-Kuhn-Tucker conditions to determine the optimal jamming and interference power thresholds that guarantee the feasibility of problem and propose a practical algorithm to calculate the interference power threshold. By simulations, we show that RSMA achieves a higher sum-rate than Space Division Multiple Access(SDMA).
145 - Shuai Ma , Hui Zhou , Yijie Mao 2021
This paper addresses robust beamforming design for rate splitting multiple access (RSMA)-aided multiple-input single-output (MISO) visible light communication (VLC) networks. In particular, since the channel capacity of VLC is yet unknown, we derive the first theoretical bound of channel capacity of RSMA-aided VLC networks, i.e., achievable rates with closed-form expressions. For the perfect channel state information (CSI) scenario, we investigate the beamforming design to minimize the transmitted power of RSMA-aided VLC networks under the quality of service (QoS) constraint of each user and the optical power constraints, and propose a constrained-convex-concave programming (CCCP)-based beamforming design algorithm to obtain high-quality beamformers. Moreover, for the imperfect CSI scenario, we propose a robust CCCP-based beamforming design scheme for RSMA-aided VLC networks by exploiting semidefinite relaxation (SDR) technique and S-lemma. Numerical results show that the proposed RSMA schemes offer a significant spectral efficiency gain over the existing space-division multiple access (SDMA) scheme and non-orthogonal multiple access (NOMA) scheme.
We propose a low complexity antenna selection algorithm for low target rate users in cloud radio access networks. The algorithm consists of two phases: In the first phase, each remote radio head (RRH) determines whether to be included in a candidate set by using a predefined selection threshold. In the second phase, RRHs are randomly selected within the candidate set made in the first phase. To analyze the performance of the proposed algorithm, we model RRHs and users locations by a homogeneous Poisson point process, whereby the signal-to-interference ratio (SIR) complementary cumulative distribution function is derived. By approximating the derived expression, an approximate optimum selection threshold that maximizes the SIR coverage probability is obtained. Using the obtained threshold, we characterize the performance of the algorithm in an asymptotic regime where the RRH density goes to infinity. The obtained threshold is then modified depending on various algorithm options. A distinguishable feature of the proposed algorithm is that the algorithm complexity keeps constant independent to the RRH density, so that a user is able to connect to a network without heavy computation at baseband units.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا