SearcharxivSearch

arXiv subjects

Madyan Alsenwi

Publications and source records attributed to Madyan Alsenwi.

16 recordsLinked to original sources

JEPA for AI-Native 6G: Predictive Representations and Open Challenges

Sixth-generation (6G) networks are moving toward AI-native operation, where learning modules are embedded across the radio access network (RAN), edge, and core. This transition requires learning from limited labels, heterogeneous wireless and network data, partial observations, non-stationary propagation, and latency-constrained control loops. Joint-embedding predictive architecture (JEPA) is a promising self-supervised paradigm for this setting because it predicts missing or future representations in latent space instead of reconstructing raw measurements or using contrastive negative samples. This article presents a wireless-oriented tutorial on JEPA for 6G intelligence. We define the JEPA training mechanism, describe how CSI, beam measurements, KPIs, topology graphs, and sensing observations can be tokenized and masked, and position the learned encoder as a predictive representation layer for RAN, O-RAN, edge, and core functions, with task-specific heads or controllers producing final decisions. Then we present an illustrative, beam-management case study suggesting that a wireless-aware target, specifically an auxiliary future beam-energy target during self-supervised pretraining, can improve label efficiency and robustness across shifted deployment conditions relative to a supervised source domain. Finally, we outline open challenges in multi-timescale prediction, action-conditioned modeling, distributed training, trustworthiness, efficient deployment, benchmarking, and standardization.

cs.LG

Resilience Optimization in 6G and Beyond Integrated Satellite-Terrestrial Networks: A Deep Reinforcement Learning Approach

Ensuring network resilience in 6G and beyond is essential to maintain service continuity during base station (BS) outages due to failures, disasters, attacks, or energy-saving operations. This paper proposes a novel resilience optimization framework for integrated satellite-terrestrial networks (ISTNs), leveraging low Earth orbit (LEO) satellites to assist users when terrestrial BSs are unavailable. Specifically, we develop a realistic multi-cell model incorporating user association, antenna downtilt adaptation, power control, heterogeneous traffic demands, and dynamic user distribution. The objective is to maximize of the total user rate in the considered area by optimizing the BS's antenna tilt, transmission power, user association to neighboring BS or to a LEO satellite with a minimum number of successfully served user satisfaction constraint, defined by rate and Reference Signal Received Power (RSRP) requirements. To solve the non-convex, NP-hard problem, we design a deep Q-network (DQN)-based algorithm to learn network dynamics to maximize throughput while minimizing LEO satellite usage, thereby limiting reliance on links with longer propagation delays and prolonging satellite operational lifetime. Simulation results confirm that our approach significantly outperforms the benchmark one.

cs.NI

Low-Complexity Channel Estimation Protocol for Non-Diagonal RIS-Assisted Communications

Non-diagonal reconfigurable intelligent surfaces (RISs) offer enhanced wireless signal manipulation over conventional RIS by enabling the incident signal on any of its $M$ elements to be reflected from another element via an $M \times M$ switch array. To fully exploit this flexible configuration, the acquisition of individual channel state information (CSI) is essential. However, due to the passive nature of the RIS, cascaded channel estimation is performed, as the RIS itself lacks signal processing capabilities. This entails estimating the CSI for the $M \times M$ switch array cascaded channels, resulting in estimating $M^2$ coefficients, to identify the optimal configuration of the non-diagonal RIS that maximizes the channel gain. In this paper, we propose a low-complexity channel estimation protocol that substantially reduces the estimation overhead from the exhaustive $M^2$ coefficients to only $3M$ coefficients for both single-input single-output (SISO) and multiple-input single-output (MISO) systems. Specifically, a three-stage pilot-based protocol is proposed to estimate scaled versions of the user-RIS and RIS-base-station (BS) channels in the first two stages using the least square (LS) estimator and the commonly used ON/OFF protocol for conventional RIS. These scaled estimates enable the optimization of the switch array. In the third stage, the cascaded user-RIS-BS channels are estimated to enable efficient beamforming optimization. Complexity analysis shows that our proposed protocol significantly reduces the BS estimation complexity from $\mathcal{O}(NM^2)$ to $\mathcal{O}(NM)$, where $N$ is the number of BS antennas. This complexity is similar to the ON/OFF-based LS estimation for conventional diagonal RIS.

eess.SP

Pinching Antenna Systems versus Reconfigurable Intelligent Surfaces in mmWave

Flexible and intelligent antenna designs, such as pinching antenna systems and reconfigurable intelligent surfaces (RIS), have gained extensive research attention due to their potential to enhance the wireless channels. This letter, for the first time, presents a comparative study between the emerging pinching antenna systems and RIS in millimeter wave (mmWave) bands. Our results reveal that RIS requires an extremely large number of elements (in the order of $10^4$) to outperform pinching antenna systems in terms of spectral efficiency, which severely impact the energy efficiency performance of RIS. Moreover, pinching antenna systems demonstrate greater robustness against hardware impairments and severe path loss typically encountered in high-frequency mmWave bands.

eess.SP

Network Digital Twin for 6G and Beyond: An End-to-End View Across Multi-Domain Network Ecosystems

With the rapid development of technology, the number of smart mobile users is increasing, accompanied by growing demands from applications such as virtual/augmented reality (VR/XR), remote surgery, autonomous vehicles, and real-time holographic communications, all of which require high transmission rates and ultra-low latency in 6G and beyond networks (6G+). This poses enormous challenges in efficiently deploying large-scale networks, including network design, planning, troubleshooting, optimization, and maintenance, without affecting the user experience. Network Digital Twin (NDT) has emerged as a potential solution, enabling the creation of a virtual model that reflects the actual network, supporting the simulation of various network designs, applying diverse operating policies, and reproducing complex fault scenarios under real-world conditions. This motivate us for this study, where we provide a comprehensive survey of NDT in the context of 6G+, covering areas such as radio access networks (RAN), transport networks, 5G core networks and beyond (5GCORE+), cloud/edge computing, applications (blockchain, health system, manufacturing, security, and vehicular networks), non-terrestrial networks (NTNs), and quantum networks, from both academic and industrial perspectives. In particular, we are the first to provide an in-depth guide and usage of RAN and 5GCORE+ for NDT. Then, we provide an extensive review of foundation technologies such as transport networks, cloud/edge computing, applications, NTNs, and quantum networks in NDT. Finally, we discuss the key challenges, open issues, and future research directions for NDT in the context of 6G+.

cs.NI

Joint Beamforming and Trajectory Optimization for Multi-UAV-Assisted Integrated Sensing and Communication Systems

In this paper, we investigate beamforming design and trajectory optimization for a multi-unmanned aerial vehicle (UAV)-assisted integrated sensing and communication (ISAC) system. The proposed system employs multiple UAVs equipped with dual-functional radar-communication capabilities to simultaneously perform target sensing and provide communication services to users. We formulate a joint optimization problem that aims to maximize the sum rate of users while maintaining target sensing performance through coordinated beamforming and UAV trajectory design. To address this challenging non-convex problem, we develop a block coordinated descent (BCD)-based iterative algorithm that decomposes the original problem into tractable subproblems. Then, the beamforming design problem is addressed using fractional programming, while the UAV trajectory is refined through the deep deterministic policy gradient (DDPG) algorithm. The simulation results demonstrate that the proposed joint optimization approach achieves significant performance improvements in both communication throughput and sensing accuracy compared to conventional, separated designs. We also show that proper coordination of multiple UAVs through optimized trajectories and beamforming patterns can effectively balance the tradeoff between sensing and communication objectives.

cs.NI

Digital Twin for Non-Terrestrial Networks: Vision, Challenges, and Enabling Technologies

This paper investigates the transformative potential of digital twin (DT) technology for non-terrestrial networks (NTNs). NTNs, comprising airborne and space-borne elements, face unique challenges in network control, management, and optimization. DT technology provides a novel framework for designing and managing complex cyber-physical systems with enhanced automation, intelligence, and resilience. By offering a dynamic virtual representation of the NTN ecosystem, DTs enable real-time monitoring, simulation, and data-driven decision-making. This paper explores the integration of DTs into NTNs, identifying technical challenges and highlighting some key enabling technologies. Emphasis is placed on technologies such as the Internet of Things (IoT), machine learning, generative AI, space-based clouds, quantum computing, and others, highlighting their potential to empower DT development for NTNs. To illustrate these concepts, we present a case study demonstrating the implementation of a data-driven DT model for enabling dynamic, service-oriented network slicing within an open radio access network (O-RAN) architecture tailored for NTNs. This work aims to advance the understanding and application of DT technology, contributing to the evolution of network control and management in the dynamic and rapidly changing landscape of non-terrestrial communication systems.

cs.NI

Ruin Theory for User Association and Energy Optimization in Multi-access Edge Computing

In this correspondence, a novel framework is proposed for analyzing data offloading in a multi-access edge computing system. Specifically, a two-phase algorithm, is proposed, including two key phases: 1) user association phase and 2) task offloading phase. In the first phase, a ruin theory-based approach is developed to obtain the users association considering the users' transmission reliability and resource utilization efficiency. Meanwhile, in the second phase, an optimization-based algorithm is used to optimize the data offloading process. In particular, ruin theory is used to manage the user association phase, and a ruin probability-based preference profile is considered to control the priority of proposing users. Here, ruin probability is derived by the surplus buffer space of each edge node at each time slot. Giving the association results, an optimization problem is formulated to optimize the amount of offloaded data aiming at minimizing the energy consumption of users. Simulation results show that the developed solutions guarantee system reliability, association efficiency under a tolerable value of surplus buffer size, and minimize the total energy consumption of all users.

cs.IT

A Dispersed Federated Learning Framework for 6G-Enabled Autonomous Driving Cars

Sixth-Generation (6G)-based Internet of Everything applications (e.g. autonomous driving cars) have witnessed a remarkable interest. Autonomous driving cars using federated learning (FL) has the ability to enable different smart services. Although FL implements distributed machine learning model training without the requirement to move the data of devices to a centralized server, it its own implementation challenges such as robustness, centralized server security, communication resources constraints, and privacy leakage due to the capability of a malicious aggregation server to infer sensitive information of end-devices. To address the aforementioned limitations, a dispersed federated learning (DFL) framework for autonomous driving cars is proposed to offer robust, communication resource-efficient, and privacy-aware learning. A mixed-integer non-linear (MINLP) optimization problem is formulated to jointly minimize the loss in federated learning model accuracy due to packet errors and transmission latency. Due to the NP-hard and non-convex nature of the formulated MINLP problem, we propose the Block Successive Upper-bound Minimization (BSUM) based solution. Furthermore, the performance comparison of the proposed scheme with three baseline schemes has been carried out. Extensive numerical results are provided to show the validity of the proposed BSUM-based scheme.

cs.NI

Latency-sensitive Service Delivery with UAV-Assisted 5G Networks

In this letter, a novel framework to deliver critical spread out URLLC services deploying unmanned aerial vehicles (UAVs) in an out-of-coverage area is developed. To this end, the resource optimization problem, i.e., resource blocks (RBs) and power allocation, and optimal UAV deployment strategy are studied for UAV-assisted 5G networks to jointly maximize the average sum-rate and minimize the transmit power of UAV while satisfying the URLLC requirements. To cope with the sporadic URLLC traffic problem, an efficient online URLLC traffic prediction model based on Gaussian Process Regression (GPR) is proposed which derives optimal URLLC scheduling and transmit power strategy. The formulated problem is revealed as a mixed-integer nonlinear programming (MINLP), which is solved following the introduced successive minimization algorithm. Finally, simulation results are provided to show our proposed solution approach's efficiency.

cs.NI

Energy-Efficient Resource Allocation in Multi-UAV-Assisted Two-Stage Edge Computing for Beyond 5G Networks

Unmanned aerial vehicle (UAV)-assisted multi-access edge computing (MEC) has become one promising solution for energy-constrained devices to meet the computation demand and the stringent delay requirement. In this work, we investigate a multiple UAVs-assisted two-stage MEC system in which the computation-intensive and delay-sensitive tasks of mobile devices (MDs) are cooperatively executed on both MEC-enabled UAVs and terrestrial base station (TBS) attached with the MEC server. Specifically, UAVs provide the computing and relaying services to the mobile devices. In this regard, we formulate a joint task offloading, communication and computation resource allocation problem to minimize the energy consumption of MDs and UAVs by considering the limited communication resources for the uplink transmission, the computation resources of UAVs and the tolerable latency of the tasks. The formulated problem is a mixed-integer non-convex problem which is NP hard. Thus, we relax the channel assignment variable from the binary to continuous values. However, the problem is still non-convex due to the coupling among the variables. To solve the formulated optimization problem, we apply the Block Successive Upper-bound Minimization (BSUM) method which guarantees to obtain the stationary points of the non-convex objective function. In essence, the non-convex objective function is decomposed into multiple subproblems which are then solved in a block-by-block manner. Finally, the extensive evaluation results are conducted to show the superior performance of our proposed framework.

cs.NI

Intelligent Resource Slicing for eMBB and URLLC Coexistence in 5G and Beyond: A Deep Reinforcement Learning Based Approach

In this paper, we study the resource slicing problem in a dynamic multiplexing scenario of two distinct 5G services, namely Ultra-Reliable Low Latency Communications (URLLC) and enhanced Mobile BroadBand (eMBB). While eMBB services focus on high data rates, URLLC is very strict in terms of latency and reliability. In view of this, the resource slicing problem is formulated as an optimization problem that aims at maximizing the eMBB data rate subject to a URLLC reliability constraint, while considering the variance of the eMBB data rate to reduce the impact of immediately scheduled URLLC traffic on the eMBB reliability. To solve the formulated problem, an optimization-aided Deep Reinforcement Learning (DRL) based framework is proposed, including: 1) eMBB resource allocation phase, and 2) URLLC scheduling phase. In the first phase, the optimization problem is decomposed into three subproblems and then each subproblem is transformed into a convex form to obtain an approximate resource allocation solution. In the second phase, a DRL-based algorithm is proposed to intelligently distribute the incoming URLLC traffic among eMBB users. Simulation results show that our proposed approach can satisfy the stringent URLLC reliability while keeping the eMBB reliability higher than 90%.

cs.NI

Coexistence Mechanism between eMBB and uRLLC in 5G Wireless Networks

uRLLC and eMBB are two influential services of the emerging 5G cellular network. Latency and reliability are major concerns for uRLLC applications, whereas eMBB services claim for the maximum data rates. Owing to the trade-off among latency, reliability and spectral efficiency, sharing of radio resources between eMBB and uRLLC services, heads to a challenging scheduling dilemma. In this paper, we study the co-scheduling problem of eMBB and uRLLC traffic based upon the puncturing technique. Precisely, we formulate an optimization problem aiming to maximize the MEAR of eMBB UEs while fulfilling the provisions of the uRLLC traffic. We decompose the original problem into two sub-problems, namely scheduling problem of eMBB UEs and uRLLC UEs while prevailing objective unchanged. Radio resources are scheduled among the eMBB UEs on a time slot basis, whereas it is handled for uRLLC UEs on a mini-slot basis. Moreover, for resolving the scheduling issue of eMBB UEs, we use PSUM based algorithm, whereas the optimal TM is adopted for solving the same problem of uRLLC UEs. Furthermore, a heuristic algorithm is also provided to solve the first sub-problem with lower complexity. Finally, the significance of the proposed approach over other baseline approaches is established through numerical analysis in terms of the MEAR and fairness scores of the eMBB UEs.

cs.NI

Radio Resource Allocation in 5G New Radio: A Neural Networks Based Approach)

The minimum frequency-time unit that can be allocated to User Equipments (UEs) in the fifth generation (5G) cellular networks is a Resource Block (RB). A RB is a channel composed of a set of OFDM subcarriers for a given time slot duration. 5G New Radio (NR) allows for a large number of block shapes ranging from 15 kHz to 480 kHz. In this paper, we address the problem of RBs allocation to UEs. The RBs are allocated at the beginning of each time slot based on the channel state of each UE. The problem is formulated based on the Generalized Proportional Fair (GPF) scheduling. Then, we model the problem as a 2-Dimension Hopfield Neural Networks (2D-HNN). Finally, in an attempt to solve the problem, the energy function of 2D-HNN is investigated. Simulation results show the efficiency of the proposed approach.

cs.NI

Hybrid Compression Techniques for EEG Data Based on Lossy/Lossless Compression Algorithms

The recorded Electroencephalography (EEG) data comes with a large size due to the high sampling rate. Therefore, large space and more bandwidth are required for storing and transmitting the EEG data. Thus, preprocessing and compressing the EEG data is a very important part in order to transmit and store it efficiently with less bandwidth and less space. The objective of this paper is to develop an efficient system for EEG data compression. In this system, the recorded EEG data are firstly preprocessed in the preprocessing unit. Standardization and segmentation of EEG data are done in this unit. Then, the resulting EEG data are passed to the compression unite. The compression unit composes of a lossy compression algorithm followed by a lossless compression algorithm. The lossy compression algorithm transforms the randomness EEG data into data with high redundancy. Subsequently, A lossless compression algorithm is added to investigate the high redundancy of the resulting data to get high Compression Ratio (CR) without any additional loss. In this paper, the Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are proposed as a lossy compression algorithm. Furthermore, Arithmetic Encoding and Run Length Encoding (RLE) are proposed as a lossless compression algorithm. We calculate the total compression and reconstruction time (T), Root Mean Square Error (RMSE), and CR in order to evaluate the proposed system. Simulation results show that adding RLE after the DCT algorithm gives the best performance in terms of compression ratio and complexity. Using the DCT as a lossy compression algorithm followed by the RLE as a lossless compression algorithm gives CR=90% at RMSE=0.14 and more than 95% of CR at RMSE=0.2.

eess.SP

eMBB-URLLC Resource Slicing: A Risk-Sensitive Approach

Ultra Reliable Low Latency Communication (URLLC) is a 5G New Radio (NR) application that requires strict reliability and latency. URLLC traffic is usually scheduled on top of the ongoing enhanced Mobile Broadband (eMBB) transmissions (i.e., puncturing the current eMBB transmission) and cannot be queued due to its hard latency requirements. In this letter, we propose a risk-sensitive based formulation to allocate resources to the incoming URLLC traffic while minimizing the risk of the eMBB transmission (i.e., protecting the eMBB users with low data rate) and ensuring URLLC reliability. Specifically, the Conditional Value at Risk (CVaR) is introduced as a risk measure for eMBB transmission. Moreover, the reliability constraint of URLLC is formulated as a chance constraint and relaxed based on Markov's inequality. We decompose the formulated problem into two subproblems in order to transform it into a convex form and then alternatively solve them until convergence. Simulation results show that the proposed approach allocates resources to the incoming URLLC traffic efficiently while satisfying the reliability of both eMBB and URLLC.

cs.NI