SearcharxivSearch

arXiv subjects

Sanaa Sharafeddine

Publications and source records attributed to Sanaa Sharafeddine.

At least 19 recordsLinked to original sources

Joint Beamforming and Antenna Placement Optimization in Pinching Antenna Systems with User Mobility: A Deep Reinforcement Learning Approach

Recently, the pinching antenna systems (PASS) have attracted significant attention due to their ability to exploit dynamically reconfigurable pinching points along waveguides for flexible signal transmission. However, existing work largely overlooks user mobility although the optimal pinching configuration is highly dependent on the user's location and must be continuously adjusted. In this work, we investigate a PASS-enabled system model in which a base station (BS) serves a mobile user. We formulate an optimization problem that aims to maximize the user's average sum rate over a predefined time horizon while satisfying quality-of-service (QoS) constraint. This objective is achieved by jointly optimizing the beamforming vector at the BS and the pinching locations along the waveguides. Nevertheless, the resulting problem is highly non-convex and challenging to solve using conventional optimization techniques due to the intricate coupling among variables. The difficulty is further exacerbated by environmental randomness arising from user mobility and a probabilistic blockage model. This reveals a key engineering challenge: the performance gains of PASS critically rely on the ability to track or predict user trajectories in real time. To address these challenges, we adopt a deep deterministic policy gradient (DDPG) approach within a reinforcement learning framework, which is well-suited for continuous state and action spaces. Finally, extensive simulations are conducted to validate the proposed approach and demonstrate the importance of real-time configurability.

eess.SP

Meta-Learning Driven Movable-Antenna-assisted Full-Duplex RSMA for Multi-User Communication: Performance and Optimization

Full-duplex (FD) radios at base station (BS) have gained significant interest because of their ability to simultaneously transmit and receive signals on the same frequency band. However, FD communication is hindered by self-interference (SI) and intra-cell interference caused by simultaneous uplink (UL) transmissions affecting downlink (DL) reception. These interferences significantly limit the ability to fully exploit FD's potential. Recently, movable antenna (MA) technology has emerged as a groundbreaking innovation, offering an effective way to mitigate interference by adjusting the position of each MA within the transmitter or receiver region. This dynamic repositioning allows MAs to move away from high-interference zones to areas with minimal interference, thereby enhancing multiplexing gain and improving spectral efficiency (SE). In light of this, in this paper, we investigate an FD communication system by integrating it with MAs to evaluate and investigate its effectiveness in handling SI and intra-cell interference. Moreover, we utilize rate-splitting multiple access (RSMA) as our multiple access technique in both UL and DL transmission. To achieve the full potential of the system, we evaluated three different scenarios with FD-BS-RSMA with MAs where our goal is to maximize the total sum rate of the system by jointly optimizing the transmitting and receiving beamforming vectors, UL user equipment (UE) transmission power, MA positions, and common stream split ratio of RSMA while satisfying the minimum data rate requirements of all UEs, common stream constraint, power budget requirements of BS and UL UEs, and inter-MA distance. The formulated optimization problem is highly non-convex in nature, and hence, we propose a gradient-based meta-learning (GML) approach which can handle the non-convexity in a discrete manner by optimizing each variable in a different neural network.

eess.SY

Joint Uplink and Downlink Resource Allocation and Antenna Activation for Pinching Antenna Systems

In this paper, we explore a novel joint uplink and downlink framework utilizing a pinching antenna system (PASS). We consider two waveguides, one dedicated to transmission and one to reception, and both of them are connected to a base station (BS). Each type of waveguide consists of several pinching antennas (PAs) in some preconfigured positions. In this framework, we assume the BS can serve downlink and uplink user equipments (UEs) at the same time using the same spectrum resources through the presented PASS. In this aspect, we formulate a sum rate optimization problem that jointly optimizes the antenna activation factor, the BS transmit power, and the UE's transmit power, subject to power budget constraints for the BS and the UEs, as well as minimum rate requirements for the UEs. The formulated problem is highly non-convex and difficult to solve directly. Hence, we divide the main problem into two sub-problems: the antenna activation sub-problem and the power allocation sub-problem. Then, we solve the antenna activation problem utilizing a distance and spatial correlation-based algorithm. Meanwhile, the resource allocation problem is solved using a successive convex approximation (SCA)-based algorithm. Numerical results show that our proposed framework can achieve around 60-90\% performance gains over its time division duplex (TDD) where the uplink and downlink transmissions are served in different orthogonal time slots.

eess.SP

Coordinated Multipoint Transmission in Pinching Antenna Systems

We study a coordinated multi-point (CoMP) transmission where two base stations (BSs), each supported by a pinching antenna system (PASS), are deployed to jointly serve communication users under spatial division multiple access (SDMA) technology. Pinching Antenna technology was introduced as a promising solution to overcome the large-scale fading that has been shown to be an impediment in multiple-input multiple-output (MIMO) systems. To realize the advantages of this technology in CoMP systems, which suffer from an upperbound rate limitation when traditional uniform linear arrays (ULAs) are adopted, we formulate an optimization problem with the aim of maximizing the achievable sum rate by jointly determining the transmit beamforming vectors and pinching locations on the waveguides while respecting the quality of service (QoS) requirements of users. This problem is inherently non-convex due to the strong coupling among its decision parameters, making it challenging to solve using traditional optimization methods. Thus, we utilize a gradient-based meta-learning (GML) strategy specifically designed for large-scale optimization tasks. Finally, numerical analysis demonstrates the effectiveness of the proposed GML approach, achieving 92 percent of the optimal solution, and the superiority of the solution presented compared to other benchmarks. In addition, it achieves a higher upper bound on the achievable rate compared to conventional CoMP systems.

eess.SP

Meta-Learning-Driven Resource Optimization in Full-Duplex ISAC with Movable Antennas

This paper investigates a full-duplex (FD) scenario where a base station (BS) equipped with movable antennas (MAs) simultaneously provides communication services to a set of downlink (DL) and uplink (UL) users while also enabling sensing functionalities for target detection, thereby supporting integrated sensing and communication (ISAC) technology. Additionally, a receiving BS, also equipped with MAs (denoted as BS R), is responsible for capturing the reflected echo. To optimize this setup, we formulate an optimization problem aimed at maximizing the signal-to-noise and interference ratio (SINR) of the captured echo. This is achieved by jointly optimizing the transmit beamforming vectors at the FD BS, the receiving beamforming vectors at both the FD BS and BS R, the UL users' transmit power, and the MAs' positions at both BSs, all while satisfying the quality-of-service (QoS) requirements for both sensing and communication. Given the non-convex nature of the problem and the high coupling between the variables, we employ a gradient-based meta-learning (GML) approach tailored for large-scale optimization. Numerical results demonstrate the effectiveness of the proposed meta-learning approach, achieving results within 99% of the optimal solution. Furthermore, the MA-based scheme outperforms several benchmark approaches, highlighting its advantages in practical ISAC applications.

eess.SP

A UAV-Aided Digital Twin Framework for IoT Networks with High Accuracy and Synchronization

With the continued growth of its core technologies, including the Internet of Things (IoT), artificial intelligence (AI), Big Data and data analytics, and edge computing, digital twin (DT) technology has witnessed a significant increase in industrial applications, helping the industry become more sustainable, smart, and adaptable. Hence, DT technology has emerged as a promising link between the physical and virtual worlds, enabling simulation, prediction, and real-time performance optimization. This work aims to explore the development of a high-fidelity digital twin framework, focusing on synchronization and accuracy between physical and digital systems to enhance data-driven decision making. To achieve this, we deploy several stationary UAVs in optimized locations to collect data from industrial IoT devices, which were used to monitor multiple physical entities and perform computations to evaluate their status. We consider a practical setup in which multiple IoT devices may monitor a single physical entity, and as a result, the measurements are combined and processed together to determine the status of the physical entity. The resulting status updates are subsequently uploaded from the UAVs to the base station, where the DT resides. In this work, we consider a novel metric based on the Age of Information (AoI), coined as the Age of Digital Twin (AoDT), to reflect the status freshness of the digital twin. Factoring AoDT in the problem formulation ensures that the DT reliably mirrors the physical system with high accuracy and synchronization. We formulate a mixed-integer non-convex program to maximize the total amount of data collected from all IoT devices while ensuring a constrained AoDT. Using successive convex approximations, we solve the problem, conduct extensive simulations and compare the results with baseline approaches to demonstrate the effectiveness of the proposed solution.

cs.ET

Enhancing CoMP-RSMA Performance with Movable Antennas: A Meta-Learning Optimization Framework

This study investigates a downlink rate-splitting multiple access (RSMA) scenario in which multiple base stations (BSs), employing a coordinated multi-point (CoMP) transmission scheme, serve users equipped with movable antenna (MA) technology. Unlike traditional fixed-position antennas (FPAs), which are subject to random variations in wireless channels, MAs can be strategically repositioned to locations with more favorable channel conditions, thereby achieving enhanced spatial diversity gains.To leverage these advantages and maximize the achievable sum rate, we formulate an optimization problem that jointly determines the optimal transmit beamforming vectors at the BSs, the common stream allocation for different users, and the optimal positioning of the MAs, all while ensuring compliance with quality of service (QoS) constraints. However, the formulated problem is non-convex and computationally challenging due to the strong interdependence among the optimization variables. Traditional methods for solving large-scale optimization problems typically incur prohibitively high computational complexity. To address the above challenge, we propose a gradient-based meta-learning (GML) algorithm that operates without pre-training and is well-suited for handling large-scale optimization tasks. Numerical results demonstrate the effectiveness and accuracy of the proposed approach, achieving near-optimal performance (exceeding 97% compared to the optimal solution). Moreover, the MA-enabled CoMP-RSMA model significantly outperforms conventional benchmark schemes, yielding performance gains of up to 190% over the spatial division multiple access (SDMA) scheme and 80% over the RSMA FPA-based model. Finally, the proposed approach is shown to mitigate the sum-rate limitations imposed by interference in SDMA, achieving superior performance with fewer BSs.

eess.SP

Gradient-Based Meta Learning for Uplink RSMA with Beyond Diagonal RIS

Beyond diagonal reconfigurable intelligent surface (BD-RIS) has emerged as an innovative and generalized RIS framework that provides greater flexibility in wave manipulation and enhanced coverage. In comparison to conventional RIS, optimization of BD-RIS is more challenging due to the large number of optimization variables associated with it. Typically, optimization of large-scale optimization problems utilizing traditional optimization methods results in high complexity. To tackle this issue, we propose a gradient-based meta learning algorithm which works without pre-training and is able to solve large-scale optimization problems. With the objective to maximize the sum rate of the system, to the best of our knowledge, this is the first work considering joint optimization of receiving beamforming vectors at the base station (BS), scattering matrix of BD-RIS and transmission power of users equipment (UEs) in uplink rate-splitting multiple access (RSMA) communication. Numerical results demonstrate that our proposed scheme can outperform the conventional RIS RSMA framework by 22.5$\%$.

eess.SP

Optimizing Downlink C-NOMA Transmission with Movable Antennas: A DDPG-based Approach

This paper analyzes a downlink C-NOMA scenario where a base station (BS) is deployed to serve a pair of users equipped with movable antenna (MA) technology. The user with better channel conditions with the BS will be able to transmit the signal to the other user providing an extra transmission resource and enhancing performance. Both users are equipped with a receiving MA each and a transmitting MA for the relaying user. In this regard, we formulate an optimization problem with the objective of maximizing the achievable sum rate by jointly determining the beamforming vector at the BS, the transmit power at the device and the positions of the MAs while meeting the quality of service (QoS) constraints. Due to the non-convex structure of the formulated problem and the randomness in the channels we adopt a deep deterministic policy gradient (DDPG) approach, a reinforcement learning (RL) algorithm capable of dealing with continuous state and action spaces. Numerical results demonstrate the superiority of the presented model compared to the other benchmark schemes showing gains reaching 45% compared to the NOMA enabled MA scheme and 60% compared to C-NOMA model with fixed antennas. The solution approach showed 93% accuracy compared to the optimal solution.

eess.SY

Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation

This paper investigates joint user pairing, power and time slot duration allocation in the uplink multiple-input single-output (MISO) multi-user cooperative rate-splitting multiple access (C-RSMA) networks in half-duplex (HD) mode. We assume two types of users: cell-center users (CCU) and cell-edge users (CEU); first, we propose a user pairing scheme utilizing a semi-orthogonal user selection (SUS) and a matching-game (MG)-based approach where the SUS algorithm is used to select CCU in each pair which assists in reducing inter-pair interference (IPI). Afterward, the CEU in each pair is selected by considering the highest channel gain between CCU and CEU. After pairing is performed, the communication takes place in two phases: in the first phase, in a given pair, CEUs broadcast their signal, which is received by the base station (BS) and CCUs. In the second phase, in a given pair, the CCU decodes the signal from its paired CEU, superimposes its own signal, and transmits it to the BS. We formulate a joint optimization problem in order to maximize the sum rate subject to the constraints of the power budget of the user equipment (UE) and Quality of Service (QoS) requirements at each UE. Since the formulated optimization problem is non-convex, we adopt a bi-level optimization to make the problem tractable. We decompose the original problem into two sub-problems: the user pairing sub-problem and the resource allocation sub-problem where user pairing sub-problem is independent of resource allocation sub-problem and once pairs are identified, resource allocation sub-problem is solved for a given pair. Resource allocation sub-problem is solved by invoking a successive convex approximation (SCA)-based approach. Simulation results demonstrate that the proposed SUS-MG-based algorithm with SCA outperforms other conventional schemes.

eess.SP

Multi-IRS Aided Mobile Edge Computing for High Reliability and Low Latency Services

Although multi-access edge computing (MEC) has allowed for computation offloading at the network edge, weak wireless signals in the radio access network caused by obstacles and high network load are still preventing efficient edge computation offloading, especially for user requests with stringent latency and reliability requirements. Intelligent reflective surfaces (IRS) have recently emerged as a technology capable of enhancing the quality of the signals in the radio access network, where passive reflecting elements can be tuned to improve the uplink or downlink signals. Harnessing the IRS's potential in enhancing the performance of edge computation offloading, in this paper, we study the optimized use of a system of multi-IRS along with the design of the offloading (to an edge with multi MECs) and resource allocation parameters for the purpose of minimizing the devices' energy consumption considering 5G services with stringent latency and reliability requirements. After presenting our non-convex mathematical problem, we propose a suboptimal solution based on alternating optimization where we divide the problem into sub-problems which are then solved separately. Specifically, the offloading decision is solved through a matching game algorithm, and then the IRS phase shifts and resource allocation optimizations are solved in an alternating fashion using the Difference of Convex approach. The obtained results demonstrate the gains both in energy and network resources and highlight the IRS's influence on the design of the MEC parameters.

eess.SP

Energy Consumption Optimization in RIS-Assisted Cooperative RSMA Cellular Networks

This paper presents a downlink reconfigurable intelligent surface (RIS)-assisted half-duplex (HD) cooperative rate splitting multiple access (C-RSMA) networks. The proposed system model is built up considering one base station (BS), one RIS, and two users. With the goal of minimizing the network energy consumption, a joint framework to optimize the precoding vectors at the BS, common stream split, relaying device transmit power, the time slot allocation, and the passive beamforming at the RIS subject to the power budget constraints at both the BS and the relaying node, the quality of service (QoS) constraints at both users, and common stream rate constraint is proposed. The formulated problem is a non-convex optimization problem due to the high coupling among the optimization variables. To tackle this challenge, an efficient algorithm is presented by invoking the alternating optimization technique, which decomposes the original problem into two sub-problems; namely, sub-problem-1 and sub-problem-2, which are alternatively solved. Specifically, sub-problem-1 is to jointly optimize the precoding vectors, common stream split, and relaying device power. Meanwhile, sub-problem-2 is to optimize the phase shift matrix at the RIS. In order to solve sub-problem-1, an efficient low-complexity solution based on the successive convex approximation (SCA) is proposed. Meanwhile, and with the aid of difference-of-convex rank-one representation and the SCA approach, an efficient solution for the phase shift matrix at the RIS is obtained. The simulation results demonstrate that the proposed RIS-assisted HD C-RSMA achieves a significant gain in minimizing the total energy consumption compared to the RIS-assisted RSMA scheme, RIS-assisted HD cooperative non-orthogonal multiple access (C-NOMA), RIS-assisted NOMA, HD C-RSMA without RIS, and HD C-NOMA without RIS.

cs.IT

RIS-Assisted UAV for Timely Data Collection in IoT Networks

Intelligent Transportation Systems are thriving thanks to a wide range of technological advances, namely 5G communications, Internet of Things, artificial intelligence and edge computing. Central to this is the wide deployment of smart sensing devices and accordingly the large amount of harvested information to be processed for timely decision making. Robust network access is, hence, essential for offloading the collected data before a set deadline, beyond which the data loses its value. In environments where direct communication can be impaired by, for instance, blockages such as in urban cities, unmanned aerial vehicles (UAVs) can be considered as an alternative for providing and enhancing connectivity, particularly when IoT devices (IoTD) are constrained with their resources. Also, to conserve energy, IoTDs are assumed to alternate between their active and passive modes. This paper, therefore, considers a time-constrained data gathering problem from a network of sensing devices and with assistance from a UAV. A Reconfigurable Intelligent Surface (RIS) is deployed to further improve both the connectivity and energy efficiency of the UAV, particularly when multiple devices are served concurrently and experience different channel impairments. This integrated problem brings challenges related to the configuration of the phase shift elements of the RIS, the scheduling of IoTDs transmissions as well as the trajectory of the UAV. First, the problem is formulated with the objective of maximizing the total number of served devices each during its activation period. Owing to its complexity and the incomplete knowledge about the environment, we leverage deep reinforcement learning in our solution; the UAV trajectory planning is modeled as a Markov Decision Process, and Proximal Policy Optimization is invoked to solve it. Next, the RIS configuration is then handled via Block Coordinate Descent.

eess.IV

ABET Accreditation: A Way Forward for PDC Education

With parallel and distributed computing (PDC) now wide-spread, modern computing programs must incorporate PDC within the curriculum. ACM and IEEE Computer Society's Computer Science curricular guidelines have recommended exposure to PDC concepts since 2013. More recently, a variety of initiatives have made PDC curricular content, lectures, and labs freely available for undergraduate computer science programs. Despite these efforts, progress in ensuring computer science students graduate with sufficient PDC exposure has been uneven. This paper discusses the impact of ABET's revised criteria that have required exposure to PDC to achieve accreditation for computer science programs since 2018. The authors reviewed 20 top ABET-accredited computer science programs and analyzed how they covered the required PDC components in their curricula. Using their own institutions as case studies, the authors examine in detail how three different ABET-accredited computer science programs covered PDC using different approaches, yet meeting the PDC requirements of these ABET criteria. The paper also shows how ACM/IEEE Computer Society curricular guidelines for computer engineering and software engineering programs, along with ABET accreditation criteria, can cover PDC.

cs.DC

Reconfigurable Intelligent Surface Enabled Vehicular Communication: Joint User Scheduling and Passive Beamforming

Given its ability to control and manipulate wireless environments, reconfigurable intelligent surface (RIS), also known as intelligent reflecting surface (IRS), has emerged as a key enabler technology for the six-generation (6G) cellular networks. In the meantime, vehicular environment radio propagation is negatively influenced by a large set of objects that cause transmission distortion such as high buildings. Therefore, this work is devoted to explore the area of RIS technology integration with vehicular communications while considering the dynamic nature of such communication environment. Specifically, we provide a system model where RoadSide Unit (RSU) leverages RIS to provide indirect wireless transmissions to disconnected areas, known as dark zones. Dark zones are spots within RSU coverage where the communication links are blocked due to the existence of blockages. In details, a discrete RIS is utilized to provide communication links between the RSU and the vehicles passing through out-of-service zones. Therefore, the joint problem of RSU resource scheduling and RIS passive beamforming or phase-shift matrix is formulated as an optimization problem with the objective of maximizing the minimum average bit rate. The formulated problem is mixed integer non-convex program which is difficult to be solved and does not account for the uncertain dynamic environment in vehicular networks. Thereby, we resort to alternative methods based on Deep Reinforcement Learning to determine RSU wireless scheduling and Block Coordinate Descent (BCD) to solve for the phase-shift matrix, \textit{i.e.,} passive beamforming, of the RIS. The Markov Decision Process (MDP) is defined and the complexity of the solution approach is discussed. Our numerical results demonstrate the superiority of our proposed approach over baseline techniques.

eess.SP

Optimizing Age of Information Through Aerial Reconfigurable Intelligent Surfaces: A Deep Reinforcement Learning Approach

We investigate the benefits of integrating unmanned aerial vehicles (UAVs) with reconfigurable intelligent surface (RIS) elements to passively relay information sampled by Internet of Things devices (IoTDs) to the base station (BS). In order to maintain the freshness of relayed information, an optimization problem with the objective of minimizing the expected sum Age-of-Information (AoI) is formulated to optimize the altitude of the UAV, the communication schedule, and phases-shift of RIS elements. In the absence of prior knowledge of the activation pattern of the IoTDs, proximal policy optimization algorithm is developed to solve this mixed-integer non-convex optimization problem. Numerical results show that our proposed algorithm outperforms all others in terms of AoI.

eess.SP

A Low-Complexity Framework for Joint User Pairing and Power Control for Cooperative NOMA in 5G and Beyond Cellular Networks

This paper investigates the performance of cooperative non-orthogonal multiple access (C-NOMA) in a cellular downlink system. The system model consists of a base station (BS) serving multiple users, where users with good channel quality can assist the transmissions between the BS and users with poor channel quality through either half-duplex (HD) or full-duplex (FD) device-to-device (D2D) communications. We formulate and solve a novel optimization problem that jointly determines the optimal D2D user pairing and the optimal power control scheme, where the objective is maximizing the achievable sum rate of the whole system while guaranteeing a certain quality of service (QoS) for all users. The formulated problem is a mixed-integer non-linear program (MINLP) which is generally NPhard. To overcome this issue, we reconstruct the original problem into a bi-level optimization problem that can be decomposed into two sub-problems to be solved independently. The outer problem is a linear assignment problem which can be efficiently handled by the well-known Hungarian method. The inner problem is still a non-convex optimization problem for which finding the optimal solution is challenging. However, we derive the optimal power control policies for both the HD and the FD schemes in closedform expressions, which makes the computational complexity of the inner problems polynomial for every possible pairing configurations. These findings solve ultimately the original MILNP in a timely manner that makes it suitable for real-time and low latency applications. Our simulation results show that the proposed framework outperforms a variety of proposed schemes in the literature and that it can obtain the optimal pairing and power control policies for a network with 100 users in a negligible computational time.

eess.SP

On-Demand Deployment of Multiple Aerial Base Stations for Traffic Offloading and Network Recovery

Unmanned aerial vehicles (UAVs) are being utilized for a wide spectrum of applications in wireless networks leading to attractive business opportunities. In the case of abrupt disruption to existing cellular network operation or infrastructure, e.g., due to an unexpected surge in user demand or a natural disaster, UAVs can be deployed to provide instant recovery via temporary wireless coverage in designated areas. A major challenge is to determine efficiently how many UAVs are needed and where to position them in a relatively large 3D search space. To this end, we formulate the problem of 3D deployment of a fleet of UAVs as a mixed integer linear program, and present a greedy approach that mimics the optimal behavior assuming a grid composed of a finite set of possible UAV locations. In addition, we propose and evaluate a novel low complexity algorithm for multiple UAV deployment in a continuous 3D space, based on an unsupervised learning technique that relies on the notion of electrostatics with repulsion and attraction forces. We present performance results for the proposed algorithm as a function of various system parameters and demonstrate its effectiveness compared to the close-to-optimal greedy approach and its superiority compared to recent related work from the literature.

cs.NI