Khalid Aldubaikhy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Khalid Aldubaikhy has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Nan Cheng
Xidian University
10 shared publications - Xuemin Shen
University of Waterloo
7 shared publications - Abdullah Alqasir
Department of Electrical Engineering, College of Engineering, Qassim University, Buraydah, Saudi Arabia
4 shared publications - Wen Wu
Peng Cheng Laboratory, Shenzhen, China
4 shared publications - Ning Zhang
University of Windsor
3 shared publications Wen Wu
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada
3 shared publications
Latest Publications
- Open Access
A Low-Complexity Hybrid Handover Strategy for LEO NTN: Balancing Stability and Link Quality
The deployment of low Earth orbit (LEO) satellite mega-constellations enables global broadband access, but their high orbital velocity demands frequent handover decisions that critically impact service continuity. Conventional strategies that maximize instantaneous signal quality often trigger excessive handovers, while stability-focused approaches may sacrifice link performance. In this paper, we propose the Hybrid Handover Strategy (HHS), a low-complexity algorithm that addresses this trade-off. The HHS utilizes a multi-attribute utility function that integrates the signal-to-interference-plus-noise ratio (SINR), satellite elevation angle, and network load with a novel logistic-decay stability bonus mechanism. We provide a formal mathematical analysis of the algorithm’s stability and performance trade-offs. To ensure industrial relevance, the strategy is validated using a high-fidelity simulator driven by real-world two-line element (TLE) data from the Starlink constellation. Results demonstrate that the HHS reduces the handover frequency by 64% compared to SINR-based benchmarks while maintaining service availability of 90.2%. The proposed algorithm delivers these improvements with significantly smaller computational overhead than machine learning approaches, making it suitable for resource-constrained on-board processing and ground terminals.
Open AccessA Low-Complexity Hybrid Handover Strategy for LEO NTN: Balancing Stability and Link Quality
The deployment of low Earth orbit (LEO) satellite mega-constellations enables global broadband access, but their high orbital velocity demands frequent handover decisions that critically impact service continuity. Conventional strategies that maximize instantaneous signal quality often trigger excessive handovers, while stability-focused approaches may sacrifice link performance. In this paper, we propose the Hybrid Handover Strategy (HHS), a low-complexity algorithm that addresses this trade-off. The HHS utilizes a multi-attribute utility function that integrates the signal-to-interference-plus-noise ratio (SINR), satellite elevation angle, and network load with a novel logistic-decay stability bonus mechanism. We provide a formal mathematical analysis of the algorithm’s stability and performance trade-offs. To ensure industrial relevance, the strategy is validated using a high-fidelity simulator driven by real-world two-line element (TLE) data from the Starlink constellation. Results demonstrate that the HHS reduces the handover frequency by 64% compared to SINR-based benchmarks while maintaining service availability of 90.2%. The proposed algorithm delivers these improvements with significantly smaller computational overhead than machine learning approaches, making it suitable for resource-constrained on-board processing and ground terminals.
- 10 August 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (8) , 5541-5557
Resource Management Through Energy Harvesting and Mobility Prediction: A Learning Approach
- 10 August 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (8) , 5541-5557
Resource Management Through Energy Harvesting and Mobility Prediction: A Learning Approach
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18902-18916
Knowledge-Driven Resource Allocation for Wireless Networks: A WMMSE Unrolled Graph Neural Network Approach
This paper proposes a novel knowledge-driven approach for resource allocation in wireless networks using the graph neural network (GNN) architecture. To meet the millisecond-level timeliness and scalability required for the dynamic network environment, our proposed approach, named UWGNN, incorporates the deep unrolling of the weighted minimum mean square error (WMMSE) algorithm, referred to as domain knowledge, into GNN, thereby reducing computational delay and sample complexity while adapting to various data distributions. Specifically, by unrolling WMMSE algorithm into a series of interconnected submodules, UWGNN aligns closely with the optimization steps of the algorithm. Our analysis reveals the effectiveness of the deep unrolling method within UWGNN, which decomposes complicated end-to-end mappings, leading to a reduction in model complexity and parameter count. Experimental results demonstrate that UWGNN maintains optimal performance with computation latency 3 to 4 orders of magnitude lower than the WMMSE algorithm and exhibits strong performance and generalization across diverse data distributions and communication topologies without the need for retraining. Our findings contribute to the development of efficient and scalable wireless resource management solutions for distributed and dynamic networks with strict latency requirements.
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18902-18916
Knowledge-Driven Resource Allocation for Wireless Networks: A WMMSE Unrolled Graph Neural Network Approach
This paper proposes a novel knowledge-driven approach for resource allocation in wireless networks using the graph neural network (GNN) architecture. To meet the millisecond-level timeliness and scalability required for the dynamic network environment, our proposed approach, named UWGNN, incorporates the deep unrolling of the weighted minimum mean square error (WMMSE) algorithm, referred to as domain knowledge, into GNN, thereby reducing computational delay and sample complexity while adapting to various data distributions. Specifically, by unrolling WMMSE algorithm into a series of interconnected submodules, UWGNN aligns closely with the optimization steps of the algorithm. Our analysis reveals the effectiveness of the deep unrolling method within UWGNN, which decomposes complicated end-to-end mappings, leading to a reduction in model complexity and parameter count. Experimental results demonstrate that UWGNN maintains optimal performance with computation latency 3 to 4 orders of magnitude lower than the WMMSE algorithm and exhibits strong performance and generalization across diverse data distributions and communication topologies without the need for retraining. Our findings contribute to the development of efficient and scalable wireless resource management solutions for distributed and dynamic networks with strict latency requirements.
- Top Cited Papers
- 10 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (9) , 15969-15984
Load-Aware Network Resource Orchestration in LEO Satellite Network: A GAT-Based Approach
As an integral component of the space–air–ground integrated network (SAGIN), the low-Earth orbit (LEO) satellite network has displayed immense potential in providing ubiquitous connectivity and broadband mobile communication. However, the intrinsic dynamics of LEO satellites pose unprecedented challenges in network management and service delivery. In this article, we investigate the service function chain (SFC) orchestration in dynamic LEO satellite networks to achieve flexible and efficient service provision. Considering the service requirements and the limitations of network resources, we formulate the SFC orchestration problem as the integer nonlinear programming (INLP) problem for maximizing the service acceptance and the load fairness of satellites. Then, an efficient heuristic algorithm is proposed to solve this problem. Addressing the situation with frequent service requests, a graph attention network (GAT)-based approach with low complexity is also presented. Simulation results demonstrate that our proposed approaches outperform the benchmarks by a substantial margin in terms of load fairness and service acceptance. Besides, the proposed GAT-based approach shows its advantage in computation complexity, and exhibits robustness in unstable network scenarios with intermittent link interruptions.
- 10 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (9) , 15969-15984
Top Cited PapersLoad-Aware Network Resource Orchestration in LEO Satellite Network: A GAT-Based Approach
As an integral component of the space–air–ground integrated network (SAGIN), the low-Earth orbit (LEO) satellite network has displayed immense potential in providing ubiquitous connectivity and broadband mobile communication. However, the intrinsic dynamics of LEO satellites pose unprecedented challenges in network management and service delivery. In this article, we investigate the service function chain (SFC) orchestration in dynamic LEO satellite networks to achieve flexible and efficient service provision. Considering the service requirements and the limitations of network resources, we formulate the SFC orchestration problem as the integer nonlinear programming (INLP) problem for maximizing the service acceptance and the load fairness of satellites. Then, an efficient heuristic algorithm is proposed to solve this problem. Addressing the situation with frequent service requests, a graph attention network (GAT)-based approach with low complexity is also presented. Simulation results demonstrate that our proposed approaches outperform the benchmarks by a substantial margin in terms of load fairness and service acceptance. Besides, the proposed GAT-based approach shows its advantage in computation complexity, and exhibits robustness in unstable network scenarios with intermittent link interruptions.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (3) , 953-967
Dynamic Neural Network-Based Resource Management for Mobile Edge Computing in 6G Networks
Mobile edge computing (MEC) can be used to reduce the task delay for users with limited computing resources. However, in 6G networks, the diversity of tasks is greatly increased. For those extremely delay-sensitive small-size computing tasks, the inference delay of neural network (NN)-based algorithms such as resource allocation and task offloading cannot be ignored. As a hyperparameter, the inference cost of NN is usually difficult to adjust. Dynamic neural network (DyNN) is an emerging technique that improves the model efficiency by adjusting the network architecture on-demand according to the sample characteristics during inference. In this paper, we propose a DyNN-based resource management method for MEC that dynamically adjusts the depth and width of the NN according to the features of the task, improving computational efficiency and achieving a balance between inference delay and the management performance of computational and communication resources. Furthermore, to reduce the training cost of DyNN, a new training method is proposed in this paper, where all the blocks in DyNN are gradually trained in the order of size. Simulation results demonstrate that the proposed DyNN-based resource management method outperforms the traditional optimization algorithm and the static-NN-based method.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (3) , 953-967
Dynamic Neural Network-Based Resource Management for Mobile Edge Computing in 6G Networks
Mobile edge computing (MEC) can be used to reduce the task delay for users with limited computing resources. However, in 6G networks, the diversity of tasks is greatly increased. For those extremely delay-sensitive small-size computing tasks, the inference delay of neural network (NN)-based algorithms such as resource allocation and task offloading cannot be ignored. As a hyperparameter, the inference cost of NN is usually difficult to adjust. Dynamic neural network (DyNN) is an emerging technique that improves the model efficiency by adjusting the network architecture on-demand according to the sample characteristics during inference. In this paper, we propose a DyNN-based resource management method for MEC that dynamically adjusts the depth and width of the NN according to the features of the task, improving computational efficiency and achieving a balance between inference delay and the management performance of computational and communication resources. Furthermore, to reduce the training cost of DyNN, a new training method is proposed in this paper, where all the blocks in DyNN are gradually trained in the order of size. Simulation results demonstrate that the proposed DyNN-based resource management method outperforms the traditional optimization algorithm and the static-NN-based method.
- 6 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 5539-5553
RCFL: Redundancy-Aware Collaborative Federated Learning in Vehicular Networks
In vehicular networks (VNets), vehicular federated learning (VFL) is a new learning paradigm that can protect data privacy of vehicle nodes (VNs) while training models. In VFL, the importance of data (IoD) is a key factor that affects model training accuracy. However, due to the heterogeneity of data in the VFL, it is a challenge to evaluate the quality of data owned by different VNs and design an efficient federated learning scheme to enable the VNs to complete learning tasks collaboratively. In this paper, we consider the IoD and propose a redundancy-aware collaborative federated learning (RCFL) scheme for the VFL. In the scheme, by jointly considering the data quality and the cooperation among VNs, we first design a redundancy-aware federated learning architecture to efficiently provide learning services in VNets. Then, we develop a data importance model that integrates the non-independent and identically distributed (non-IID) degree and the redundancy of data (RoD) to evaluate the data quality and formulate the cooperation of the VNs as a coalition game to improve their data importance, where the equilibrium of the coalition game is obtained by designing a coalition formation algorithm. After that, by considering the diversified characteristics of data and the available resources of different VNs in each coalition, a coalition-based federated learning algorithm is designed to enable the distributed coalitions to complete the learning task cooperatively with the target of improving the learning accuracy. The simulation results show that the proposed scheme outperforms the benchmark schemes in terms of the IoD obtained by the VNs and the training accuracy.
- 6 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 5539-5553
RCFL: Redundancy-Aware Collaborative Federated Learning in Vehicular Networks
In vehicular networks (VNets), vehicular federated learning (VFL) is a new learning paradigm that can protect data privacy of vehicle nodes (VNs) while training models. In VFL, the importance of data (IoD) is a key factor that affects model training accuracy. However, due to the heterogeneity of data in the VFL, it is a challenge to evaluate the quality of data owned by different VNs and design an efficient federated learning scheme to enable the VNs to complete learning tasks collaboratively. In this paper, we consider the IoD and propose a redundancy-aware collaborative federated learning (RCFL) scheme for the VFL. In the scheme, by jointly considering the data quality and the cooperation among VNs, we first design a redundancy-aware federated learning architecture to efficiently provide learning services in VNets. Then, we develop a data importance model that integrates the non-independent and identically distributed (non-IID) degree and the redundancy of data (RoD) to evaluate the data quality and formulate the cooperation of the VNs as a coalition game to improve their data importance, where the equilibrium of the coalition game is obtained by designing a coalition formation algorithm. After that, by considering the diversified characteristics of data and the available resources of different VNs in each coalition, a coalition-based federated learning algorithm is designed to enable the distributed coalitions to complete the learning task cooperatively with the target of improving the learning accuracy. The simulation results show that the proposed scheme outperforms the benchmark schemes in terms of the IoD obtained by the VNs and the training accuracy.
- Top Cited Papers
- 30 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 5462-5478
RingSFL: An Adaptive Split Federated Learning Towards Taming Client Heterogeneity
Federated learning (FL) has gained increasing attention due to its ability to collaboratively train while protecting client data privacy. However, vanilla FL cannot adapt to client heterogeneity, leading to a degradation in training efficiency due to stragglers, and is still vulnerable to privacy leakage. To address these issues, this article proposes RingSFL, a novel distributed learning scheme that integrates FL with a model split mechanism to adapt to client heterogeneity while maintaining data privacy. In RingSFL, all clients form a ring topology. For each client, instead of training the model locally, the model is split and trained among all clients along the ring through a pre-defined direction. By properly setting the propagation lengths of heterogeneous clients, the straggler effect is mitigated, and the training efficiency of the system is significantly enhanced. Additionally, since the local models are blended, it is less likely for an eavesdropper to obtain the complete model and recover the raw data, thus improving data privacy. The experimental results on both simulation and prototype systems show that RingSFL can achieve better convergence performance than benchmark methods on independently identically distributed (IID) and non-IID datasets, while effectively preventing eavesdroppers from recovering training data.
- 30 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 5462-5478
Top Cited PapersRingSFL: An Adaptive Split Federated Learning Towards Taming Client Heterogeneity
Federated learning (FL) has gained increasing attention due to its ability to collaboratively train while protecting client data privacy. However, vanilla FL cannot adapt to client heterogeneity, leading to a degradation in training efficiency due to stragglers, and is still vulnerable to privacy leakage. To address these issues, this article proposes RingSFL, a novel distributed learning scheme that integrates FL with a model split mechanism to adapt to client heterogeneity while maintaining data privacy. In RingSFL, all clients form a ring topology. For each client, instead of training the model locally, the model is split and trained among all clients along the ring through a pre-defined direction. By properly setting the propagation lengths of heterogeneous clients, the straggler effect is mitigated, and the training efficiency of the system is significantly enhanced. Additionally, since the local models are blended, it is less likely for an eavesdropper to obtain the complete model and recover the raw data, thus improving data privacy. The experimental results on both simulation and prototype systems show that RingSFL can achieve better convergence performance than benchmark methods on independently identically distributed (IID) and non-IID datasets, while effectively preventing eavesdroppers from recovering training data.
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (11) , 7319-7330
Multi-Domain Resource Multiplexing Based Secure Transmission for Satellite-Assisted IoT: AO-SCA Approach
Due to the wireless broadcasting and broad coverage in satellite-supported Internet of things (IoT) networks, the IoT nodes are susceptible to eavesdropping threats. Considering the distance difference between satellite and nearby destinations is negligible, the main and wiretapping channels between satellite and IoT node are similar, it poses great challenges to reach physical layer security in satellite-assisted IoT networks. In this paper, to guarantee secure transmissions for satellite-assisted IoT downlink communications, the multi-domain resource multiplexing based secure approach is proposed. Particularly, the self-induced co-channel interference between adjacent nodes is leveraged to increase the difference of signal transmission quality over both main and wiretapping channels. By comprehensively optimizing multi-domain resources, i.e., frequency, power, and spatial domains, secure transmissions from satellite to IoT nodes are reached. Specifically, the problem to maximize the sum secrecy rate of IoT nodes is formulated with a constraint of common communication rate of IoT nodes. To solve this non-convex problem, an alternating optimization (AO) algorithm with two inner successive convex approximation (SCA) algorithms are executed to solve the power allocation, spectral multiplexing, and precoding. In addition, simulation results are carried out to evaluate the secrecy rate performance and verify the efficiency of our proposed approach.
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (11) , 7319-7330
Multi-Domain Resource Multiplexing Based Secure Transmission for Satellite-Assisted IoT: AO-SCA Approach
Due to the wireless broadcasting and broad coverage in satellite-supported Internet of things (IoT) networks, the IoT nodes are susceptible to eavesdropping threats. Considering the distance difference between satellite and nearby destinations is negligible, the main and wiretapping channels between satellite and IoT node are similar, it poses great challenges to reach physical layer security in satellite-assisted IoT networks. In this paper, to guarantee secure transmissions for satellite-assisted IoT downlink communications, the multi-domain resource multiplexing based secure approach is proposed. Particularly, the self-induced co-channel interference between adjacent nodes is leveraged to increase the difference of signal transmission quality over both main and wiretapping channels. By comprehensively optimizing multi-domain resources, i.e., frequency, power, and spatial domains, secure transmissions from satellite to IoT nodes are reached. Specifically, the problem to maximize the sum secrecy rate of IoT nodes is formulated with a constraint of common communication rate of IoT nodes. To solve this non-convex problem, an alternating optimization (AO) algorithm with two inner successive convex approximation (SCA) algorithms are executed to solve the power allocation, spectral multiplexing, and precoding. In addition, simulation results are carried out to evaluate the secrecy rate performance and verify the efficiency of our proposed approach.
- Open Access
- 3 September 2022
- Published by MDPI AG in Remote Sensing
- Vol. 14 (17) , 4377
Joint Flying Relay Location and Routing Optimization for 6G UAV–IoT Networks: A Graph Neural Network-Based Approach
Unmanned aerial vehicles (UAVs) are widely used in Internet-of-Things (IoT) networks, especially in remote areas where communication infrastructure is unavailable, due to flexibility and low cost. However, the joint optimization of locations of UAVs and relay path selection can be very challenging, especially when the numbers of IoT devices and UAVs are very large. In this paper, we formulate the joint optimization of UAV locations and relay paths in UAV-relayed IoT networks as a graph problem, and propose a graph neural network (GNN)-based approach to solve it in an efficient and scalable way. In the training procedure, we design a reinforcement learning-based relay GNN (RGNN) to select the best relay path for each user. The theoretical analysis shows that the time complexity of RGNN is two orders lower than the conventional optimization method. Then, we jointly exploit location GNN (LGNN) and RGNN trained to optimize the locations of all UAVs. Both GNNs can be trained without relying on the training data, which is usually unavailable in the context of wireless networks. In inference procedure, LGNN is first used to optimize the location of UAVs, and then RGNN is used to select the best relay path based on the output of LGNN. Simulation results show that the proposed approach can achieve comparable performance to brute-force search with much lower time complexity when the network is relatively small. Remarkably, the proposed approach is highly scalable to large-scale networks and adaptable to dynamics in the environment, which can hardly be achieved using conventional methods.
- 3 September 2022
- Published by MDPI AG in Remote Sensing
- Vol. 14 (17) , 4377
Open AccessJoint Flying Relay Location and Routing Optimization for 6G UAV–IoT Networks: A Graph Neural Network-Based Approach
Unmanned aerial vehicles (UAVs) are widely used in Internet-of-Things (IoT) networks, especially in remote areas where communication infrastructure is unavailable, due to flexibility and low cost. However, the joint optimization of locations of UAVs and relay path selection can be very challenging, especially when the numbers of IoT devices and UAVs are very large. In this paper, we formulate the joint optimization of UAV locations and relay paths in UAV-relayed IoT networks as a graph problem, and propose a graph neural network (GNN)-based approach to solve it in an efficient and scalable way. In the training procedure, we design a reinforcement learning-based relay GNN (RGNN) to select the best relay path for each user. The theoretical analysis shows that the time complexity of RGNN is two orders lower than the conventional optimization method. Then, we jointly exploit location GNN (LGNN) and RGNN trained to optimize the locations of all UAVs. Both GNNs can be trained without relying on the training data, which is usually unavailable in the context of wireless networks. In inference procedure, LGNN is first used to optimize the location of UAVs, and then RGNN is used to select the best relay path based on the output of LGNN. Simulation results show that the proposed approach can achieve comparable performance to brute-force search with much lower time complexity when the network is relatively small. Remarkably, the proposed approach is highly scalable to large-scale networks and adaptable to dynamics in the environment, which can hardly be achieved using conventional methods.
- 22 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications
- Vol. 27 (2) , 88-95
mmWave IEEE 802.11ay for 5G Fixed Wireless Access
- 22 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications
- Vol. 27 (2) , 88-95
mmWave IEEE 802.11ay for 5G Fixed Wireless Access