اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Two-Phase Power Allocation Scheme for CRNs Employing NOMA
280
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider the power allocation (PA) problem in cognitive radio networks (CRNs) employing nonorthogonal multiple access (NOMA) technique. Specifically, we aim to maximize the number of admitted secondary users (SUs) and their throughput, without violating the interference tolerance threshold of the primary users (PUs). This problem is divided into a two-phase PA process: a) maximizing the number of admitted SUs; b) maximizing the minimum throughput among the admitted SUs. To address the first phase, we apply a sequential and iterative PA algorithm, which fully exploits the characteristics of the NOMA-based system. Following this, the second phase is shown to be quasiconvex and is optimally solved via the bisection method. Furthermore, we prove the existence of a unique solution for the second phase and propose another PA algorithm, which is also optimal and significantly reduces the complexity in contrast with the bisection method. Simulation results verify the effectiveness of the proposed two-phase PA scheme.
قيم البحث
اقرأ أيضاً
A non-orthogonal multiple access (NOMA) approach to user signal power allocation called Fair-NOMA is introduced. Fair-NOMA is the application of NOMA in such a way that two mobile users have the opportunity to always achieve at least the information
capacity they can achieve by using orthogonal multiple access (OMA), regardless of the user selection criteria, making it suitable for implementation using any current or future scheduling paradigms. Given this condition, the bounds of the power allocation coefficients are derived as functions of the channel gains of the two mobile users. The NOMA power allocation is analyzed for two scheduled users that are selected randomly with i.i.d. channel gains. The capacity improvements made by each user and the sum capacity improvement are derived.
This paper investigates the application of non-orthogonal multiple access (NOMA) in millimeter wave (mmWave) communications by exploiting beamforming, user scheduling and power allocation. Random beamforming is invoked for reducing the feedback overh
ead of considered systems. A nonconvex optimization problem for maximizing the sum rate is formulated, which is proved to be NP-hard. The branch and bound (BB) approach is invoked to obtain the optimal power allocation policy, which is proved to converge to a global optimal solution. To elaborate further, low complexity suboptimal approach is developed for striking a good computational complexity-optimality tradeoff, where matching theory and successive convex approximation (SCA) techniques are invoked for tackling the user scheduling and power allocation problems, respectively. Simulation results reveal that: i) the proposed low complexity solution achieves a near-optimal performance; and ii) the proposed mmWave NOMA systems is capable of outperforming conventional mmWave orthogonal multiple access (OMA) systems in terms of sum rate and the number of served users.
A non-orthogonal multiple access (NOMA) approach that always outperforms orthogonal multiple access (OMA) called Fair-NOMA is introduced. In Fair-NOMA, each mobile user is allocated its share of the transmit power such that its capacity is always gre
ater than or equal to the capacity that can be achieved using OMA. For any slow-fading channel gains of the two users, the set of possible power allocation coefficients are derived. For the infimum and supremum of this set, the individual capacity gains and the sum-rate capacity gain are derived. It is shown that the ergodic sum-rate capacity gain approaches 1 b/s/Hz when the transmit power increases for the case when pairing two random users with i.i.d. channel gains. The outage probability of this approach is derived and shown to be better than OMA. The Fair-NOMA approach is applied to the case of pairing a near base-station user and a cell-edge user and the ergodic capacity gap is derived as a function of total number of users in the cell at high SNR. This is then compared to the conventional case of fixed-power NOMA with user-pairing. Finally, Fair-NOMA is extended to $K$ users and prove that the capacity can always be improved for each user, while using less than the total transmit power required to achieve OMA capacities per user.
Mobile edge computing (MEC) can enhance the computing capability of mobile devices, and non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two technologies can effectively benefit the network with spectrum and energy e
fficiency. In this paper, we investigate the task completion time minimization in NOMA multiuser MEC networks, where multiple users can offload their tasks simultaneously via the same frequency band. We adopt the emph{partial} offloading, in which each user can partition its computation task into offloading computing and locally computing parts. We aim to minimize the maximum task latency among users by optimizing their tasks partition ratios and offloading transmit power. By considering the energy consumption and transmitted power limitation of each user, the formulated problem is quasi-convex. Thus, a bisection search (BSS) iterative algorithm is proposed to obtain the minimum task completion time. To reduce the complexity of the BSS algorithm and evaluate its optimality, we further derive the closed-form expressions of the optimal task partition ratio and offloading power for two-user NOMA MEC networks based on the analysed results. Simulation results demonstrate the convergence and optimality of the proposed a BSS algorithm and the effectiveness of the proposed optimal derivation.
The fundamental power allocation requirements for NOMA systems with minimum quality of service (QoS) requirements are investigated. For any minimum QoS rate $R_0$, the limits on the power allocation coefficients for each user are derived, such that a
ny power allocation coefficient outside of these limits creates an outage with probability equal to 1. The power allocation coefficients that facilitate each users success of performing successive interference cancellation (SIC) and decoding its own signal are derived, and are found to depend only on the target rate $R_0$ and the number of total users $K$. It is then proven that using these power allocation coefficients create the same outage event as if using orthogonal multiple access (OMA), which proves that the outage performance of NOMA with a fixed-power scheme can matched that of OMA for all users simultaneously. Simulations confirm the theoretical results, and also demonstrate that a power allocation strategy exists that can improve the outage performance of NOMA over OMA, even with a fixed-power strategy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
