Power Allocation, Channel Reuse, and Positioning of Flying Base Stations with Realistic Backhaul

2021 ◽  
pp. 1-1
Author(s):  
Pavel Mach ◽  
Zdenek Becvar ◽  
Mehyar Najla
Keyword(s):  
Power Allocation ◽  
Base Stations ◽  
Channel Reuse

scholarly journals AWGN and Rayleigh Fading Behavior of the Wireless Decode-and-Forward Relay Channel with Arbitrary Time and Power Allocation

2018 ◽  
Vol 10 (1) ◽  
pp. 248
Author(s):  
Muhammad Zarol Fitri Khairol Fauz ◽  
Elsheikh Mohamed Ahmed Elsheikh
Keyword(s):  
Mutual Information ◽  
Power Allocation ◽  
Fading Channels ◽  
Time Allocation ◽  
Rayleigh Fading ◽  
Cellular Systems ◽  
Base Stations ◽  
Relay Channel ◽  
Decode And Forward ◽  
Half Duplex

Relying has in use for decades to tackle some of the challenges of wireless communication such as extending transmitting distance, transmitting over rough terrains. Diversity achieved through relaying is also a means to combat the random behavior of fading channels. In this work, effect of time and power allocation on relay performance is studied. The channel considered is the three-node channel with half-duplex constraint on the relay. The relaying technique assumed is decode-and-forward. Mutual information is used as the criteria to measure channel performance. There is half-duplex constraint and a total transmission power constraint on the relay source node and the relay node. A model is established to analyze the mutual information as a function of time allocation and power allocation in the case of AWGN regime. The model is extended to the Rayleigh fading scenario. In both AWGN and Rayleigh fading, results showed that the importance of relaying is more apparent when more resources are allocated to the relay. It was also shown that quality of the source to destination link has direct impact on the decision to relay or not to relay. Relatively good source to destination channel makes relaying less useful. The opposite is true for the other two links, namely the source to relay channel and the relay to destination channel. When these two channels are good, relaying becomes advantageous. When applied to cellular systems, we concluded that relaying is more beneficial to battery-operated mobile nodes than to base stations.

scholarly journals Clustering and Auction-Based Power Allocation Algorithm for Energy Efficiency Maximization in Multi-Cell Multi-Carrier NOMA Networks

2019 ◽  
Vol 9 (23) ◽  
pp. 5034 ◽  
Author(s):  
Abuzar B. M. Adam ◽  
Xiaoyu Wan ◽  
Zhengqiang Wang
Keyword(s):  
Energy Efficiency ◽  
Power Allocation ◽  
Cooperative Game ◽  
Multiple Access ◽  
Optimization Problem ◽  
Interference Mitigation ◽  
Base Stations ◽  
Frequency Division ◽  
Simulation Results ◽  
Inter Cell Interference

In this paper, we investigate the energy efficiency (EE) maximization in multi-cell multi-carrier non-orthogonal multiple access (MCMC-NOMA) networks. To achieve this goal, an optimization problem is formulated then the solution is divided into two parts. First, we investigate the inter-cell interference mitigation and then we propose an auction-based non-cooperative game for power allocation for base stations. Finally, to guarantee the rate requirements for users, power is allocated fairly to users. The simulation results show that the proposed scheme has the best performance compared with the existing NOMA-based fractional transmit power allocation (FTPA) and the conventional orthogonal frequency division multiple access (OFDMA).

scholarly journals Energy Efficiency Maximization of Dynamic CoMP-JT Algorithm in Dense Small Cell Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Xuefei Peng ◽  
Jiandong Li ◽  
Yifei Xu
Keyword(s):  
Energy Efficiency ◽  
Power Allocation ◽  
Optimal Solution ◽  
Small Cell ◽  
Base Stations ◽  
Maximization Problem ◽  
Second Phase ◽  
User Association ◽  
Coordinated Multipoint ◽  
Convex Problem

We firstly formulate the energy efficiency (EE) maximization problem of joint user association and power allocation considering minimum data rate requirement of small cell users (SUEs) and maximum transmit power constraint of small cell base stations (SBSs), which is NP-hard. Then, we propose a dynamic coordinated multipoint joint transmission (CoMP-JT) algorithm to improve EE. In the first phase, SUEs are associated with the SBSs close to them to reduce the loss of power by the proposed user association algorithm, where the associated SBSs of each small cell user (SUE) form a dynamic CoMP-JT set. In the second phase, through the methods of fractional programming and successive convex approximation, we transform the EE maximization subproblem of power allocation for SBSs into a convex problem that can be solved by proposed power allocation optimization algorithm. Moreover, we show that the proposed solution has a much lower computational complexity than that of the optimal solution obtained by exhaustive search. Simulation results demonstrate that the proposed solution has a better performance.

scholarly journals Coordinated Multicast Precoding for Multi-Cell Massive MIMO Transmission Exploiting Statistical Channel State Information

Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 338 ◽  
Author(s):  
Li You ◽  
Xu Chen ◽  
Wenjin Wang ◽  
Xiqi Gao
Keyword(s):  
Power Allocation ◽  
Channel State Information ◽  
Matrix Theory ◽  
Multiple Input Multiple Output ◽  
Base Stations ◽  
Channel State ◽  
State Information ◽  
Design Objective ◽  
Deterministic Equivalent ◽  
Input Multiple Output

This paper considers coordinated multi-cell multicast precoding for massive multiple-input-multiple-output transmission where only statistical channel state information of all user terminals (UTs) in the coordinated network is known at the base stations (BSs). We adopt the sum of the achievable ergodic multicast rate as the design objective. We first show the optimal closed-form multicast signalling directions of each BS, which simplifies the coordinated multicast precoding problem into a coordinated beam domain power allocation problem. Via invoking the minorization-maximization framework, we then propose an iterative power allocation algorithm with guaranteed convergence to a stationary point. In addition, we derive the deterministic equivalent of the design objective to further reduce the optimization complexity via invoking the large-dimensional random matrix theory. Numerical results demonstrate the performance gain of the proposed coordinated approach over the conventional uncoordinated approach, especially for cell-edge UTs.

Sign in / Sign up

Export Citation Format

Share Document