Raad S. Alhumaima
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Raad S. Alhumaima has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Hamed Al-Raweshidy
Department of Electronic and Electrical Engineering, College of Engineering, Design and Physical Sciences, Brunel University of London, Uxbridge, U.K.
5 shared publications Wisam Hasan Ali
School of Electrical and Electronic Engineering, Engineering Campus, Universiti Sains Malaysia, Nibong Tebal, Pulau Pinang, Malaysia
4 shared publications- Yassir Al‐Karawi
Department of Communications Engineering, University of Diyala, Diyala, Iraq
3 shared publications - Ahmed Hamid Elias
College of Health and Medical Techniques Al-Furat Al-Awsat Technical University Najaf Iraq
2 shared publications Basit N. Khalaf
Department of Communications University of Diyala Baqubah Iraq
2 shared publications- Mohd Nazri Mahmud
School of Electrical and Electronic Engineering, Engineering Campus, Universiti Sains Malaysia, Nibong Tebal, Pulau Pinang, Malaysia
2 shared publications
Latest Publications
- Open Access
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 2306-2330
A Predictive Load Balancing Optimization Framework for Open Radio Access Networks via Xn Protocol
Open radio access networks (ORANs) implement a new paradigm based on the Xn protocol (high-level C/U split) that improves interoperability between open distributed units (O-DUs), open central units (O-CUs) and open radio units (O-RUs). In this paper, some of the most critical issues such as heterogeneous user (UE) requirements and preferences, limited resources, dynamic variation in the conditions of the network, and inherent interference in the ORAN are solved by optimizing load balancing and resource allocation. We focus in this paper on using Xn interface for load balancing without relying on external algorithms and techniques for efficient load sharing and coordination among next-generation node base stations (gNBs) and to promote multi-vendor intercommunication, not to mention reducing the overhead costs. The predictive load balancing was represented in the form of a weighted metric via several scenarios of multi-objectives optimization problems to maximize network efficiency while improving energy efficiency (EE), minimizing delay, and maximize bandwidth utilization. Numerical simulations based on UEs and gNBs validate the efficiency of these models, demonstrating the enhanced quality of service (QoS). Lagrange multiplier method with standard constrained numerical optimization solvers including sequential quadratic programming (SQP), active set and interior point methods has been used to solve the formulated optimization problems. These solvers are used to validate the effectiveness of the proposed frameworks on scenarios with different allocation approaches (i.e., static, proportional, priority-based, and priority-weighted proportional). The analysis of these allocations highlights the balance between resource fairness and user satisfaction by achieving load distribution among O-DUs and virtual machines (VMs), resulting in reduced load variance and enhanced fairness. Subsequently, application-level QoS measurements, such as throughput, latency, and EE shows that UEs are satisfied with fluctuating networks. Last, the proposed Xn-based models are compared with a classical load balancing model, namely autoregressive integrated moving average (ARIMA) model.
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 2306-2330
Open AccessA Predictive Load Balancing Optimization Framework for Open Radio Access Networks via Xn Protocol
Open radio access networks (ORANs) implement a new paradigm based on the Xn protocol (high-level C/U split) that improves interoperability between open distributed units (O-DUs), open central units (O-CUs) and open radio units (O-RUs). In this paper, some of the most critical issues such as heterogeneous user (UE) requirements and preferences, limited resources, dynamic variation in the conditions of the network, and inherent interference in the ORAN are solved by optimizing load balancing and resource allocation. We focus in this paper on using Xn interface for load balancing without relying on external algorithms and techniques for efficient load sharing and coordination among next-generation node base stations (gNBs) and to promote multi-vendor intercommunication, not to mention reducing the overhead costs. The predictive load balancing was represented in the form of a weighted metric via several scenarios of multi-objectives optimization problems to maximize network efficiency while improving energy efficiency (EE), minimizing delay, and maximize bandwidth utilization. Numerical simulations based on UEs and gNBs validate the efficiency of these models, demonstrating the enhanced quality of service (QoS). Lagrange multiplier method with standard constrained numerical optimization solvers including sequential quadratic programming (SQP), active set and interior point methods has been used to solve the formulated optimization problems. These solvers are used to validate the effectiveness of the proposed frameworks on scenarios with different allocation approaches (i.e., static, proportional, priority-based, and priority-weighted proportional). The analysis of these allocations highlights the balance between resource fairness and user satisfaction by achieving load distribution among O-DUs and virtual machines (VMs), resulting in reduced load variance and enhanced fairness. Subsequently, application-level QoS measurements, such as throughput, latency, and EE shows that UEs are satisfied with fluctuating networks. Last, the proposed Xn-based models are compared with a classical load balancing model, namely autoregressive integrated moving average (ARIMA) model.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 8568-8573
Quantum Cognitive Radar: Adaptive Detection With Entanglement Under Thermal-Loss Channels
An adaptive Quantum-Cognitive Radar (QCR), which incorporates a two-mode squeezed-vacuum (TMSV) transmitter, a joint idler-signal receiver, and a Quantum Neural Network (QNN) controller to optimize parameters in real time, is introduced through this exchange of correspondence. An expression for a Gaussian correlation detector has been found for thermal-loss channels and compared with the quantum Chernoff bound (QCB). Hardware-aware simulations show that QCR achieves higher detection probability $P_{D}$ at a fixed false-alarm probability $P_{\text{FA}}$ (i.e., the probability of declaring a target when it is absent) than both coherent-state radar and nonadaptive quantum baselines. At $P_{\text{FA}}=0.05$, QCR provides an approximately 3 dB advantage with up to 40% reduction in integration time while maintaining robustness as background noise increases. At the operationally stringent $P_{\text{FA}}=10^{-3}$, QCR achieves $P_{D}=0.47$ versus 0.20 for classical radar, corresponding to a 135% relative improvement. The receiver requires only homodyne/heterodyne sampling and digital correlation, making it compatible with noisy intermediate-scale quantum (NISQ) hardware. The adaptive policy optimizes the parameter vector $(M,N_{S},B,T_{\text{int}},G)$ under fixed energy constraints, demonstrating that online adaptation preserves and extends quantum-illumination advantages in nonstationary sensing environments.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 8568-8573
Quantum Cognitive Radar: Adaptive Detection With Entanglement Under Thermal-Loss Channels
An adaptive Quantum-Cognitive Radar (QCR), which incorporates a two-mode squeezed-vacuum (TMSV) transmitter, a joint idler-signal receiver, and a Quantum Neural Network (QNN) controller to optimize parameters in real time, is introduced through this exchange of correspondence. An expression for a Gaussian correlation detector has been found for thermal-loss channels and compared with the quantum Chernoff bound (QCB). Hardware-aware simulations show that QCR achieves higher detection probability $P_{D}$ at a fixed false-alarm probability $P_{\text{FA}}$ (i.e., the probability of declaring a target when it is absent) than both coherent-state radar and nonadaptive quantum baselines. At $P_{\text{FA}}=0.05$, QCR provides an approximately 3 dB advantage with up to 40% reduction in integration time while maintaining robustness as background noise increases. At the operationally stringent $P_{\text{FA}}=10^{-3}$, QCR achieves $P_{D}=0.47$ versus 0.20 for classical radar, corresponding to a 135% relative improvement. The receiver requires only homodyne/heterodyne sampling and digital correlation, making it compatible with noisy intermediate-scale quantum (NISQ) hardware. The adaptive policy optimizes the parameter vector $(M,N_{S},B,T_{\text{int}},G)$ under fixed energy constraints, demonstrating that online adaptation preserves and extends quantum-illumination advantages in nonstationary sensing environments.
- Open Access
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 15 (1) , e70038
MT‐OPMNet: Attention‐Enhanced Multi‐Task Deep Learning for Joint OSNR Estimation and Modulation Format Recognition in Elastic Optical Networks
Optical performance monitoring (OPM) underpins quality of transmission in modern elastic optical networks. This paper introduces MT‐OPMNet, a multi‐task deep learning framework for joint optical signal‐to‐noise ratio (OSNR) estimation and modulation format identification (MFI) from asynchronous amplitude histograms extracted at coherent receivers. The model combines a shared one‐dimensional convolutional backbone, a channel‐aware attention module and two task‐specific heads for parameter‐efficient inference. Validation uses a corrected nine‐channel wavelength‐division‐multiplexed simulation dataset covering distances from 500 to 3000 km, symbol rates of 28 GBd and 64 GBd, five launch‐power levels and five modulation formats. At 28 GBd, MT‐OPMNet achieves an OSNR root‐mean‐square error of approximately 2.4 dB; over the grouped mixed‐rate test split, it achieves an average OSNR RMSE of 3.4 dB and an MFI accuracy of 97.5%, while reducing trainable parameters by 23.8% relative to two separate single‐task models. The analytical channel model is further cross‐validated using a split‐step Fourier waveform simulator, achieving mean histogram cosine similarity of 0.976 and zero‐shot transfer to SSFM‐generated waveforms with 100% MFI accuracy and 2.1 dB OSNR RMSE over 14–22 dB OSNR. CPU inference latency remains suitable for low‐latency monitoring studies.
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 15 (1) , e70038
Open AccessMT‐OPMNet: Attention‐Enhanced Multi‐Task Deep Learning for Joint OSNR Estimation and Modulation Format Recognition in Elastic Optical Networks
Optical performance monitoring (OPM) underpins quality of transmission in modern elastic optical networks. This paper introduces MT‐OPMNet, a multi‐task deep learning framework for joint optical signal‐to‐noise ratio (OSNR) estimation and modulation format identification (MFI) from asynchronous amplitude histograms extracted at coherent receivers. The model combines a shared one‐dimensional convolutional backbone, a channel‐aware attention module and two task‐specific heads for parameter‐efficient inference. Validation uses a corrected nine‐channel wavelength‐division‐multiplexed simulation dataset covering distances from 500 to 3000 km, symbol rates of 28 GBd and 64 GBd, five launch‐power levels and five modulation formats. At 28 GBd, MT‐OPMNet achieves an OSNR root‐mean‐square error of approximately 2.4 dB; over the grouped mixed‐rate test split, it achieves an average OSNR RMSE of 3.4 dB and an MFI accuracy of 97.5%, while reducing trainable parameters by 23.8% relative to two separate single‐task models. The analytical channel model is further cross‐validated using a split‐step Fourier waveform simulator, achieving mean histogram cosine similarity of 0.976 and zero‐shot transfer to SSFM‐generated waveforms with 100% MFI accuracy and 2.1 dB OSNR RMSE over 14–22 dB OSNR. CPU inference latency remains suitable for low‐latency monitoring studies.
- Open Access
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 202103-202131
Maximizing the Energy Efficiency of Open Radio Access Networks via Optimizing the Operational Parameters
Open radio access networks (ORANs), characterized by their emphasis on the disaggregation of hardware and software components of radio access networks (RANs) and the utilization of open standards, present fertile ground for flexibility and innovations. However, they also introduce complexities in managing bandwidth, user equipment (UE) power allocations, power consumption (PC), and virtualization. To maximize energy efficiency (EE), PC must be effectively managed, and transmitted power and bandwidth to UEs must be optimized. The task in ORANs is more complex due to new components, designs, and protocols. This paper is concerned with maximizing EE in the context of ORANs. The primary focus lies in the realm of virtual machines (VMs) allocation within a multi-tiered cloud infrastructure. To achieve such optimization, a thorough PC model is developed, incorporating various network parameters, including the number of resource blocks (RBs), the number of connected UEs of each VM, the total number of UEs, the initial and maximum power of the server, the number of VMs, the transmitted power, signal-to-interference-noise ratio (SINR), and bandwidth. This work also optimizes the EE through resource allocation models, focusing on open interfaces such as enhanced common public radio interface (eCPRI) and 7.2x fronthaul. It also explores virtualization and network protocols’ role in managing channel capacity and latency, highlighting the trade-off between throughput and protocol overhead. A complex optimization methodology, namely the Lagrange multiplier has been used along with three numerical algorithms: sequential quadratic programming (SQP), active set, and interior point to solve the objective of maximizing EE. The outcomes of this research show the influence of network parameters on PC and EE under some constraints, including the number of UEs, the number of VMs, the number of RBs, and channel capacity. The problem has been recognized as a non-linear problem characterized by inequality restrictions with mixed convexity and concavity behavior. However, different convergence criteria can impact the EE, as more stringent convergence criteria may result in less accurate solutions, and vice versa. For the three algorithms, the interior point and SQP algorithms outperform the active set in most of the cases. Under optimized configurations, SQP enhanced EE by approximately 15% compared to traditional architecture. In addition, 50% increment in the number of UEs, concurrent with 50% less VMs’ allocation when using SQP were achieved compared with interior point. Finally, 15% decrease in latency was accomplished when using interior point compared to SQP.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 202103-202131
Open AccessMaximizing the Energy Efficiency of Open Radio Access Networks via Optimizing the Operational Parameters
Open radio access networks (ORANs), characterized by their emphasis on the disaggregation of hardware and software components of radio access networks (RANs) and the utilization of open standards, present fertile ground for flexibility and innovations. However, they also introduce complexities in managing bandwidth, user equipment (UE) power allocations, power consumption (PC), and virtualization. To maximize energy efficiency (EE), PC must be effectively managed, and transmitted power and bandwidth to UEs must be optimized. The task in ORANs is more complex due to new components, designs, and protocols. This paper is concerned with maximizing EE in the context of ORANs. The primary focus lies in the realm of virtual machines (VMs) allocation within a multi-tiered cloud infrastructure. To achieve such optimization, a thorough PC model is developed, incorporating various network parameters, including the number of resource blocks (RBs), the number of connected UEs of each VM, the total number of UEs, the initial and maximum power of the server, the number of VMs, the transmitted power, signal-to-interference-noise ratio (SINR), and bandwidth. This work also optimizes the EE through resource allocation models, focusing on open interfaces such as enhanced common public radio interface (eCPRI) and 7.2x fronthaul. It also explores virtualization and network protocols’ role in managing channel capacity and latency, highlighting the trade-off between throughput and protocol overhead. A complex optimization methodology, namely the Lagrange multiplier has been used along with three numerical algorithms: sequential quadratic programming (SQP), active set, and interior point to solve the objective of maximizing EE. The outcomes of this research show the influence of network parameters on PC and EE under some constraints, including the number of UEs, the number of VMs, the number of RBs, and channel capacity. The problem has been recognized as a non-linear problem characterized by inequality restrictions with mixed convexity and concavity behavior. However, different convergence criteria can impact the EE, as more stringent convergence criteria may result in less accurate solutions, and vice versa. For the three algorithms, the interior point and SQP algorithms outperform the active set in most of the cases. Under optimized configurations, SQP enhanced EE by approximately 15% compared to traditional architecture. In addition, 50% increment in the number of UEs, concurrent with 50% less VMs’ allocation when using SQP were achieved compared with interior point. Finally, 15% decrease in latency was accomplished when using interior point compared to SQP.
- Open Access
- 27 July 2025
- Published by Mesopotamian Academic Press in Mesopotamian Journal of Artificial Intelligence in Healthcare
- Vol. 2025, 197-207
Prediction of Cardiac Arrest Using a Hybrid Voting Classifier Combining Random Forest and Support Vector Machine
Early and adequate identification of patients at risk of cardiac arrest remains a fundamental challenge in medical environments. Within this piece of work, we design and evaluate a hybrid machine-learning pipeline integrating Random Forest (RF) and Support Vector Machine (SVM) classifiers by soft voting to detect cardiac arrest occurrences from a publicly available dataset of 303 patient records with 13 clinical features. After median imputation and data cleaning, continuous features were normalized and the cohort was divided into 70 % training and 30 % test sets. RF scored 97 % with an AUC of 1.00 on its own, and SVM scored at 95 % with an AUC of 0.97. The hybrid ensemble matched RF's perfect AUC but slightly improved recall on positive instances with enhanced sensitivity while maintaining specificity. Permutation-based and Gini-based feature-importance analysis identified major-vessel count, chest-pain type, and peak heart rate as the most important predictors. Distribution plots and heatmaps of correlations further elucidated associations between clinical measures and event status. The proposed hybrid approach is an effective, interpretable way to stratify risk early in high-risk patient populations.
- 27 July 2025
- Published by Mesopotamian Academic Press in Mesopotamian Journal of Artificial Intelligence in Healthcare
- Vol. 2025, 197-207
Open AccessPrediction of Cardiac Arrest Using a Hybrid Voting Classifier Combining Random Forest and Support Vector Machine
Early and adequate identification of patients at risk of cardiac arrest remains a fundamental challenge in medical environments. Within this piece of work, we design and evaluate a hybrid machine-learning pipeline integrating Random Forest (RF) and Support Vector Machine (SVM) classifiers by soft voting to detect cardiac arrest occurrences from a publicly available dataset of 303 patient records with 13 clinical features. After median imputation and data cleaning, continuous features were normalized and the cohort was divided into 70 % training and 30 % test sets. RF scored 97 % with an AUC of 1.00 on its own, and SVM scored at 95 % with an AUC of 0.97. The hybrid ensemble matched RF's perfect AUC but slightly improved recall on positive instances with enhanced sensitivity while maintaining specificity. Permutation-based and Gini-based feature-importance analysis identified major-vessel count, chest-pain type, and peak heart rate as the most important predictors. Distribution plots and heatmaps of correlations further elucidated associations between clinical measures and event status. The proposed hybrid approach is an effective, interpretable way to stratify risk early in high-risk patient populations.
- Open Access
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Financial Technology and Innovation
- Vol. 5 (2) , 01–09-1–09
Remedy-Aware Financial Innovation: A Hierarchical RegTech Framework for Consumer Complaint Resolution
Financial complaint systems keep track of instances of service failure as well as of the remedy chosen by the responding institution. The crucial question for operational supervision isn’t just one of categorization of complaints, however; compensation is scarce, expensive, and fits into a larger framework of explanation vs. relief. In this paper, an approach for the development of a regulatory technology framework for remedies is proposed, which conceptualises the resolution of complaints as a hierarchy. The first stage determines if a case will be decided on relief or explanation, and the second stage distinguishes monetary from non-monetary relief. This is done by using sparse and regularized models, which are calibrated on the following validation period, and tested on an untouched chronological holdout, combining structured intake attributes with complaint narratives. In the empirical application, 268,570 complaints were received by California in 2024. Monetary relief makes up 1.04% of independent test period, and accuracy is not the best criterion. The hierarchical model yields a monetary-relief precision-recall area of 0.335, whereas the flat text-tabular model and a flat model with the event prevalence yield 0.314 and 0.010, respectively. At the 2 percent review budget, it is able to identify 58.9 percent of monetary-relief cases and has a lift of 29.4 times over a random review. The flat fusion model is slightly better for overall three-class classification, demonstrating the benefit of a hierarchy of remedies when institutional capacity is focused on rare, consequential outcomes, rather than labelling. Results provide a practical design of human-supervised complaint triage while retaining calibration, interpretability, chronological validation, and clear usage limitations for automated complaint analysis.
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Financial Technology and Innovation
- Vol. 5 (2) , 01–09-1–09
Open AccessRemedy-Aware Financial Innovation: A Hierarchical RegTech Framework for Consumer Complaint Resolution
Financial complaint systems keep track of instances of service failure as well as of the remedy chosen by the responding institution. The crucial question for operational supervision isn’t just one of categorization of complaints, however; compensation is scarce, expensive, and fits into a larger framework of explanation vs. relief. In this paper, an approach for the development of a regulatory technology framework for remedies is proposed, which conceptualises the resolution of complaints as a hierarchy. The first stage determines if a case will be decided on relief or explanation, and the second stage distinguishes monetary from non-monetary relief. This is done by using sparse and regularized models, which are calibrated on the following validation period, and tested on an untouched chronological holdout, combining structured intake attributes with complaint narratives. In the empirical application, 268,570 complaints were received by California in 2024. Monetary relief makes up 1.04% of independent test period, and accuracy is not the best criterion. The hierarchical model yields a monetary-relief precision-recall area of 0.335, whereas the flat text-tabular model and a flat model with the event prevalence yield 0.314 and 0.010, respectively. At the 2 percent review budget, it is able to identify 58.9 percent of monetary-relief cases and has a lift of 29.4 times over a random review. The flat fusion model is slightly better for overall three-class classification, demonstrating the benefit of a hierarchy of remedies when institutional capacity is focused on rare, consequential outcomes, rather than labelling. Results provide a practical design of human-supervised complaint triage while retaining calibration, interpretability, chronological validation, and clear usage limitations for automated complaint analysis.
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Journal of Artificial Intelligence and Metaheuristics
- Vol. 10 (2) , 67-7-81
Quantum-Inspired Machine Learning: Bridging Classical and Quantum Algorithms
American scientific publishing group
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Journal of Artificial Intelligence and Metaheuristics
- Vol. 10 (2) , 67-7-81
Quantum-Inspired Machine Learning: Bridging Classical and Quantum Algorithms
American scientific publishing group
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 14 (1)
Joint Weighted Dynamic Resources Optimisation in Green Open Radio Access Network
The rapid growth of interconnected devices and data traffic necessitates robust mobile networks, especially in rural areas with unreliable grid power. This paper introduces an optimisation framework for the off‐grid green open radio access network architecture utilising renewable energy to meet this demand. The framework aims to optimise power and bandwidth allocation, ensuring high data rates and reliability from sustainable sources. In addition, the CO 2 emission factor and the quality of service are also optimised in which several assumptions and network metrics have been incorporated such as power consumption (PC), load demand, number of virtual machines (VMs) and maintenance cost. The problem is formulated as the weighted nonlinear problem. First, the model has been formulated using simplified data rate assumption and has been solved mathematically using Lagrange multipliers. Subsequently, the mathematical problem has been solved using the gradient descent numerical solution and then compared with sequential quadratic programming (SQP) and interior point algorithms. The second assumption is formulated as the data rate considering the noise and interference factors; the comparative analysis of SQP, active set and interior point algorithms has been presented. The third case assumed the dynamic behaviour of the network of users and VMs, where the problem is also solved mathematically and numerically. Empirical evidence from rural deployments confirms the enhancement of mobile coverage and service provision through the integration of solar and wind‐powered base stations.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 14 (1)
Open AccessJoint Weighted Dynamic Resources Optimisation in Green Open Radio Access Network
The rapid growth of interconnected devices and data traffic necessitates robust mobile networks, especially in rural areas with unreliable grid power. This paper introduces an optimisation framework for the off‐grid green open radio access network architecture utilising renewable energy to meet this demand. The framework aims to optimise power and bandwidth allocation, ensuring high data rates and reliability from sustainable sources. In addition, the CO 2 emission factor and the quality of service are also optimised in which several assumptions and network metrics have been incorporated such as power consumption (PC), load demand, number of virtual machines (VMs) and maintenance cost. The problem is formulated as the weighted nonlinear problem. First, the model has been formulated using simplified data rate assumption and has been solved mathematically using Lagrange multipliers. Subsequently, the mathematical problem has been solved using the gradient descent numerical solution and then compared with sequential quadratic programming (SQP) and interior point algorithms. The second assumption is formulated as the data rate considering the noise and interference factors; the comparative analysis of SQP, active set and interior point algorithms has been presented. The third case assumed the dynamic behaviour of the network of users and VMs, where the problem is also solved mathematically and numerically. Empirical evidence from rural deployments confirms the enhancement of mobile coverage and service provision through the integration of solar and wind‐powered base stations.
- Open Access
- 30 July 2024
- Published by Institution of Engineering and Technology (IET) in IET Wireless Sensor Systems
- Vol. 14 (6) , 528-538
Delay aware resource allocation in ORAN through network optimization
A multi variable resource allocation problem is investigated in network environments, specifically focusing on the consideration of quality of service in open radio access network. The main objective is to minimise the combined latency of various servers while complying with network limitations. The delay of each server is represented by a non‐linear function that has exponentially based. This characteristic inherently brings non‐convexity into the objective function. In contrast, the constraints comprise various linear combinations of network variables, including resource block allocations, power consumption, and number of virtual machines. The purpose of these constraints is to guarantee that the allocation of resources adheres to practical limitations and upholds fairness among servers. Nevertheless, the inclusion of a non‐convex objective function significantly adds complexity to the optimisation problem and non‐convex behaviour, requiring specialised algorithms and techniques to identify solutions. Subsequently, the Lagrange multiplier method has been used to solve this problem mathematically. Numerically, three algorithms have been utilised and compared to solve the problem, these are active‐set, interior point and sequential quadratic programming. Note that the total delay as an objective function is based on the total power consumption of the servers. Previous to optimising the total delay, a delay model is proposed and compared with two research works that are based on experimental and real time data. The proposed model shows data matching with the other works and permits for more adaptation/integration with any other works that uses different servers’ characteristics and network parameters.
- 30 July 2024
- Published by Institution of Engineering and Technology (IET) in IET Wireless Sensor Systems
- Vol. 14 (6) , 528-538
Open AccessDelay aware resource allocation in ORAN through network optimization
A multi variable resource allocation problem is investigated in network environments, specifically focusing on the consideration of quality of service in open radio access network. The main objective is to minimise the combined latency of various servers while complying with network limitations. The delay of each server is represented by a non‐linear function that has exponentially based. This characteristic inherently brings non‐convexity into the objective function. In contrast, the constraints comprise various linear combinations of network variables, including resource block allocations, power consumption, and number of virtual machines. The purpose of these constraints is to guarantee that the allocation of resources adheres to practical limitations and upholds fairness among servers. Nevertheless, the inclusion of a non‐convex objective function significantly adds complexity to the optimisation problem and non‐convex behaviour, requiring specialised algorithms and techniques to identify solutions. Subsequently, the Lagrange multiplier method has been used to solve this problem mathematically. Numerically, three algorithms have been utilised and compared to solve the problem, these are active‐set, interior point and sequential quadratic programming. Note that the total delay as an objective function is based on the total power consumption of the servers. Previous to optimising the total delay, a delay model is proposed and compared with two research works that are based on experimental and real time data. The proposed model shows data matching with the other works and permits for more adaptation/integration with any other works that uses different servers’ characteristics and network parameters.
- Open Access
- 20 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 167242-167251
Quality of Service of Quantum Entanglement in Mobile Networks
There are many problems in cellular communications cannot be resolved traditionally. The quantum communications can add new dimensions, safety, encryption and solution to the traditional networks because of its robust physical strength. However, it is not entirely realised how to adapt the quantum into the traditional communications because it is not entirely utilised. This paper addresses the necessary guidelines and assessments for future quantum solutions to the standard mobile cloud networks. In particular, using entanglement phenomenon to increase the performance of the X2 application (X2-AP) protocol by minimising the overhead signalling, represented by the time and energy consumption the conventional cloud encounters. We intended to offer a delay reduction while adapting the quantum technique into the cloud by modelling the latency of both paradigms. Finally, increasing the number of photons has decreased the delay to about 40% compared to the traditional network. In addition, the energy efficiency in the quantum case has been increased while decreasing the power consumption by about 10%.
- 20 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 167242-167251
Open AccessQuality of Service of Quantum Entanglement in Mobile Networks
There are many problems in cellular communications cannot be resolved traditionally. The quantum communications can add new dimensions, safety, encryption and solution to the traditional networks because of its robust physical strength. However, it is not entirely realised how to adapt the quantum into the traditional communications because it is not entirely utilised. This paper addresses the necessary guidelines and assessments for future quantum solutions to the standard mobile cloud networks. In particular, using entanglement phenomenon to increase the performance of the X2 application (X2-AP) protocol by minimising the overhead signalling, represented by the time and energy consumption the conventional cloud encounters. We intended to offer a delay reduction while adapting the quantum technique into the cloud by modelling the latency of both paradigms. Finally, increasing the number of photons has decreased the delay to about 40% compared to the traditional network. In addition, the energy efficiency in the quantum case has been increased while decreasing the power consumption by about 10%.