اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Resource Allocation for Cellular Networks with Virtual Cell Joint Decoding
318
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This work presents a new resource allocation optimization framework for cellular networks using neighborhood-based optimization. Under this optimization framework resources are allocated within virtual cells encompassing several base-stations and the users within their coverage area. Incorporating the virtual cell concept enables the utilization of more sophisticated cooperative communication schemes such as coordinated multi-point decoding. We form the virtual cells using hierarchical clustering given a particular number of such cells. Once the virtual cells are formed, we consider a cooperative decoding scheme in which the base-stations in each virtual cell jointly decode the signals that they receive. We propose an iterative solution for the resource allocation problem resulting from the cooperative decoding within each virtual cell. Numerical results for the average system sum rate of our network design under hierarchical clustering are presented. These results indicate that virtual cells with neighborhood-based optimization leads to significant gains in sum rate over optimization within each cell, yet may also have a significant sum-rate penalty compared to fully-centralized optimization.
قيم البحث
اقرأ أيضاً
This work presents a new network optimization framework for cellular networks using neighborhood-based optimization. Under this optimization framework resources are allocated within virtual cells encompassing several base-stations and the users withi
n their coverage areas. We form the virtual cells using hierarchical clustering with a minimax linkage criterion given a particular number of such cells. Once the virtual cells are formed, we consider an interference coordination model in which base-stations in a virtual cell jointly allocate the channels and power to users within the virtual cell. We propose two new schemes for solving this mixed integer NP-hard resource allocation problem. The first scheme transforms the problem into a continuous variables problem; the second scheme proposes a new channel allocation method and then alternately solves the channel allocation problem using this new method, and the power allocation problem. We evaluate the average system sum rate of these schemes for a variable number of virtual cells. These results quantify the sum-rate along a continuum of fully-centralized versus fully-distributed optimization for different clustering and resource allocation strategies. These results indicate that the penalty of fully-distributed optimization versus fully-centralized (cloud RAN) can be as high as 50%. However, if designed properly, a few base stations within a virtual cell using neighborhood-based optimization have almost the same performance as fully-centralized optimization.
This work proposes a new resource allocation optimization and network management framework for wireless networks using neighborhood-based optimization rather than fully centralized or fully decentralized methods. We propose hierarchical clustering wi
th a minimax linkage criterion for the formation of the virtual cells. Once the virtual cells are formed, we consider two cooperation models: the interference coordination model and the coordinated multi-point decoding model. In the first model base stations in a virtual cell decode their signals independently, but allocate the communication resources cooperatively. In the second model base stations in the same virtual cell allocate the communication resources and decode their signals cooperatively. We address the resource allocation problem for each of these cooperation models. For the interference coordination model this problem is an NP-hard mixed-integer optimization problem whereas for the coordinated multi-point decoding model it is convex. Our numerical results indicate that proper design of the neighborhood-based optimization leads to significant gains in sum rate over fully decentralized optimization, yet may also have a significant sum rate penalty compared to fully centralized optimization. In particular, neighborhood-based optimization has a significant sum rate penalty compared to fully centralized optimization in the coordinated multi-point model, but not the interference coordination model.
This work proposes a new resource allocation optimization framework for cellular networks using fog or neighborhood-based optimization rather than fully centralized or fully decentralized methods. In neighborhood-based optimization resources are allo
cated within virtual cells encompassing several base-stations and the users within their coverage area. As the number of base-stations within a virtual cell increases, the framework reverts to centralized optimization, and as this number decreases it reverts to decentralized optimization. We address two tasks that must be carried out in the fog optimization framework: forming the virtual cells and allocating the communication resources in each virtual cell effectively. We propose hierarchical clustering for the formation of the virtual cells given a particular number of such cells. Once the virtual cells are formed, we consider several optimization methods to solve the NP-hard joint channel access and power allocation problem within each virtual cell in order to maximize the sum rate of the entire system. We present numerical results for the system sum rate of each scheme under hierarchical clustering. Our results indicate that proper design of the fog optimization results in little degradation relative to centralized optimization even for a relatively large number of virtual cells. However, improper design leads to a significant decrease in sum rate relative to centralized optimization.
We consider energy-efficient wireless resource management in cellular networks where BSs are equipped with energy harvesting devices, using statistical information for traffic intensity and harvested energy. The problem is formulated as adapting BSs
on-off states, active resource blocks (e.g. subcarriers) as well as power allocation to minimize the average grid power consumption in a given time period while satisfying the users quality of service (blocking probability) requirements. It is transformed into an unconstrained optimization problem to minimize a weighted sum of grid power consumption and blocking probability. A two-stage dynamic programming (DP) algorithm is then proposed to solve this optimization problem, by which the BSs on-off states are optimized in the first stage, and the active BSs resource blocks are allocated iteratively in the second stage. Compared with the optimal joint BSs on-off states and active resource blocks allocation algorithm, the proposed algorithm greatly reduces the computational complexity, while at the same time achieves close to the optimal energy saving performance.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
