اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMulti-Dimensional Multiple Access with Resource Utilization Cost Awareness for Individualized Service Provisioning in 6G
127
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The increasingly diversified Quality-of-Service (QoS) requirements envisioned for future wireless networks call for more flexible and inclusive multiple access techniques for supporting emerging applications and communication scenarios. To achieve this, we propose a multi-dimensional multiple access (MDMA) protocol to meet individual User Equipments (UEs) unique QoS demands while utilizing multi-dimensional radio resources cost-effectively. In detail, the proposed scheme consists of two new aspects, i.e., selection of a tailored multiple access mode for each UE while considering the UE-specific radio resource utilization cost; and multi-dimensional radio resource allocation among coexisting UEs under dynamic network conditions. To reduce the UE-specific resource utilization cost, the base station (BS) organizes UEs with disparate multi-domain resource constraints as UE coalition by considering each UEs specific resource availability, perceived quality, and utilization capability. Each UE within a coalition could utilize its preferred radio resources, which leads to low utilization cost while avoiding resource-sharing conflicts with remaining UEs. Furthermore, to meet UE-specific QoS requirements and varying resource conditions at the UE side, the multi-dimensional radio resource allocation among coexisting UEs is formulated as an optimization problem to maximize the summation of cost-aware utility functions of all UEs. A solution to solve this NP-hard problem with low complexity is developed using the successive convex approximation and the Lagrange dual decomposition methods. The effectiveness of our proposed scheme is validated by numerical simulation and performance comparison with state-of-the-art schemes. In particular, the simulation results demonstrate that our proposed scheme outperforms these benchmark schemes by large margins.
قيم البحث
اقرأ أيضاً
In this paper, we study inter-operator spectrum sharing and intra-operator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both inter-operator and intra-operator resource allocati
on optimization problems. For inter-operator spectrum sharing, we present two competent approaches, namely the subcarrier gain based sharing and fragmentation based sharing, which carry out fair and flexible allocation of the available shareable spectrum among the operators subject to certain well-defined sharing rules, traffic demands and channel propagation characteristics. Subcarrier gain based spectrum sharing scheme has been found to be more efficient in terms of achieved throughput. However, fragmentation based sharing is more attractive in terms of computational complexity. For intra-operator resource allocation, we consider resource allocation problem with users dissimilar service requirements, where the operator supports users with delay-constraint and non-delay constraint service requirements, simultaneously. This optimization problem is a mixed integer nonlinear programming problem and nonconvex, which is computationally very expensive, and the complexity grows exponentially with the number of integer variables. We propose less-complex and efficient suboptimal solution based on formulating exact linearization, linear approximation and convexification techniques for the nonlinear and/or non-convex objective functions and constraints. Extensive simulation performance analysis has been carried out that validates the efficiency of the proposed solution.
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.
The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access
scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are offloading, and a tailored greedy search algorithm for finding a good set of offloading users. For divisible tasks we develop a low-complexity algorithm to find a stationary solution. To highlight the impact of the choice of multiple access scheme, we also consider the TDMA scheme, which, in general, cannot exploit the full capabilities of the channel, and we develop low-complexity optimal resource allocation algorithms for indivisible and divisible tasks under that scheme. The energy reduction facilitated by FullMA is illustrated in our numerical experiments. Further, those results show that the proposed algorithms outperform existing algorithms in terms of energy consumption and computational cost.
Non-orthogonal multiple access (NOMA) is envisioned to be one of the most beneficial technologies for next generation wireless networks due to its enhanced performance compared to other conventional radio access techniques. Although the principle of
NOMA allows multiple users to use the same frequency resource, due to decoding complication, information of users in practical systems cannot be decoded successfully if many of them use the same channel. Consequently, assigned spectrum of a system needs to be split into multiple subchannels in order to multiplex that among many users. Uplink resource allocation for such systems is more complicated compared to the downlink ones due to the individual users power constraints and discrete nature of subchannel assignment. In this paper, we propose an uplink subchannel and power allocation scheme for such systems. Due to the NP-hard and non-convex nature of the problem, the complete solution, that optimizes both subchannel assignment and power allocation jointly, is intractable. Consequently, we solve the problem in two steps. First, based on the assumption that the maximal power level of a user is subdivided equally among its allocated subchannels, we apply many-to-many matching model to solve the subchannel-user mapping problem. Then, in order to enhance the performance of the system further, we apply iterative water-filling and geometric programming two power allocation techniques to allocate power in each allocated subchannel-user slot optimally. Extensive simulation has been conducted to verify the effectiveness of the proposed scheme. The results demonstrate that the proposed scheme always outperforms all existing works in this context under all possible scenarios.
This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify th
e corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have a symmetric antipodal input distribution for all values of noise variance. Next, we analytically derive and characterize an achievable rate region for the capacity in cases with small peak power constraints, which coincides with the capacity in a certain scenario. The capacity per unit cost is of interest in low power regimes and is a target performance measure in energy efficient communications. In this work, we derive the capacity per unit cost of additive white Gaussian channel and GMAC with peak power constraints. The results in case of GMAC demonstrate that the capacity per unit cost is obtained using antipodal signaling for both users and is independent of users rate ratio. We characterize the optimized transmission strategies obtained for capacity and capacity per unit cost with peak-power constraint in detail and specifically in contrast to the settings with average-power constraints.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
