scholarly journals Greedy Based Radio Resource Allocation Algorithm with SARSA Power Control Scheme in D2D Underlaying Communication

2020 ◽  
Vol 7 (1) ◽  
pp. 6
Author(s):  
Astri Wulandari ◽  
Nachwan Mufti Adriansyah ◽  
Vinsensius Sigit Widhi Prabowo
Keyword(s):  
Resource Allocation ◽  
Power Allocation ◽  
Communication System ◽  
Greedy Algorithms ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm ◽  
Allocation Process ◽  
System Data ◽  
Resource Allocation Scheme ◽  
Resource Allocation Process

Device-to-Device (D2D) underlaying communication system is a solution in reducing the workload of eNodeB and increasing the system data rate. This communication system consists of two users, namely Cellular User Equipment (CUE) and D2D pair, where CUE will share its resources with the D2D pair. This sharing resources also causes interference and should be managed using the resource allocation algorithm. In this work, the resource allocation scheme occurs in a single cell with an uplink communication direction. The resource allocation process uses greedy and joint greedy algorithms. After CUE allocates all of its resources, SARSA algorithm performs the power allocation process. The resource allocation process involves the scheduled CUE and D2D pair. After all the resource and power are allocated, parameter performance of the system is calculated. Based on the work results, joint greedy algorithm with power allocation using SARSA algorithm have performance results 1.375 × 107 bps/Watt in energy efficiency, 43.105 bps/Hz in spectral efficiency, and 0.993 in D2D fairness index.

Formation of the schedule at the university with the application of greedy algorithms

2020 ◽  
Vol 4 ◽  
pp. 91-96
Author(s):  
Olga Lopateeva ◽  
◽  
Anatoly Popov ◽  
Alexey Ovsyankin ◽  
Mikhail Satsuk
Keyword(s):  
Resource Allocation ◽  
Greedy Algorithms ◽  
Educational Institution ◽  
Educational Process ◽  
Student Groups ◽  
Resource Allocation Algorithm ◽  
Allocation Process ◽  
The University ◽  
Resource Allocation Process

A greedy resource allocation algorithm is understood as an algorithm according to which the resource allocation process can be represented as a sequence of steps. At each step, an optimal, under certain conditions, distribution of a part of the resources occurs, which does not change in the future. The problem of improving the quality of the organization of the educational process in a higher educational institution is solved on the basis of the use of greedy algorithms. A well-designed timetable should ensure an even workload of student groups and faculty. The purpose of this work is to develop an algorithm that can improve the quality of the formation of the educational schedule based on the use of greedy algorithms.

scholarly journals An Efficient Resource Allocation Algorithm for OFDM-Based NOMA in 5G Systems

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1399 ◽  
Author(s):  
Omar A. Saraereh ◽  
Amer Alsaraira ◽  
Imran Khan ◽  
Peerapong Uthansakul
Keyword(s):  
Resource Allocation ◽  
Power Allocation ◽  
Multiple Access ◽  
Low Complexity ◽  
System Capacity ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm ◽  
User Grouping ◽  
Power Domain ◽  
Efficient Resource

Non-orthogonal multiple access (NOMA) has become the key technology in the future 5G wireless networks. It can achieve multi-user multiplexing in the transmit power domain by allocating different power, which can effectively improve the system capacity and spectral efficiency. Aiming at the problem of high computational complexity and improving system capacity in non-orthogonal multiple access (NOMA) based on orthogonal frequency division multiple access (OFDMA) for 5G wireless cellular networks, this paper proposes an improved low complexity radio resource allocation algorithm for user grouping and power allocation optimization. The optimization model is established with the goal of maximizing system capacity. Through the step-by-step optimization idea, the complex non-convex optimization problem is decomposed into two sub-problems to be solved separately. Firstly, all users are grouped based on the greedy method, and then the power allocation is performed on the sub-carriers of the fixed group. Simulation results show that the proposed algorithm has better system capacity than the existing state-of-the-art algorithms and reduced complexity performance.

Low-Complexity Resource Allocation Algorithm for Multicell OFDMA System

2013 ◽  
Vol E96.B (5) ◽  
pp. 1218-1221 ◽  
Author(s):  
Qingli ZHAO ◽  
Fangjiong CHEN ◽  
Sujuan XIONG ◽  
Gang WEI
Keyword(s):  
Resource Allocation ◽  
Low Complexity ◽  
Ofdma System ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm
Sign in / Sign up

Export Citation Format

Share Document