Mohammed S. Al-Abiad

Mohammed S. Al-Abiad

Auto-generated profile, based on publicly available information

Mohammed S. Al-Abiad

Department of Electrical, Computer, and Biomedical Engineering, Toronto Metropolitan University, Toronto, ON, Canada

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MAMohammed S. Al-Abiad
Mohammed S. Al-Abiad
ZHZoheb Hassan
Zoheb Hassan
Md. Jahangir HossainMd. Jahangir Hossain
Md. Jahangir Hossain
Distributed machine learning (ML) algorithms are imperative for the next-generation Internet of Things (IoT) networks, thanks to preserving the privacy of users’ data and efficient usage of the communication resources. Federated learning (FL) is a promising distributed ML algorithm where the models are trained at the edge devices over the local data sets, and only the model parameters are shared with the cloud server (CS) to generate global model parameters. Nevertheless, due to the limited battery life of the edge devices, improving the energy-efficiency is a prime concern for FL. In this work, we investigate a resource allocation scheme to reduce the overall energy consumption of FL in the relay-assisted IoT networks. We aim at minimizing the overall energy consumption of IoT devices subject to the FL time constraint. FL time consists of model training computation time and wireless transmission latency. Toward this goal, a joint optimization problem, considering scheduling the IoT devices with the relays, transmit power allocation, and computation frequency allocation, is formulated. Due to the NP-hardness of the joint optimization problem, a global optimal solution is intractable. Therefore, leveraging graph theory, joint near-optimal, and low-complexity suboptimal solutions are proposed. Efficiency of our proposed solutions over several benchmark schemes is verified via extensive simulations. Simulation results show that the proposed near-optimal scheme achieves 6, 4, and 2 times lower energy consumption, respectively, compared to the considered fixed, computation adaptation, and power adaptation schemes. Such an appealing energy efficiency comes at the cost of slightly increased FL time compared to the fixed and computation only adaptation schemes.

6 March 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MAMohammed S. Al-Abiad
Mohammed S. Al-Abiad
MOMohanad Obeed
Mohanad Obeed
Md. Jahangir HossainMd. Jahangir Hossain
Md. Jahangir Hossain
ACAnas Chaaban
Anas Chaaban
Federated learning (FL) has emerged as a distributed machine learning (ML) technique to train models without sharing users’ private data. In this paper, we introduce a decentralized FL scheme that is called federated learning empowered overlapped clustering for decentralized aggregation (FL-EOCD). The introduced FL-EOCD leverages device-to-device (D2D) communications and overlapped clustering to enable decentralized aggregation, where a cluster is defined as a coverage zone of a typical device. The devices located on the overlapped clusters are called bridge devices (BDs). In the proposed FL-EOCD scheme, a clustering topology is envisioned where clusters are connected through BDs, so as the aggregated models of each cluster is disseminated to the other clusters in a decentralized manner without the need for a global aggregator or an additional hop of transmission. To evaluate our proposed FL-EOCD scheme as opposed to baseline FL schemes, we consider minimizing the overall energy-consumption of devices while maintaining the convergence rate of FL subject to its time constraint. To this end, a joint optimization problem, considering scheduling the local devices/BDs to the CHs and computation frequency allocation, is formulated, where an iterative solution to this joint problem is devised. Extensive simulations are conducted to verify the effectiveness of the proposed FL-EOCD algorithm over FL conventional schemes in terms of energy consumption, latency, and convergence rate.

29 July 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MAMohammed S. Al-Abiad
Mohammed S. Al-Abiad
ADAhmed Douik
Ahmed Douik
SSSameh Sorour
Sameh Sorour
Md. Jahangir HossainMd. Jahangir Hossain
Md. Jahangir Hossain
Cloud radio access networks (C-RANs) are promising paradigms for the fifth-generation (5G) networks due to their interference management capabilities. In a C-RAN, a central processor (CP) is responsible for coordinating multiple Remote Radio Heads (RRHs) and scheduling users to their radio resource blocks (RRBs). In this paper, we develop a novel cross-layer network coding (CLNC) approach that proposes to optimize RRH’s transmit powers and user’s rates in making the coding decisions. As such, cross-layer throughput of the network is maximized. The joint user scheduling, file encoding, and power adaptation problem is solved by designing a subgraph for each RRB, in which each vertex represents potential user-RRH associations, encoded files, transmission rates, and power levels (PLs) for one RRB. It is then shown that the C-RAN throughput maximization problem is equivalent to a maximum-weight clique problem over the union of all such subgraphs, called herein the CRAN-CLNC graph. Numerical results revealed that the proposed joint and iterative schemes offer improved throughput performances as compared to the existing algorithms in the literature. Compared to our proposed joint scheme, our proposed iterative scheme has a certain degradation, roughly in the range of 9%–14%. This small degradation in the throughput performance of the iterative scheme comes at the achieved low computational complexity as compared to the high complexity of the joint scheme.

15 October 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MSMohammed Saif
Mohammed Saif
MJMohammad Javad-Kalbasi
Mohammad Javad-Kalbasi
SVShahrokh Valaee
Shahrokh Valaee
Reconfigurable intelligent surfaces (RISs) have drawn considerable attention due to their ability to introduce controllable phase-shifts onto impinging electromagnetic waves and impose link redundancy. Meanwhile, unmanned aerial vehicles (UAVs) are expected to make future 6G networks more connected, but they are prone to several failures, which cause network disintegration. To harness the benefits of both, we study their integration to improve connectivity of multi-RIS-assisted UAV networks. We first propose to define the criticality of nodes, which reflects the importance of some nodes over other nodes. We then employ the algebraic connectivity metric, which is adjusted by the reflected links of the RISs and their criticality weights, to formulate the problem of maximizing the network connectivity. Such problem is a computationally expensive combinatorial optimization. Using a relaxation method where the discrete scheduling constraint of the problem is relaxed to be continuous, we propose two efficient solutions, namely semi-definite programming (SDP) optimization and Laplacian matrix perturbation, which both solve the problem in polynomial time. We rigorously derive the lower and upper bounds of the algebraic connectivity obtained from the perturbation solution. Simulation results compare the performance of the proposed solutions with different schemes, including without RISs, unoptimized link scheduling and phase shifts, greedy search, and optimal. The results show that the proposed schemes achieve considerably improved performance with low computational complexity compared to other schemes.

27 January 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MSMohammed Saif
Mohammed Saif
SVShahrokh Valaee
Shahrokh Valaee
The integration of reconfigurable intelligent surfaces (RISs) and unmanned aerial vehicle (UAV) communications has emerged as a promising solution for improving link quality and massive connectivity for beyond 5G wireless networks. This paper presents an innovative approach to maximizing connectivity of uplink multi-RIS-assisted UAV networks enabled by RIS placement and virtual partitioning, wherein RISs are deployed to assist in the communications between user-equipment (UEs) and UAVs. In the considered model, the UEs intend to transmit data to the UAVs, and RISs can assist in improving network connectivity by connecting the UEs to the blocked UAVs. First, exact and approximated closed-form (CF) expressions for signal-to-noise ratio (SNR) are derived based on aligned and non-aligned portions of the RISs. Then, we formulate the problem of maximizing the network connectivity that jointly considers (i) UE-RIS-UAV link selection and (ii) RIS placement and virtual partitioning. This problem is a computationally expensive combinatorial optimization. Using the block coordinate descent (BCD) approach, we propose novel UE-RIS-UAV selection and RIS placement and partitioning methods. Specifically, we develop clustering and perturbation methods for UE-RIS-UAV selection, and derive a closed-form solution for the partitioning of the RISs. Moreover, for optimizing the RISs placement, Adam optimizer is used. Simulation results demonstrate that the proposed approaches yield a gain in the range of 12% to 45% compared to benchmark schemes. The finding emphasizes the potential of integrating RIS with UAV communications as a robust and reliable connectivity solution for future wireless communication systems.

3 September 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MAMohammed S. Al-Abiad
Mohammed S. Al-Abiad
ADAhmed Douik
Ahmed Douik
SSSameh Sorour
Sameh Sorour
Cloud radio access networks (C-RAN) gained much attention thanks to their abilities in mitigating interference and providing high data rates by coordinating multiple Remote Radio Heads (RRHs). This paper considers the use of rate aware instantly decodable network coding (RA-IDNC) as a mean to accelerate the broadcast of a set of messages to a set of users in a C-RAN setting. While previous works focus either on rate-unaware IDNC or rate adaptation for traditional single transmitter systems, this paper extends the results to C-RANs. The various ergodic capacities of the different users to the different RRHs bring a new trade-off between the number of scheduled users and the transmission rates. The proposed framework incorporates such information in the network coding decisions, so as the scheduled users, coded messages, and transmission rates reduce the overall completion time. Given the intractability of the problem, the paper proposes relaxing the optimization by an online approach involving an anticipated version of the completion time which allows mapping the possible associations between users, RRHs, coded packets, and transmission rates to vertices in a newly designed graph. Afterward, the online completion time reduction problem is shown to be equivalent to a maximum weight independent set problem over the proposed graph. Simulation results reveal that the proposed scheme achieves substantial performance gain over uncoded and NC rate-unaware algorithms.