اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUtility Maximization for Single-Station User Association in Downlink Cellular Networks
70
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study network utility maximization (NUM) in the context of cellular single station association (SSA) policies, which assigns each mobile user (MU) to a single base station (BS). We measure an SSA policy in terms of the induced alpha-proportional fairness utility of each users downlink rate, summed over all users. The general SSA NUM problem involves choosing an optimal association from MUs to BSs as well as an optimal allocation of BS resources to associated MUs. Finding an exact solution to such centralized user association problems is well-known to be NP-hard. Our contributions are as follows: i) we give an explicit solution for the optimal BS allocation for a given SSA, which establishes SSA NUM as a purely combinatiorial problem; ii) we establish the integrality gap for the association problem to be one, and prove the relaxation to be a non-convex optimization problem; iii) we provide both centralized and distributed greedy algorithms for SSA, both with and without the exchange of instantaneous rate information between users and stations. Our numerical results illustrate performance gains of three classes of solutions: i) SSA solutions obtained by greedy rounding of multi-station associations (a centralized convex program), ii) our centralized and distributed greedy algorithms with/without rate information exchanged, and iii) simple association heuristics.
قيم البحث
اقرأ أيضاً
We consider the problem of video caching across a set of 5G small-cell base stations (SBS) connected to each other over a high-capacity short-delay back-haul link, and linked to a remote server over a long-delay connection. Even though the problem of
minimizing the overall video delivery delay is NP-hard, the Collaborative Caching Algorithm (CCA) that we present can efficiently compute a solution close to the optimal, where the degree of sub-optimality depends on the worst case video-to-cache size ratio. The algorithm is naturally amenable to distributed implementation that requires zero explicit coordination between the SBSs, and runs in $O(N + K log K)$ time, where $N$ is the number of SBSs (caches) and $K$ the maximum number of videos. We extend CCA to an online setting where the video popularities are not known a priori but are estimated over time through a limited amount of periodic information sharing between SBSs. We demonstrate that our algorithm closely approaches the optimal integral caching solution as the cache size increases. Moreover, via simulations carried out on real video access traces, we show that our algorithm effectively uses the SBS caches to reduce the video delivery delay and conserve the remote servers bandwidth, and that it outperforms two other reference caching methods adapted to our system setting.
In this paper, we study the performance of greedy scheduling in multihop wireless networks, where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. The dual can
be solved optimally, only with the knowledge of the maximal independent sets in the network. But computation of maximal independent sets is known to be NP-hard. Motivated by this, we propose a distributed greedy heuristic to address the problem of link scheduling. We evaluate the effect of the distributed greedy heuristic on aggregate utility maximization in detail, for the case of an arbitrary graph. We provide some insights into the factors affecting aggregate utility maximization in a network, by providing bounds on the same. We give simulation results for the approximate aggregate utility maximization achieved under distributed implementation of the greedy heuristic and find them close to the maximum aggregate utility obtained using optimal scheduling.
Reconfigurable intelligent surface (RIS) has been regarded as a revolutionary and promising technology owing to its powerful feature of adaptively shaping wireless propagation environment. However, as a frequency-selective device, the RIS can only ef
fectively provide tunable phase-shifts for signals within a certain frequency band. Thus, base-station (BS)-RIS-user association is an important issue to maximize the efficiency and ability of the RIS in cellular networks. In this paper, we consider a RIS-aided cellular network and aim to maximize the sum-rate of downlink transmissions by designing BS-RIS-user association as well as the active and passive beamforming of BSs and RIS, respectively. A dynamically successive access algorithm is developed to design the user association. During the dynamical access process, an iterative algorithm is proposed to alternatively obtain the active and passive beamforming. Finally, the optimal BS-RIS association is obtained by an exhaustive search method. Simulation results illustrate the significant performance improvement of the proposed BS-RIS-user association and beamforming design algorithm.
It is known that interference alignment (IA) plays an important role in improving the degree of freedom (DoF) of multi-input and multi-output (MIMO) systems. However, most of the traditional IA schemes suffer from the high computational complexity an
d require the global and instantaneous channel state information (CSI), both of which make them difficult to be extended to cellular MIMO systems. To handle these issues, two new interference alignment schemes, i.e., the retrospective interference regeneration (RIR) scheme and the beamforming based distributed retrospective interference alignment (B-DRIA) scheme, are proposed for cellular K-user MIMO downlink networks. For the RIR scheme, it adopts interference elimination algorithm to erase redundant symbols in inter-cell interference (ICI) signals, and then uses interference regeneration algorithm to avoid secondary interference. The RIR scheme obtains greater DoF gain than the retrospective interference alignment (RIA) scheme, but incurs performance degradation when the transceiver antennas ratio (TAR) approaches 1. Therefore, the B-DRIA scheme is further proposed. For the B-DRIA scheme, the cellular beamforming matrix is introduced to eliminate the ICI, and meanwhile distributed retrospective interference alignment algorithm is adopted to align inter-user interference (IUI). The simulation results show that the B-DRIA scheme obtains larger DoF than the RIR scheme locally. Specifically, when TAR approaches 1, two schemes obtain the same DoF. While TAR approaches 2, the DoF of the B-DRIA scheme is superior than the RIR scheme.
Ever since the inception of mobile telephony, the downlink and uplink of cellular networks have been coupled, i.e. mobile terminals have been constrained to associate with the same base station (BS) in both the downlink and uplink directions. New tre
nds in network densification and mobile data usage increase the drawbacks of this constraint, and suggest that it should be revisited. In this paper we identify and explain five key arguments in favor of Downlink/Uplink Decoupling (DUDe) based on a blend of theoretical, experimental, and logical arguments. We then overview the changes needed in current (LTE-A) mobile systems to enable this decoupling, and then look ahead to fifth generation (5G) cellular standards. We believe the introduced paradigm will lead to significant gains in network throughput, outage and power consumption at a much lower cost compared to other solutions providing comparable or lower gains.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
