SAQR KHALIL SAEED THABET

Mr. SAQR KHALIL SAEED THABET

University of Electronic Science and Technology of China, Chengdu, Sichuan, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
13 December 2024
Verified
Book Chapter
Closed access
PDF file
STSAQR KHALIL SAEED THABET
SAQR KHALIL SAEED THABET
BSBehnaz Soltani
Behnaz Soltani
YZYipeng Zhou
Yipeng Zhou
Michael ShengMichael Sheng
Michael Sheng
SWShiting Wen
Shiting Wen

21 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
EOEMMANUEL OSEI-MENSAH
EMMANUEL OSEI-MENSAH
STSAQR KHALIL SAEED THABET
SAQR KHALIL SAEED THABET
CLChunbo Luo
Chunbo Luo
EAEmelia Asiedu-Ayeh
Emelia Asiedu-Ayeh
OBOlusola Bamisile
Olusola Bamisile
HUMPHREY ADUNHUMPHREY ADUN
HUMPHREY ADUN
Online video is anticipated to be the largest fraction of all mobile network traffic aside from the huge processing tasks imposed on networks by the billions of IoT devices, causing unprecedented challenges to the current network architecture. Edge caching has been proposed as a highly promising technology to overcome this challenge by placing computational and data storage resources at the network edge to reduce latency and backhaul traffic. However, the edge resources are heavily constrained in their storage and computational capacities as large-scale deployments mean fairly distributing resources across the network. Addressing this limitation, we propose an edge video caching scheme that dynamically caches the first part of popularity-ranked video files on Multi-Edge Computing Access Node (MAN) servers envisioned to achieve higher cache hit ratios, lower latencies, and lower backhaul traffic. The concept of Regionally Organized Clouds (ROCs) with sufficient resources for file caching and compute-intensive tasks was introduced, and a formulation of the edge caching problem as an Integer Linear Programming (ILP) problem was made. Additionally, this study proposes a file view-time threshold for each cached video aimed at reducing the resource wastage caused when buffered contents are abandoned. Comparative evaluations of the proposed show its excellent performance over FIFO, Greedy, LFRU and TLRU schemes.

25 March 2022
Verified
Conference Paper
Closed access
EOEMMANUEL OSEI-MENSAH
EMMANUEL OSEI-MENSAH
STSAQR KHALIL SAEED THABET
SAQR KHALIL SAEED THABET
OBOlusola Bamisile
Olusola Bamisile
EAEmelia Asiedu-Ayeh
Emelia Asiedu-Ayeh
Victor Kwaku AgbesiVictor Kwaku Agbesi
Victor Kwaku Agbesi
JLJian Li
Jian Li
As the number of wireless network-dependent devices exponentially grows, wireless access networks require capacity expansion to meet the high bandwidth demands of the applications running on these devices. This results in high power consumption, especially for services like traditional video and immersive media streaming which necessitate stringent high transmission rates. In this study, a part-based media edge caching scheme is proposed for energy-efficient wireless access networks. Intelligent-edge-assisted networks store only parts of the media content on edge servers and deliver the remaining parts when active users continually engage the streaming session. This is done by responding to network queries seeking to continue with content delivery or terminate the streaming session. The reward for a timely response is an assurance of uninterrupted streaming sessions. In this way, a streaming session without a user's response is halted to save the transmission energy and bandwidth of the edge servers. We formulate the edge caching problem as a multi-constrained multiple-knapsack problem and attempt to optimally place the content with the help of the proposed algorithm. Extensive simulations reveal that the proposed caching scheme shows improvements in the cache hit ratios and average delays as compared with LFU, FIFO, and LRU.

17 May 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
STSAQR KHALIL SAEED THABET
SAQR KHALIL SAEED THABET
EOEMMANUEL OSEI-MENSAH
EMMANUEL OSEI-MENSAH
OAOmar Ahmed
Omar Ahmed
ASAbegaz Mohammed Seid
Abegaz Mohammed Seid
OBOlusola Bamisile
Olusola Bamisile
During wireless video transmission, channel conditions can vary drastically. When the channel fails to support the transmission bit rate, the video quality degrades sharply. A pseudo-analog transmission system such as SoftCast relies on linear operations to achieve a linear quality transition over a wide range of channel conditions. When transmitting 3D videos over SoftCast, the following issues arise: (1) assigning the transmission power to texture and depth maps to obtain the optimal overall quality and (2) handling 3D video data traffic by dropping and re-allocating resources. This paper solves the pseudo-analog transmission resource allocation problem and improves the results by applying the optimal joint power allocation. First, the minimum and the target distortion optimization problems are formulated in terms of a power–bandwidth pair versus distortion. Then, a minimum distortion optimization algorithm iteratively computes all the possible resource allocations to find the optimal allocation based on the minimum distortion. Next, the three-dimensional target distortion problem is divided into two subproblems. In the power-distortion problem, to obtain a target distortion, the algorithm exhaustively solves the closed form of the power resource under a predefined upper-bound bandwidth. For the bandwidth-distortion problem, reaching a target distortion requires solving iteratively for the bandwidth resource closed form, given a predefined power. The proposed resource control scheme shows an improvement in transmission efficiency and resource utilization. At low power usage, the proposed method could achieve a PSNR gain of up to 1.5 dB over SoftCast and even a 1.789 dB gain over a distortion-resource algorithm, using less than 1.4% of the bandwidth.

9 February 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
STSAQR KHALIL SAEED THABET
SAQR KHALIL SAEED THABET
YZYipeng Zhou
Yipeng Zhou
BSBehnaz Soltani
Behnaz Soltani
Michael ShengMichael Sheng
Michael Sheng
SWShiting Wen
Shiting Wen
DWDi Wu
Di Wu
Federated learning (FL) is revolutionizing machine learning by enabling multiple decentralized clients to collaboratively train a shared model. In mobile scenarios, client devices exchange model parameters with a central server via wireless channels. However, designing efficient wireless FL (WFL) is challenging due to limited energy and channel capacity. To fully utilize communication resources, over-the-air (OTA) computation has been introduced, allowing direct aggregation of analog parameter signals. However, it conceals clients’ information from the server, making advanced client selection strategies, e.g., cluster-based client selection, and sparsification compression algorithms like TopK inapplicable. To address these limitations, we propose the WFL with Voting-based Clustering (WFL-VC) algorithm, which can integrate advanced client selection and the TopK model sparsification algorithm with OTA computation. WFL-VC consists of two phases: 1) Phase 1: clients vote on significant parameters based on local models, allowing the server to select clients and identify the global Topk parameters; and 2) Phase 2: the selected clients upload model update parameters with globally aligned indices for over-the-air computation at the server. By combining OTA computation with cluster-based client selection and TopK sparsification, WFL-VC substantially reduces the energy consumption of WFL. Extensive experiments on real-world datasets show that WFL-VC outperforms competitive baselines while consuming considerably less energy.