Adaptive OFDMA Resource Allocation using Modified Multi-Dimension Genetic Algorithm

2016 ◽  
Vol 12 (1) ◽  
pp. 103-113 ◽  
Author(s):  
Mohammed Ibrahim ◽  
Haider AlSabbagh
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Power Allocation ◽  
Communication Systems ◽  
Optimal Solution ◽  
Solution Space ◽  
Allocation Problem ◽  
Base Stations ◽  
Resource Allocation Problem ◽  
Effective Parameters

A considerable work has been conducted to cope with orthogonal frequency division multiple access (OFDMA) resource allocation with using different algorithms and methods. However, most of the available studies deal with optimizing the system for one or two parameters with simple practical condition/constraints. This paper presents analyses and simulation of dynamic OFDMA resource allocation implementation with Modified Multi-Dimension Genetic Algorithm (MDGA) which is an extension for the standard algorithm. MDGA models the resource allocation problem to find the optimal or near optimal solution for both subcarrier and power allocation for OFDMA. It takes into account the power and subcarrier constrains, channel and noise distributions, distance between user's equipment (UE) and base stations (BS), user priority weight – to approximate the most effective parameters that encounter in OFDMA systems. In the same time multi dimension genetic algorithm is used to allow exploring the solution space of resource allocation problem effectively with its different evolutionary operators: multi dimension crossover, multi dimension mutation. Four important cases are addressed and analyzed for resource allocation of OFDMA system under specific operation scenarios to meet the standard specifications for different advanced communication systems. The obtained results demonstrate that MDGA is an effective algorithm in finding the optimal or near optimal solution for both of subcarrier and power allocation of OFDMA resource allocation.

scholarly journals Optimizing the Spectrum and Power Allocation for D2D-Enabled Communication Systems Using DC Programming

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Guomei Gan ◽  
Yanhu Huang ◽  
Qiang Wang
Keyword(s):  
Resource Allocation ◽  
Power Allocation ◽  
Communication Systems ◽  
Dc Programming ◽  
Base Station ◽  
Allocation Problem ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Resource Allocation Problem ◽  
Subcarrier Assignment

Device to device (D2D) communication has recently attracted a lot of attentions since it can significantly improve the system throughput and reduce the energy consumption. Indeed, the devices can communicate with each other in a D2D system, and the base station (BS) can share the spectrum with D2D users, which can efficiently improve the spectrum and energy efficiency. Nevertheless, spectrum sharing also raises the difficulty of resource allocation owing to the serious cochannel interference. To reduce the interference, the transmit power of the D2D pairs and BS to cellular users should be further optimized. In this paper, we consider the resource allocation problem of D2D networks involving the power allocation and subcarrier assignment. The resource allocation problem is formulated as a mixed integer programming problem which is difficult to solve. To reduce the computational complexity, the original problem is decomposed as two subproblems in terms of the subcarrier assignment and power allocation. For the subcarrier assignment problem, the particle swarm optimization (PSO) is adopted to solve it since the subcarrier assignment is an integer optimization problem, and it is difficult to be tackled using the traditional optimization approach. When the subcarrier assignment is fixed, there are only the power allocation variables in the original resource allocation problem. The difference of convex functions (DC) programming is adopted to solve the power allocation problem. Simulation results demonstrate the effectiveness of the proposed resource allocation scheme of D2D networks.

Heuristic Task Consolidation Techniques for Energy Efficient Cloud Computing

2015 ◽  
pp. 238-260 ◽  
Author(s):  
Dilip Kumar ◽  
Bibhudatta Sahoo ◽  
Tarni Mandal
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Data Centers ◽  
Optimal Solution ◽  
Solution Space ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Cloud Infrastructure ◽  
Two Phase ◽  
Phase Selection

The energy consumption in the cloud is proportional to the resource utilization and data centers are almost the world's highest consumers of electricity. The complexity of the resource allocation problem increases with the size of cloud infrastructure and becomes difficult to solve effectively. The exponential solution space for the resource allocation problem can be searched using heuristic techniques to obtain a sub-optimal solution at the acceptable time. This chapter presents the resource allocation problem in cloud computing as a linear programming problem, with the objective to minimize energy consumed in computation. This resource allocation problem has been treated using heuristic approaches. In particular, we have used two phase selection algorithm ‘FcfsRand', ‘FcfsRr', ‘FcfsMin', ‘FcfsMax', ‘MinMin', ‘MedianMin', ‘MaxMin', ‘MinMax', ‘MedianMax', and ‘MaxMax'. The simulation results indicate in the favor of MaxMax.

Heuristic Task Consolidation Techniques for Energy Efficient Cloud Computing

2016 ◽  
pp. 760-782 ◽  
Author(s):  
Dilip Kumar ◽  
Bibhudatta Sahoo ◽  
Tarni Mandal
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Data Centers ◽  
Optimal Solution ◽  
Solution Space ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Cloud Infrastructure ◽  
Two Phase ◽  
Phase Selection

The energy consumption in the cloud is proportional to the resource utilization and data centers are almost the world's highest consumers of electricity. The complexity of the resource allocation problem increases with the size of cloud infrastructure and becomes difficult to solve effectively. The exponential solution space for the resource allocation problem can be searched using heuristic techniques to obtain a sub-optimal solution at the acceptable time. This chapter presents the resource allocation problem in cloud computing as a linear programming problem, with the objective to minimize energy consumed in computation. This resource allocation problem has been treated using heuristic approaches. In particular, we have used two phase selection algorithm ‘FcfsRand', ‘FcfsRr', ‘FcfsMin', ‘FcfsMax', ‘MinMin', ‘MedianMin', ‘MaxMin', ‘MinMax', ‘MedianMax', and ‘MaxMax'. The simulation results indicate in the favor of MaxMax.

A Multi-Objective Decision and Analysis Approach for the Berth Scheduling Problem

2012 ◽  
pp. 1-20
Author(s):  
Mihalis M. Golias ◽  
Maria Boilé ◽  
Sotirios Theofanis ◽  
Heidi A. Taboada
Keyword(s):  
Resource Allocation ◽  
Container Terminal ◽  
Solution Space ◽  
Allocation Problem ◽  
Container Terminals ◽  
Analysis Approach ◽  
Scheduling Problem ◽  
Resource Allocation Problem ◽  
Multi Objective ◽  
Berth Scheduling

Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading performance on the other objectives. In this paper, the authors present the application of a multi-objective decision and analysis approach to the berth scheduling problem, a resource allocation problem at container terminals. The proposed approach allows the port operator to efficiently select a subset of solutions over the entire solution space of berth schedules when multiple and conflicting objectives are involved. Results from extensive computational examples using real-world data show that the proposed approach is able to construct and select efficient berth schedules, is consistent, and can be used with confidence.

A Multi-Objective Decision and Analysis Approach for the Berth Scheduling Problem

2010 ◽  
Vol 1 (1) ◽  
pp. 54-73 ◽  
Author(s):  
Mihalis M. Golias ◽  
Maria Boilé ◽  
Sotirios Theofanis ◽  
Heidi A. Taboada
Keyword(s):  
Resource Allocation ◽  
Container Terminal ◽  
Solution Space ◽  
Allocation Problem ◽  
Analysis Approach ◽  
Scheduling Problem ◽  
Resource Allocation Problem ◽  
Multi Objective ◽  
Conflicting Objectives ◽  
Berth Scheduling

Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading performance on the other objectives. In this paper, the authors present the application of a multi-objective decision and analysis approach to the berth scheduling problem, a resource allocation problem at container terminals. The proposed approach allows the port operator to efficiently select a subset of solutions over the entire solution space of berth schedules when multiple and conflicting objectives are involved. Results from extensive computational examples using real-world data show that the proposed approach is able to construct and select efficient berth schedules, is consistent, and can be used with confidence.

Sign in / Sign up

Export Citation Format

Share Document