اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Synergistic Benefits of Rate Splitting in IRS-assisted Cloud Radio Access Networks
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The concept of intelligent reflecting surfaces (IRSs) is considered as a promising technology for increasing the efficiency of mobile wireless networks. This is achieved by employing a vast amount of low-cost individually adjustable passive reflect elements, that are able to apply changes to the reflected signal. To this end, the IRS makes the environment realtime controllable and can be adjusted to significantly increase the received signal quality at the users by passive beamsteering. However, the changes to the reflected signals have an effect on all users near the IRS, which makes it impossible to optimize the changes to positively influence every transmission, affected by the reflections. This results in some users not only experiencing better signal quality, but also an increase in received interference. To mitigate this negative side effect of the IRS, this paper utilizes the rate splitting (RS) technique, which enables the mitigation of interference within the network in such a way that it also mitigates the increased interference caused by the IRS. To investigate the effects on the overall power savings, that can be achieved by combining both techniques, we minimize the required transmit power, needed to satisfy per-user quality-of-service (QoS) constraints. Numerical results show the improved power savings, that can be gained by utilizing the IRS and the RS technique simultaneously. In fact, the concurrent use of both techniques yields power savings, which are beyond the cumulative power savings of using each technique separately.
قيم البحث
اقرأ أيضاً
The potential of intelligent reflecting surfaces (IRSs) is investigated as a promising technique for enhancing the energy efficiency of wireless networks. Specifically, the IRS enables passive beamsteering by employing many low-cost individually cont
rollable reflect elements. The resulting change of the channel state, however, increases both, signal quality and interference at the users. To counteract this negative side effect, we employ rate splitting (RS), which inherently is able to mitigate the impact of interference. We facilitate practical implementation by considering a Cloud Radio Access Network (C-RAN) at the cost of finite fronthaul-link capacities, which necessitate the allocation of sensible user-centric clusters to ensure energy-efficient transmissions. Dynamic methods for RS and the user clustering are proposed to account for the interdependencies of the individual techniques. Numerical results show that the dynamic RS method establishes synergistic benefits between RS and the IRS. Additionally, the dynamic user clustering and the IRS cooperate synergistically, with a gain of up to 88% when compared to the static scheme. Interestingly, with an increasing fronthaul capacity, the gain of the dynamic user clustering decreases, while the gain of the dynamic RS method increases. Around the resulting intersection, both methods affect the system concurrently, improving the energy efficiency drastically.
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 multigrou
p 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.
Ultra-dense deployments in 5G, the next generation of cellular networks, are an alternative to provide ultra-high throughput by bringing the users closer to the base stations. On the other hand, 5G deployments must not incur a large increase in energ
y consumption in order to keep them cost-effective and most importantly to reduce the carbon footprint of cellular networks. We propose a reinforcement learning cell switching algorithm, to minimize the energy consumption in ultra-dense deployments without compromising the quality of service (QoS) experienced by the users. In this regard, the proposed algorithm can intelligently learn which small cells (SCs) to turn off at any given time based on the traffic load of the SCs and the macro cell. To validate the idea, we used the open call detail record (CDR) data set from the city of Milan, Italy, and tested our algorithm against typical operational benchmark solutions. With the obtained results, we demonstrate exactly when and how the proposed algorithm can provide energy savings, and moreover how this happens without reducing QoS of users. Most importantly, we show that our solution has a very similar performance to the exhaustive search, with the advantage of being scalable and less complex.
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.
Drone base station (DBS) is a promising technique to extend wireless connections for uncovered users of terrestrial radio access networks (RAN). To improve user fairness and network performance, in this paper, we design 3D trajectories of multiple DB
Ss in the drone assisted radio access networks (DA-RAN) where DBSs fly over associated areas of interests (AoIs) and relay communications between the base station (BS) and users in AoIs. We formulate the multi-DBS 3D trajectory planning and scheduling as a mixed integer non-linear programming (MINLP) problem with the objective of minimizing the average DBS-to-user (D2U) pathloss. The 3D trajectory variations in both horizontal and vertical directions, as well as the state-of-the-art DBS-related channel models are considered in the formulation. To address the non-convexity and NP-hardness of the MINLP problem, we first decouple it into multiple integer linear programming (ILP) and quasi-convex sub-problems in which AoI association, D2U communication scheduling, horizontal trajectories and flying heights of DBSs are respectively optimized. Then, we design a multi-DBS 3D trajectory planning and scheduling algorithm to solve the sub-problems iteratively based on the block coordinate descent (BCD) method. A k-means-based initial trajectory generation and a search-based start slot scheduling are considered in the proposed algorithm to improve trajectory design performance and ensure inter-DBS distance constraint, respectively. Extensive simulations are conducted to investigate the impacts of DBS quantity, horizontal speed and initial trajectory on the trajectory planning results. Compared with the static DBS deployment, the proposed trajectory planning can achieve 10-15 dB reduction on average D2U pathloss, and reduce the D2U pathloss standard deviation by 68%, which indicate the improvements of network performance and user fairness.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
