اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks
74
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The implementation of device-to-device (D2D) underlaying or overlaying pre-existing cellular networks has received much attention due to the potential of enhancing the total cell throughput, reducing power consumption and increasing the instantaneous data rate. In this paper we propose a distributed power allocation scheme for D2D OFDMA communications and, in particular, we consider the two operating modes amenable to a distributed implementation: dedicated and reuse modes. The proposed schemes address the problem of maximizing the users sum rate subject to power constraints, which is known to be nonconvex and, as such, extremely difficult to be solved exactly. We propose here a fresh approach to this well-known problem, capitalizing on the fact that the power allocation problem can be modeled as a potential game. Exploiting the potential games property of converging under better response dynamics, we propose two fully distributed iterative algorithms, one for each operation mode considered, where each user updates sequentially and autonomously its power allocation. Numerical results, computed for several different user scenarios, show that the proposed methods, which converge to one of the local maxima of the objective function, exhibit performance close to the maximum achievable optimum and outperform other schemes presented in the literature.
قيم البحث
اقرأ أيضاً
In this paper, we study the resource allocation in D2D underlaying cellular network with uncertain channel state information (CSI). For satisfying the diversity requirements of different users, i.e. the minimum rate requirement for cellular user and
the reliability requirement for D2D user, we attempt to maximize the cellular users throughput whilst ensuring a chance constraint for D2D user. Then, a robust resource allocation framework is proposed for solving the highly intractable chance constraint about D2D reliability requirement, where the CSI uncertainties are represented as a deterministic set and the reliability requirement is enforced to hold for any uncertain CSI within it. Then, a symmetrical-geometry-based learning approach is developed to model the uncertain CSI into polytope, ellipsoidal and box. After that, we derive the robust counterpart of the chance constraint under these uncertainty sets as the computation convenient convex sets. To overcome the conservatism of the symmetrical-geometry-based uncertainty sets, we develop a support vector clustering (SVC)-based approach to model uncertain CSI as a compact convex uncertainty set. Based on that, the chance constraint of D2D is converted into a linear convex set. Then, we develop a bisection search-based power allocation algorithm for solving the resource allocation in D2D underlaying cellular network with different robust counterparts. Finally, we conduct the simulation to compare the proposed robust optimization approaches with the non-robust one.
In this paper, a Device-to-Device communication on unlicensed bands (D2D-U) enabled network is studied. To improve the spectrum efficiency (SE) on the unlicensed bands and fit its distributed structure while ensuring the fairness among D2D-U links an
d the harmonious coexistence with WiFi networks, a distributed joint power and spectrum scheme is proposed. In particular, a parameter, named as price, is defined, which is updated at each D2D-U pair by a online trained Neural network (NN) according to the channel state and traffic load. In addition, the parameters used in the NN are updated by two ways, unsupervised self-iteration and federated learning, to guarantee the fairness and harmonious coexistence. Then, a non-convex optimization problem with respect to the spectrum and power is formulated and solved on each D2D-U link to maximize its own data rate. Numerical simulation results are demonstrated to verify the effectiveness of the proposed scheme.
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D li
nks. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links (CDLs) and non-cooperative D2D links (NDLs), which is NP-hard. To solve the problem, we decompose it into two subproblems that maximize the sum rates of the CDLs and the NDLs, respectively. For CDL optimization, we propose a semi-orthogonal-based algorithm for joint user scheduling and power allocation. For NDL optimization, we propose a novel low-complexity algorithm to perform link scheduling and develop a Difference of Convex functions (D.C.) programming method to solve the non-convex power allocation problem. Simulation results show that the cooperative transmission can significantly increase both the number of served users and the overall system throughput.
Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple ac
cess (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.
We study the problem of allocating limited feedback resources across multiple users in an orthogonal-frequency-division-multiple-access downlink system with slow frequency-domain scheduling. Many flavors of slow frequency-domain scheduling (e.g., per
sistent scheduling, semi-persistent scheduling), that adapt user-sub-band assignments on a slower time-scale, are being considered in standards such as 3GPP Long-Term Evolution. In this paper, we develop a feedback allocation algorithm that operates in conjunction with any arbitrary slow frequency-domain scheduler with the goal of improving the throughput of the system. Given a user-sub-band assignment chosen by the scheduler, the feedback allocation algorithm involves solving a weighted sum-rate maximization at each (slow) scheduling instant. We first develop an optimal dynamic-programming-based algorithm to solve the feedback allocation problem with pseudo-polynomial complexity in the number of users and in the total feedback bit budget. We then propose two approximation algorithms with complexity further reduced, for scenarios where the problem exhibits additional structure.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
