587 research outputs found
Weighted Max-Min Resource Allocation for Frequency Selective Channels
In this paper, we discuss the computation of weighted max-min rate allocation
using joint TDM/FDM strategies under a PSD mask constraint. We show that the
weighted max-min solution allocates the rates according to a predetermined rate
ratio defined by the weights, a fact that is very valuable for
telecommunication service providers. Furthermore, we show that the problem can
be efficiently solved using linear programming. We also discuss the resource
allocation problem in the mixed services scenario where certain users have a
required rate, while the others have flexible rate requirements. The solution
is relevant to many communication systems that are limited by a power spectral
density mask constraint such as WiMax, Wi-Fi and UWB
Delay aware optimal resource allocation in MU MIMO-OFDM using enhanced spider monkey optimization
In multiple users MIMO- OFDM system allocates the available resources to the optimal users is a difficult task. Hence the scheduling and resource allocation become the major problem in the wireless network mainly in case of multiple input and multiple output method that has to be made efficient. There is various method introduced to give an optimal solution to the problem yet it has many drawbacks. So we propose this paper to provide an efficient solution for resource allocation in terms of delay and also added some more features such as high throughout, energy efficient and fairness. To make optimal resource allocation we introduce optimization algorithm named spider monkey with an enhancement which provides the efficient solution. In this optimization process includes the scheduling and resource allocation, the SNR values, channel state information (CSI) from the base station. To make more efficient finally we perform enhanced spider - monkey algorithm hence the resource allocation is performed based on QoS requirements. Thus the simulation results in our paper show high efficiency when compared with other schedulers and techniques
Low Complexity WMMSE Power Allocation In NOMA-FD Systems
In this paper we study the problem of power and channel allocation with the
objective of maximizing the system sum-rate for multicarrier non-orthogonal
multiple access (NOMA) full duplex (FD) systems. Such an allocation problem is
non-convex and, thus, with the goal of designing a low complexity solution, we
propose a scheme based on the minimization of the weighted mean square error,
which achieves performance reasonably close to the optimum and allows to
clearly outperforms a conventional orthogonal multiple access approach.
Numerical results assess the effectiveness of our algorithm.Comment: 5 pages conference paper, 3 figures. Submitted on ICASSP 202
Power Control in Massive MIMO with Dynamic User Population
This paper considers the problem of power control in Massive MIMO systems
taking into account the pilot contamination issue and the arrivals and
departures of users in the network. Contrary to most of existing work in MIMO
systems that focuses on the physical layer with fixed number of users, we
consider in this work that the users arrive dynamically and leave the network
once they are served. We provide a power control strategy, having a polynomial
complexity, and prove that this policy stabilizes the network whenever
possible. We then provide a distributed implementation of the power control
policy requiring low information exchange between the BSs and show that it
achieves the same stability region as the centralized policy.Comment: conference paper, submitte
- …