Mostafa M. Abdelhakam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mostafa M. Abdelhakam has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Mahmoud M. Elmessalawy
Electronics and Communications Engineering Department, Faculty of Engineering, Helwan University, Cairo 11795, Egypt
8 shared publications - Haitham H. Esmat
Department of Electrical and Computer Engineering, University of Massachusetts Amherst, Amherst, MA, USA
3 shared publications Ibrahim I. Ibrahim
3 shared publications- Mohamed Elhattab
Concordia University, Montreal, QC, Canada
3 shared publications - Ahmed Abd El-Haleem
Department of Electronics and Communications, Faculty of Engineering, Helwan University, Cairo, Egypt
2 shared publications - Korany Ragab Mahmoud
Electronics and Communications Department, Faculty of Engineering, Helwan University, Cairo, Egypt
2 shared publications
Latest Publications
- 19 October 2023
- Published by Elsevier in Computer Networks
- Vol. 237
Collaborative CoMP and trajectory optimization for energy minimization in multi-UAV-assisted IoT networks with QoS guarantee
- 19 October 2023
- Published by Elsevier in Computer Networks
- Vol. 237
Collaborative CoMP and trajectory optimization for energy minimization in multi-UAV-assisted IoT networks with QoS guarantee
- Open Access
- 14 September 2023
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2023 (1) , 1-19
Joint trajectory and CoMP clustering optimization in UAV-assisted cellular systems: a coalition formation game approach
- 14 September 2023
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2023 (1) , 1-19
Open AccessJoint trajectory and CoMP clustering optimization in UAV-assisted cellular systems: a coalition formation game approach
- 22 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 292-297
Geofencing-based Congestion Control in Workplaces Environment using Sequential Pattern Mining
To control congestion in the workplace environment especially in crises like the COVID-19 pandemic, this requires careful control of highly crowded workplace locations. Therefore, innovative technologies, such as geofencing and sequential pattern mining can be used to estimate people movement pattern and combat the spread of COVID-19. In this paper, the workplace area is divided into a set of geofences by using geofencing technology. Then, the movement profiles of each user are estimated to control the possible congestion in the workplace's enviroment. To accomplish this, the user's historical geofence transitions are used to anticipate the next time the user will leave the current geofence. The Sequential Pattern Discovery using Equivalence classes (CM-SPADE), Succinct BWT-based Sequence prediction model (SuBSeq) and Compact Prediction Tree + (CPT+) algorithms are adopted to predict the user's next geofence. In the CM-SPADE algorithm, a vertical database is obtained from the available database and the frequent sequence is found based on relative support, confidence, and lift measures. Meanwhile, in the training phase of the SuBSeq algorithm, Ferragina and Manzini (FM)-index and Burrows-Wheeler Transform string are generated. Then, in the ready-to-predict phase, the next geofence is anticipated. The CPT+ algorithm is based on generating Prediction Tree (PT), Lookup Table (LT), and Inverted Index (IIdx) for the training data. Then, Frequent Subsequence Compression (FSC) and Simple Branches Compression (SBC) are used to reduce the size of the PT. In addition, the Prediction with improved Noise Reduction (PNR) method is utilized to reduce the execution time. The results show remarkable superiority for SuBSeq algorithm over CM-SPADE and CPT+ with the accuracy greater than 90% withh an average of 8 input geofences to predict the next geofence.
- 22 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 292-297
Geofencing-based Congestion Control in Workplaces Environment using Sequential Pattern Mining
To control congestion in the workplace environment especially in crises like the COVID-19 pandemic, this requires careful control of highly crowded workplace locations. Therefore, innovative technologies, such as geofencing and sequential pattern mining can be used to estimate people movement pattern and combat the spread of COVID-19. In this paper, the workplace area is divided into a set of geofences by using geofencing technology. Then, the movement profiles of each user are estimated to control the possible congestion in the workplace's enviroment. To accomplish this, the user's historical geofence transitions are used to anticipate the next time the user will leave the current geofence. The Sequential Pattern Discovery using Equivalence classes (CM-SPADE), Succinct BWT-based Sequence prediction model (SuBSeq) and Compact Prediction Tree + (CPT+) algorithms are adopted to predict the user's next geofence. In the CM-SPADE algorithm, a vertical database is obtained from the available database and the frequent sequence is found based on relative support, confidence, and lift measures. Meanwhile, in the training phase of the SuBSeq algorithm, Ferragina and Manzini (FM)-index and Burrows-Wheeler Transform string are generated. Then, in the ready-to-predict phase, the next geofence is anticipated. The CPT+ algorithm is based on generating Prediction Tree (PT), Lookup Table (LT), and Inverted Index (IIdx) for the training data. Then, Frequent Subsequence Compression (FSC) and Simple Branches Compression (SBC) are used to reduce the size of the PT. In addition, the Prediction with improved Noise Reduction (PNR) method is utilized to reduce the execution time. The results show remarkable superiority for SuBSeq algorithm over CM-SPADE and CPT+ with the accuracy greater than 90% withh an average of 8 input geofences to predict the next geofence.
- Open Access
A Machine Learning Approach for Movement Monitoring in Clustered Workplaces to Control COVID-19 Based on Geofencing and Fusion of Wi-Fi and Magnetic Field Metrics
The ubiquitous existence of COVID-19 has required the management of congested areas such as workplaces. As a result, the use of a variety of inspiring tools to deal with the spread of COVID-19 has been required, including internet of things, artificial intelligence (AI), machine learning (ML), and geofencing technologies. In this work, an efficient approach based on the use of ML and geofencing technology is proposed to monitor and control the density of persons in workplaces during working hours. In particular, the workplace environment is divided into a number of geofences in which each person is associated with a set of geofences that make up their own cluster using a dynamic user-centric clustering scheme. Different metrics are used to generate a unique geofence digital signature (GDS) such as Wi-Fi basic service set identifier, Wi-Fi received signal strength indication, and magnetic field data, which can be collected using the person’s smartphone. Then, these metrics are utilized by different ML techniques to generate the GDS for each indoor geofence and each building geofence as well as to detect whether the person is in their cluster. In addition, a Layered-Architecture Geofence Division method is considered to reduce the processing overhead at the person’s smartphone. Our experimental results demonstrate that the proposed approach can perform well in a real workplace environment. The results show that the system accuracy is about 98.25% in indoor geofences and 76% in building geofences.
Open AccessA Machine Learning Approach for Movement Monitoring in Clustered Workplaces to Control COVID-19 Based on Geofencing and Fusion of Wi-Fi and Magnetic Field Metrics
The ubiquitous existence of COVID-19 has required the management of congested areas such as workplaces. As a result, the use of a variety of inspiring tools to deal with the spread of COVID-19 has been required, including internet of things, artificial intelligence (AI), machine learning (ML), and geofencing technologies. In this work, an efficient approach based on the use of ML and geofencing technology is proposed to monitor and control the density of persons in workplaces during working hours. In particular, the workplace environment is divided into a number of geofences in which each person is associated with a set of geofences that make up their own cluster using a dynamic user-centric clustering scheme. Different metrics are used to generate a unique geofence digital signature (GDS) such as Wi-Fi basic service set identifier, Wi-Fi received signal strength indication, and magnetic field data, which can be collected using the person’s smartphone. Then, these metrics are utilized by different ML techniques to generate the GDS for each indoor geofence and each building geofence as well as to detect whether the person is in their cluster. In addition, a Layered-Architecture Geofence Division method is considered to reduce the processing overhead at the person’s smartphone. Our experimental results demonstrate that the proposed approach can perform well in a real workplace environment. The results show that the system accuracy is about 98.25% in indoor geofences and 76% in building geofences.
- Open Access
- 27 June 2022
- Published by Springer Nature in Research Square
Joint Trajectory and CoMP Clustering Optimization in UAV-Assisted Cellular Systems: A Coalition Formation Game Approach
In this paper, the flexibility of unmanned aerial vehicles (UAVs), as well as the benefits of coordinated multi-point (CoMP) transmission, are utilized for mitigating the interference in cellular networks. Specifically, the joint problem of CoMP clusters and UAVs’ trajectories is addressed for downlink transmission in a UAV-assisted cellular system. The problem is presented as a non-convex optimization problem that aims to maximize the sum rate of the ground users by taking into account the clustering, UAV mobility and backhaul capacity constraints. Since the formulated problem is known to be NP-hard, we partition it into two sub-problems. Particularly, by using coalitional game theory, the CoMP clusters are obtained with a given UAVs’ trajectories. Then, UAVs’ trajectories are optimized with given CoMP clusters using successive convex approximation (SCA) technique. Based on the block coordinate descent (BCD) method, the two sub-problems are solved alternatively until convergence. Numerical results are conducted and demonstrate the effectiveness of the proposed algorithm.
- 27 June 2022
- Published by Springer Nature in Research Square
Open AccessJoint Trajectory and CoMP Clustering Optimization in UAV-Assisted Cellular Systems: A Coalition Formation Game Approach
In this paper, the flexibility of unmanned aerial vehicles (UAVs), as well as the benefits of coordinated multi-point (CoMP) transmission, are utilized for mitigating the interference in cellular networks. Specifically, the joint problem of CoMP clusters and UAVs’ trajectories is addressed for downlink transmission in a UAV-assisted cellular system. The problem is presented as a non-convex optimization problem that aims to maximize the sum rate of the ground users by taking into account the clustering, UAV mobility and backhaul capacity constraints. Since the formulated problem is known to be NP-hard, we partition it into two sub-problems. Particularly, by using coalitional game theory, the CoMP clusters are obtained with a given UAVs’ trajectories. Then, UAVs’ trajectories are optimized with given CoMP clusters using successive convex approximation (SCA) technique. Based on the block coordinate descent (BCD) method, the two sub-problems are solved alternatively until convergence. Numerical results are conducted and demonstrate the effectiveness of the proposed algorithm.
- Open Access
- 1 January 2020
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 14 (1) , 11-20
Energy‐efficient BBU pool virtualisation for C‐RAN with quality of service guarantees
Cloud radio access network (C‐RAN) has been introduced as a promising network paradigm for improving the spectral and energy efficiency of next‐generation mobile systems. In C‐RAN, the computation resources of the centralised baseband units (BBUs) can be virtualised and dynamically shared among cells for energy‐efficient BBU pool utilisation. In this study, a BBU virtualisation scheme is proposed to minimise the total power consumption in the BBU pool subject to constraints on users’ quality of service in terms of real‐time requirements, individual fronthaul capacity and BBU capacity. As the BBU processing time and transmission delay for each user data can be compromised to meet the user's real‐time requirements while minimising the BBU power consumption, a priori user association phase is proposed and formulated as an optimisation problem to maximise the users’ transmission rate, and hence minimising their transmission delay. Then, the BBU processing allocation phase is formulated as a bin‐packing problem to minimise the overall power consumption in the BBU pool. Since this problem is combinatorial, a heuristic algorithm is proposed based on best‐fit‐decreasing algorithm to solve it. Extensive simulations show that the proposed scheme outperforms the comparable ones in terms of power consumption with reduction up to 33%.
- 1 January 2020
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 14 (1) , 11-20
Open AccessEnergy‐efficient BBU pool virtualisation for C‐RAN with quality of service guarantees
Cloud radio access network (C‐RAN) has been introduced as a promising network paradigm for improving the spectral and energy efficiency of next‐generation mobile systems. In C‐RAN, the computation resources of the centralised baseband units (BBUs) can be virtualised and dynamically shared among cells for energy‐efficient BBU pool utilisation. In this study, a BBU virtualisation scheme is proposed to minimise the total power consumption in the BBU pool subject to constraints on users’ quality of service in terms of real‐time requirements, individual fronthaul capacity and BBU capacity. As the BBU processing time and transmission delay for each user data can be compromised to meet the user's real‐time requirements while minimising the BBU power consumption, a priori user association phase is proposed and formulated as an optimisation problem to maximise the users’ transmission rate, and hence minimising their transmission delay. Then, the BBU processing allocation phase is formulated as a bin‐packing problem to minimise the overall power consumption in the BBU pool. Since this problem is combinatorial, a heuristic algorithm is proposed based on best‐fit‐decreasing algorithm to solve it. Extensive simulations show that the proposed scheme outperforms the comparable ones in terms of power consumption with reduction up to 33%.
- 22 June 2018
- Published by Wiley in Transactions on Emerging Telecommunications Technologies
- Vol. 29 (9)
Joint radio resource and power allocation using Nash bargaining game for H‐CRAN with nonideal fronthaul links
Heterogeneous cloud radio access network (H‐CRAN) is introduced as a novel network architecture that takes the full rewards of both heterogeneous cellular network (HCNs) and cloud radio access network (CRAN). In H‐CRAN architecture, the remote radio heads of small cells (SCs) are overlaid within the coverage of macro cell and linked to the baseband unit pool through nonideal fronthaul connections. To improve the spectral efficiency of this network, the SCs are developed to reuse the same resources used by the macro cell. However, this will introduce inter‐tier interference between macro cell and SCs and intra‐tier interference among SCs that need to be efficiently managed. In this paper, the joint problem of radio resource and power allocation in H‐CRAN is formulated using cooperative Nash bargaining game. This optimization problem is designed to maximize the total throughput of SCs, while considering the fairness between user equipments (UEs) in each SC, interference protection requirements for macro UEs, outage probability requirements, and the capacity limitation of nonideal fronthaul connections. Then, by using Lagrangian dual decomposition, the near‐optimal bargaining allocation strategy for radio resources and power of each SC UE is determined. Simulation results illustrate that the performance of the suggested algorithm outperforms the other comparable algorithm in terms of the SCs' achieved throughput and fairness. Moreover, the effect of nonideal fronthaul capacity constraint and the interference protection limit of macro UEs on the performance of the suggested scheme are examined.
- 22 June 2018
- Published by Wiley in Transactions on Emerging Telecommunications Technologies
- Vol. 29 (9)
Joint radio resource and power allocation using Nash bargaining game for H‐CRAN with nonideal fronthaul links
Heterogeneous cloud radio access network (H‐CRAN) is introduced as a novel network architecture that takes the full rewards of both heterogeneous cellular network (HCNs) and cloud radio access network (CRAN). In H‐CRAN architecture, the remote radio heads of small cells (SCs) are overlaid within the coverage of macro cell and linked to the baseband unit pool through nonideal fronthaul connections. To improve the spectral efficiency of this network, the SCs are developed to reuse the same resources used by the macro cell. However, this will introduce inter‐tier interference between macro cell and SCs and intra‐tier interference among SCs that need to be efficiently managed. In this paper, the joint problem of radio resource and power allocation in H‐CRAN is formulated using cooperative Nash bargaining game. This optimization problem is designed to maximize the total throughput of SCs, while considering the fairness between user equipments (UEs) in each SC, interference protection requirements for macro UEs, outage probability requirements, and the capacity limitation of nonideal fronthaul connections. Then, by using Lagrangian dual decomposition, the near‐optimal bargaining allocation strategy for radio resources and power of each SC UE is determined. Simulation results illustrate that the performance of the suggested algorithm outperforms the other comparable algorithm in terms of the SCs' achieved throughput and fairness. Moreover, the effect of nonideal fronthaul capacity constraint and the interference protection limit of macro UEs on the performance of the suggested scheme are examined.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Joint Beamforming Design and BBU Computational Resources Allocation in Heterogeneous C-RAN with QoS Guarantee
In this paper, we consider the joint transmission coordinated multi-point (CoMP) technique in a downlink heterogeneous cloud radio access network (C-RAN). The joint beamforming design and baseband unit (BBU) computational resources allocation problem in Heterogenous C-RAN is investigated. This problem is formulated as an optimization problem to minimize the overall system power consumption under per-user quality-of-service (QoS), fronthaul capacity, per-antenna transmit power and per-remote radio head (RRH) total transmit power constraints. The considered problem is a non-convex optimization problem due to the presence of the binary indicator in the fronthaul constraints. To address this challenge, we use the re-weighted l1-norm technique and reformulate the problem into a tractable form. Then, we transform the problem to a weighted sum mean square error (MSE) minimization problem and propose a weighted minimum mean square error (WMMSE) algorithm to solve it. Simulation results are provided to verify the effectiveness of the proposed algorithm.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Joint Beamforming Design and BBU Computational Resources Allocation in Heterogeneous C-RAN with QoS Guarantee
In this paper, we consider the joint transmission coordinated multi-point (CoMP) technique in a downlink heterogeneous cloud radio access network (C-RAN). The joint beamforming design and baseband unit (BBU) computational resources allocation problem in Heterogenous C-RAN is investigated. This problem is formulated as an optimization problem to minimize the overall system power consumption under per-user quality-of-service (QoS), fronthaul capacity, per-antenna transmit power and per-remote radio head (RRH) total transmit power constraints. The considered problem is a non-convex optimization problem due to the presence of the binary indicator in the fronthaul constraints. To address this challenge, we use the re-weighted l1-norm technique and reformulate the problem into a tractable form. Then, we transform the problem to a weighted sum mean square error (MSE) minimization problem and propose a weighted minimum mean square error (WMMSE) algorithm to solve it. Simulation results are provided to verify the effectiveness of the proposed algorithm.
- 17 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (8) , 1664-1667
A Matching Game for Device Association and Resource Allocation in Heterogeneous Cloud Radio Access Networks
In this letter, a framework to optimize device association (DA), radio resource allocation (RA), and power allocation (PA) in heterogeneous cloud radio access network (H-CRAN) is proposed. In H-CRAN, small remote radio heads (SRRHs) are deployed underlaying the macro RHH (MRRH) to serve a group of SRRH devices (SDVs) by reusing the same radio resources allocated to MRRH devices (MDVs). The DA, RA, and PA optimization process is designed to maximize the network sum-rate while guaranteeing the rate requirements for SDVs, fronthaul capacity constraints, and MDVs interference protection. For DA and RA, an approach dependent on matching game is proposed to model the interactions between devices and SRRHs. In addition, Lagrangian dual decomposition is adopted to determine the optimum power allocation for each radio resource. Simulation results validate the superiority of the proposed algorithm compared to other schemes.
- 17 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (8) , 1664-1667
A Matching Game for Device Association and Resource Allocation in Heterogeneous Cloud Radio Access Networks
In this letter, a framework to optimize device association (DA), radio resource allocation (RA), and power allocation (PA) in heterogeneous cloud radio access network (H-CRAN) is proposed. In H-CRAN, small remote radio heads (SRRHs) are deployed underlaying the macro RHH (MRRH) to serve a group of SRRH devices (SDVs) by reusing the same radio resources allocated to MRRH devices (MDVs). The DA, RA, and PA optimization process is designed to maximize the network sum-rate while guaranteeing the rate requirements for SDVs, fronthaul capacity constraints, and MDVs interference protection. For DA and RA, an approach dependent on matching game is proposed to model the interactions between devices and SRRHs. In addition, Lagrangian dual decomposition is adopted to determine the optimum power allocation for each radio resource. Simulation results validate the superiority of the proposed algorithm compared to other schemes.
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (7) , 1454-1457
A Cooperation Strategy Based on Bargaining Game for Fair User-Centric Clustering in Cloud-RAN
Coordinated multi-point (CoMP) has emerged as a promising concept for improving the overall network throughput, where each user is attached with a group of radio heads called a cluster. In this letter, a user-centric clustering scheme in cloud radio access network is proposed to consider the fairness between users while choosing the serving clusters. The CoMP clustering strategy is formulated as a cooperative bargaining game problem and resolved using Nash Bargaining Solution (NBS). First, the users are grouped into coalitions using Hungarian method. Then, a two-band partition algorithm is developed for the two users in each coalition to bargain their attached radio heads so that the NBS utility is maximized. Simulation results show that the proposed algorithm can achieve a considerable rate gain and fairness improvements compared to the existing schemes.
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (7) , 1454-1457
A Cooperation Strategy Based on Bargaining Game for Fair User-Centric Clustering in Cloud-RAN
Coordinated multi-point (CoMP) has emerged as a promising concept for improving the overall network throughput, where each user is attached with a group of radio heads called a cluster. In this letter, a user-centric clustering scheme in cloud radio access network is proposed to consider the fairness between users while choosing the serving clusters. The CoMP clustering strategy is formulated as a cooperative bargaining game problem and resolved using Nash Bargaining Solution (NBS). First, the users are grouped into coalitions using Hungarian method. Then, a two-band partition algorithm is developed for the two users in each coalition to bargain their attached radio heads so that the NBS utility is maximized. Simulation results show that the proposed algorithm can achieve a considerable rate gain and fairness improvements compared to the existing schemes.