Abdulbary Naji
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abdulbary Naji has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Ammar Hawbani
Shenyang Aerospace University
7 shared publications - Xingfu Wang
University of Science and Technology of China
7 shared publications - Liang Zhao
Shenyang Aerospace University
5 shared publications - Saeed Hamood Alsamhi
Insight Centre for Data Analytics, University of Galway, Galway, Ireland
3 shared publications - Ahmed Al-Dubai
Edinburgh Napier University
2 shared publications - Bushra Qureshi
School of Computer Science and Technology, University of Science Technology of China,Hefei,China
2 shared publications
Latest Publications
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (4) , 1418-1430
NetCRC-NR: In-Network 5G NR CRC Accelerator
In 5G Radio Access Networks (RAN), Cyclic Redundancy Check (CRC) algorithms play a vital role in detecting accidental changes to digital data during transmission. However, due to the massive bandwidth demands in 5G networks, CRC computation is a resource-intensive process. To address this challenge, we propose performing CRC computation and verification directly in the network path. Specifically, we introduce NetCRC-NR, a 5G New Radio (NR) standard-compliant in-network CRC accelerator. NetCRC-NR implements the 5G NR CRC algorithms specified in 3GPP TS 38.212, including CRC24A, CRC24B, CRC24C, CRC16, CRC11, and CRC6. It leverages programmable switches to perform in-network CRC generation and validation for the Transport Blocks (TBs) and Code Blocks (CBs), aiming at providing high CRC computation throughput and alleviating the computational burden on General-Purpose Processors (GPPs). We design and implement NetCRC-NR on Intel Tofino programmable switch and commodity servers running the Data Plane Development Kit (DPDK). Extensive experiments demonstrate that NetCRC-NR performs CRC generation and verification at the switch line rate of up to 4+Tbps CRC throughput, showcasing its efficiency and potential in accelerating the 5G RAN error detection process.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (4) , 1418-1430
NetCRC-NR: In-Network 5G NR CRC Accelerator
In 5G Radio Access Networks (RAN), Cyclic Redundancy Check (CRC) algorithms play a vital role in detecting accidental changes to digital data during transmission. However, due to the massive bandwidth demands in 5G networks, CRC computation is a resource-intensive process. To address this challenge, we propose performing CRC computation and verification directly in the network path. Specifically, we introduce NetCRC-NR, a 5G New Radio (NR) standard-compliant in-network CRC accelerator. NetCRC-NR implements the 5G NR CRC algorithms specified in 3GPP TS 38.212, including CRC24A, CRC24B, CRC24C, CRC16, CRC11, and CRC6. It leverages programmable switches to perform in-network CRC generation and validation for the Transport Blocks (TBs) and Code Blocks (CBs), aiming at providing high CRC computation throughput and alleviating the computational burden on General-Purpose Processors (GPPs). We design and implement NetCRC-NR on Intel Tofino programmable switch and commodity servers running the Data Plane Development Kit (DPDK). Extensive experiments demonstrate that NetCRC-NR performs CRC generation and verification at the switch line rate of up to 4+Tbps CRC throughput, showcasing its efficiency and potential in accelerating the 5G RAN error detection process.
- 20 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (2) , 665-677
NetMod: Toward Accelerating Cloud RAN Distributed Unit Modulation Within Programmable Switches
Radio Access Networks (RAN) are anticipated to gradually transition towards Cloud RAN (C-RAN), leveraging the full advantages of the cloud-native computing model. While this paradigm shift offers a promising architectural evolution to improve scalability, efficiency, and performance, significant challenges remain in managing the massive computing requirements of physical layer (PHY) processing. To address these challenges and meet the stringent Service Level Objectives (SLOs) in 5G networks, hardware acceleration technologies are essential. In this paper, we aim to mitigate this challenge by offloading 5G modulation mapping, a critical yet demanding function to encode bits into IQ symbols, directly onto the switch ASICs. Specifically, we introduce NetMod, a 5G New Radio (NR) standard-compliant in-network modulation mapper accelerator. NetMod leverages the capabilities of new-generation programmable switches within the C-RAN infrastructure to offload and accelerate PHY modulation functions. We implemented a NetMod prototype on a real-world platform using the Intel Tofino programmable switch and commodity servers running the Data Plane Development Kit (DPDK). Through extensive experiments, we demonstrate that NetMod achieves modulation mapping at switch line rate using minimal switch resources, thereby preserving ample space for traditional switching tasks. Furthermore, comparisons with a GPU-based 5G modulation mapper show that NetMod is 2.2$\boldsymbol{\times}$ to 3.3$\boldsymbol{\times}$ faster using only a single switch port. These results highlight the potential of in-network acceleration to enhance 5G network performance and efficiency.- 20 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (2) , 665-677
NetMod: Toward Accelerating Cloud RAN Distributed Unit Modulation Within Programmable Switches
Radio Access Networks (RAN) are anticipated to gradually transition towards Cloud RAN (C-RAN), leveraging the full advantages of the cloud-native computing model. While this paradigm shift offers a promising architectural evolution to improve scalability, efficiency, and performance, significant challenges remain in managing the massive computing requirements of physical layer (PHY) processing. To address these challenges and meet the stringent Service Level Objectives (SLOs) in 5G networks, hardware acceleration technologies are essential. In this paper, we aim to mitigate this challenge by offloading 5G modulation mapping, a critical yet demanding function to encode bits into IQ symbols, directly onto the switch ASICs. Specifically, we introduce NetMod, a 5G New Radio (NR) standard-compliant in-network modulation mapper accelerator. NetMod leverages the capabilities of new-generation programmable switches within the C-RAN infrastructure to offload and accelerate PHY modulation functions. We implemented a NetMod prototype on a real-world platform using the Intel Tofino programmable switch and commodity servers running the Data Plane Development Kit (DPDK). Through extensive experiments, we demonstrate that NetMod achieves modulation mapping at switch line rate using minimal switch resources, thereby preserving ample space for traditional switching tasks. Furthermore, comparisons with a GPU-based 5G modulation mapper show that NetMod is 2.2$\boldsymbol{\times}$ to 3.3$\boldsymbol{\times}$ faster using only a single switch port. These results highlight the potential of in-network acceleration to enhance 5G network performance and efficiency.- 19 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 10 (1) , 57-69
Adaptive Mobile Chargers Scheduling Scheme Based on AHP-MCDM for WRSN
Wireless Sensor Networks (WSNs) are used to sense and monitor physical conditions in various services and applications. However, there are a number of challenges in deploying WSNs, especially those pertaining to energy replenishment. Using the current solutions, when a significant number of sensors need to replenish their energy, this would be costly in terms of time, efforts and resources. Thus, this paper aims to solve this problem by efficiently deploying wireless power transfer technologies and scheduling Mobile Charging Vehicles (MCVs) in WRSN. The proposed method deploys multi-criteria decision-making (i.e., Analytical Hierarchy Process (AHP)) to schedule the charging tasks. To the best of our knowledge, this paper is the first to depend solely on AHP in MCVs scheduling. The paper demonstrates the validity of the proposed method by illustrating that the matrices that are created are within the accepted values of consistency ratio. In addition, the paper proposes a method of partitioning the values of our criteria to avoid the problem of different criteria having different measurement units. Unlike existing works, the paper aims to schedule an MCV for charging based on both the distance and residual energy of the sensor. The proposed method exhibits superiority in terms of the average remaining energy available in the system, having the shortest queue length, shorter MCV response time, shorter charging duration, and shorter queue waiting time against the state-of-the-art methods. Our study paves the way for next generation efficient charging and MCV scheduling.
- 19 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 10 (1) , 57-69
Adaptive Mobile Chargers Scheduling Scheme Based on AHP-MCDM for WRSN
Wireless Sensor Networks (WSNs) are used to sense and monitor physical conditions in various services and applications. However, there are a number of challenges in deploying WSNs, especially those pertaining to energy replenishment. Using the current solutions, when a significant number of sensors need to replenish their energy, this would be costly in terms of time, efforts and resources. Thus, this paper aims to solve this problem by efficiently deploying wireless power transfer technologies and scheduling Mobile Charging Vehicles (MCVs) in WRSN. The proposed method deploys multi-criteria decision-making (i.e., Analytical Hierarchy Process (AHP)) to schedule the charging tasks. To the best of our knowledge, this paper is the first to depend solely on AHP in MCVs scheduling. The paper demonstrates the validity of the proposed method by illustrating that the matrices that are created are within the accepted values of consistency ratio. In addition, the paper proposes a method of partitioning the values of our criteria to avoid the problem of different criteria having different measurement units. Unlike existing works, the paper aims to schedule an MCV for charging based on both the distance and residual energy of the sensor. The proposed method exhibits superiority in terms of the average remaining energy available in the system, having the shortest queue length, shorter MCV response time, shorter charging duration, and shorter queue waiting time against the state-of-the-art methods. Our study paves the way for next generation efficient charging and MCV scheduling.
- 19 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (5) , 6795-6810
Performance Analysis of CUPS-Enabled Space-Ground Cellular Networks
Control- and User-Plane Separation (CUPS) and Space Cellular Networks (SCNs) are promising solutions for delivering ubiquitous connectivity and high-traffic wireless services on a global scale. Nevertheless, the potential benefit of CUPS in the separation networks' coverage and data service functions has not been fully leveraged in enabling reliable connectivity. In this paper, we propose a CUPS-enabled Integrated Space-Ground Cellular Network (CUPS-ISGCN). Specifically, Control Base Stations (CBSs) are optimized by deploying them on the space layer to form the Control Plane (CP) and increase coverage for more users over a wide area. Meanwhile, Traffic Base Stations (TBSs) located on the ground layer form the User Plane (UP) and deliver high bit rates within the coverage area of the CP. To maximize CP coverage and improve UP efficiency, we introduce CUPS-enabled SCN into the CP and provide the analytical models to analyze the performance of the CUPS-ISGCN in terms of CP coverage and UP efficiency. By using stochastic geometry, we derive the general closed-form expressions for CP coverage. Then, we thoroughly study UP's performance as a function of the channel parameters between 2-planes, CP and UP. Based on the analysis results, it's proved that the proposed CUPS-ISGCN structure improved the CP coverage performance and UP efficiency.
- 19 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (5) , 6795-6810
Performance Analysis of CUPS-Enabled Space-Ground Cellular Networks
Control- and User-Plane Separation (CUPS) and Space Cellular Networks (SCNs) are promising solutions for delivering ubiquitous connectivity and high-traffic wireless services on a global scale. Nevertheless, the potential benefit of CUPS in the separation networks' coverage and data service functions has not been fully leveraged in enabling reliable connectivity. In this paper, we propose a CUPS-enabled Integrated Space-Ground Cellular Network (CUPS-ISGCN). Specifically, Control Base Stations (CBSs) are optimized by deploying them on the space layer to form the Control Plane (CP) and increase coverage for more users over a wide area. Meanwhile, Traffic Base Stations (TBSs) located on the ground layer form the User Plane (UP) and deliver high bit rates within the coverage area of the CP. To maximize CP coverage and improve UP efficiency, we introduce CUPS-enabled SCN into the CP and provide the analytical models to analyze the performance of the CUPS-ISGCN in terms of CP coverage and UP efficiency. By using stochastic geometry, we derive the general closed-form expressions for CP coverage. Then, we thoroughly study UP's performance as a function of the channel parameters between 2-planes, CP and UP. Based on the analysis results, it's proved that the proposed CUPS-ISGCN structure improved the CP coverage performance and UP efficiency.
- 18 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 9 (1) , 31-45
ESPP: Efficient Sector-Based Charging Scheduling and Path Planning for WRSNs With Hexagonal Topology
Wireless Power Transfer (WPT) is a promising technology that can potentially mitigate the energy provisioning problem for sensor networks. In order to efficiently replenish energy for these battery-powered devices, designing appropriate scheduling and charging path planning algorithms is essential and challenging. Whilst previous studies have tackled this challenge, the conjoint influences of network topology, charging path planning, and energy threshold distribution in Wireless Rechargeable Sensor Networks (WRSNs) are still in their infancy. We mitigate the aforementioned problem by proposing novel algorithmic solutions to efficient sector-based on-demand charging scheduling and path planning. Specifically, we first propose a hexagonal cluster-based deployment of nodes such that finding an NP-Complete Hamiltonian path is feasible. Second, each cluster is divided into multiple sectors and a charging path planning algorithm is implemented to yield a Hamiltonian path, aimed at improving the Mobile Charging Vehicle (MCV) efficiency and charging throughput. Third, we propose an efficient algorithm to calculate the importance of nodes to be used for charging duration decision-making and prioritization. Fourth, a non-preemptive dynamic priority scheduling algorithm is proposed for charging tasks' assignments and scheduling. Finally, extensive simulations have been conducted, revealing the significant advantages of our proposed algorithms in terms of energy efficiency, response time, dead nodes' density, and queuing processing.
- 18 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 9 (1) , 31-45
ESPP: Efficient Sector-Based Charging Scheduling and Path Planning for WRSNs With Hexagonal Topology
Wireless Power Transfer (WPT) is a promising technology that can potentially mitigate the energy provisioning problem for sensor networks. In order to efficiently replenish energy for these battery-powered devices, designing appropriate scheduling and charging path planning algorithms is essential and challenging. Whilst previous studies have tackled this challenge, the conjoint influences of network topology, charging path planning, and energy threshold distribution in Wireless Rechargeable Sensor Networks (WRSNs) are still in their infancy. We mitigate the aforementioned problem by proposing novel algorithmic solutions to efficient sector-based on-demand charging scheduling and path planning. Specifically, we first propose a hexagonal cluster-based deployment of nodes such that finding an NP-Complete Hamiltonian path is feasible. Second, each cluster is divided into multiple sectors and a charging path planning algorithm is implemented to yield a Hamiltonian path, aimed at improving the Mobile Charging Vehicle (MCV) efficiency and charging throughput. Third, we propose an efficient algorithm to calculate the importance of nodes to be used for charging duration decision-making and prioritization. Fourth, a non-preemptive dynamic priority scheduling algorithm is proposed for charging tasks' assignments and scheduling. Finally, extensive simulations have been conducted, revealing the significant advantages of our proposed algorithms in terms of energy efficiency, response time, dead nodes' density, and queuing processing.
- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 48-52
Charging Scheduling Scheme for Maximizing Charging Efficiency to Extend Network Lifetime in WRSNs
Wireless Rechargeable Sensor Network (WRSN) is an emerging technology that has risen intending to enhance the network lifetime of conventional Wireless Sensor Networks (WSNs). In this paper, we have come up with a detailed overview of the charging cycles and scheduling schemes in WRSNs where sensor nodes take advantage of wireless power transfer techniques and serve the network for a longer period. Generally, the researchers do accept that using the full charging approach is not ideal due to the limited power of Mobile Charging Vehicles (MCVs) but they neglect the fact that solely using a partial charging scheme is also not the best solution as it increases travel time. After a critical overview of each aspect, we proposed a charging scheduling algorithm using both full and partial charging schemes. First, our scheduling scheme is a distributed architecture where each MCV serves its assigned region. Unlike other schemes, we used a spare MCV instead of deploying depots that can increase the cost of the network. Similarly, we also introduced volunteer charging sessions to lower the back and forth travelling of MCV s. The simulation results showed that our proposed charging scheduling scheme offers promising performance and outperforms in terms of charging efficiency, response time, queue length, and other performance evaluation metrics.
- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 48-52
Charging Scheduling Scheme for Maximizing Charging Efficiency to Extend Network Lifetime in WRSNs
Wireless Rechargeable Sensor Network (WRSN) is an emerging technology that has risen intending to enhance the network lifetime of conventional Wireless Sensor Networks (WSNs). In this paper, we have come up with a detailed overview of the charging cycles and scheduling schemes in WRSNs where sensor nodes take advantage of wireless power transfer techniques and serve the network for a longer period. Generally, the researchers do accept that using the full charging approach is not ideal due to the limited power of Mobile Charging Vehicles (MCVs) but they neglect the fact that solely using a partial charging scheme is also not the best solution as it increases travel time. After a critical overview of each aspect, we proposed a charging scheduling algorithm using both full and partial charging schemes. First, our scheduling scheme is a distributed architecture where each MCV serves its assigned region. Unlike other schemes, we used a spare MCV instead of deploying depots that can increase the cost of the network. Similarly, we also introduced volunteer charging sessions to lower the back and forth travelling of MCV s. The simulation results showed that our proposed charging scheduling scheme offers promising performance and outperforms in terms of charging efficiency, response time, queue length, and other performance evaluation metrics.
- 21 June 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (7) , 3019-3043
A state-of-the-art survey on wireless rechargeable sensor networks: perspectives and challenges
- 21 June 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (7) , 3019-3043
A state-of-the-art survey on wireless rechargeable sensor networks: perspectives and challenges