Modeling and Optimization for Flexible Cylindrical Arrays-Enabled Wireless Communications

Flexible-geometry arrays have garnered much attention in wireless communications, which dynamically adjust wireless channels to improve the system performance. In this paper, we propose a novel flexible-geometry array for a $360^\circ$ coverage, named flxible cylindrical array (FCLA), comprised of multiple flexible circular arrays (FCAs). The elements in each FCA can revolve around the circle track to change their horizontal positions, and the FCAs can move along the vertical axis to change the elements' heights. Considering that horizontal revolving can change the antenna orientation, we adopt both the omni-directional and the directional antenna patterns. Based on the regularized zero-forcing (RZF) precoding scheme, we formulate a particular compressive sensing (CS) problem incorporating joint precoding and antenna position optimization, and propose two effective methods, namely FCLA-J and FCLA-A, to solve it. Specifically, the first method involves jointly optimizing the element's revolving angle, height, and precoding coefficient within a single CS framework. The second method decouples the CS problem into two subproblems by utilizing an alternative sparse optimization approach for the revolving angle and height, thereby reducing time complexity. Simulation results reveal that, when utilizing directional radiation patterns, FCLA-J and FCLA-A achieve substantial performance improvements of 43.32\% and 25.42\%, respectively, compared to uniform cylindrical arrays (UCLAs) with RZF precoding.

Beamforming for Movable and Rotatable Antenna Enabled Multi-User Communications

In the development of wireless communication technology, multiple-input multiple-output (MIMO) technology has emerged as a key enabler, significantly enhancing the capacity of communication systems. However, traditional MIMO systems, which rely on fixed-position antennas (FPAs) with spacing limitations, cannot fully exploit the channel variations in the continuous spatial domain, thus limiting the system's spatial multiplexing performance and diversity. To address these limitations, movable antennas (MAs) have been introduced, offering a breakthrough in signal processing and spatial multiplexing by overcoming the constraints of FPA-based systems. Furthermore, this paper extends the functionality of MAs by introducing movable rotatable antennas (MRAs), which enhance the system's ability to optimize performance in the spatial domain by adding rotational degrees of freedom. By incorporating a dynamic precoding framework based on both antenna position and rotation angle optimization, and employing the zero-forcing (ZF) precoding method, this paper proposes an efficient optimization approach aimed at improving signal quality, mitigating interference, and solving the non-linear, constrained optimization problem using the sequential quadratic programming (SQP) algorithm. This approach effectively enhances the communication system's performance.

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.

Beyond Diagonal RIS for ISAC Network: Statistical Analysis and Network Parameter Estimation

This paper investigates the use of beyond diagonal reconfigurable intelligent surface (BD-RIS) with $N$ elements to advance integrated sensing and communication (ISAC). We address a key gap in the statistical characterizations of the radar signal-to-noise ratio (SNR) and the communication signal-to-interference-plus-noise ratio (SINR) by deriving tractable closed-form cumulative distribution functions (CDFs) for these metrics. Our approach maximizes the radar SNR by jointly configuring radar beamforming and BD-RIS phase shifts. Subsequently, zero-forcing is adopted to mitigate user interference, enhancing the communication SINR. To meet ISAC outage requirements, we propose an analytically-driven successive non-inversion sampling (SNIS) algorithm for estimating network parameters satisfying network outage constraints. Numerical results illustrate the accuracy of the derived CDFs and demonstrate the effectiveness of the proposed SNIS algorithm.

Latency Minimization for Movable Antennas-Enabled Relay-aided D2D Mobile Edge Computing Communication Systems

Device-to-device (D2D)-assisted mobile edge computing (MEC) is one of the critical technologies of future sixth generation (6G) networks. The core of D2D-assisted MEC is to reduce system latency for network edge UEs by supporting cloud computing services, thereby achieving high-speed transmission. Due to the sensitivity of communication signals to obstacles, relaying is adopted to enhance the D2D-assisted MEC system's performance and its coverage area. However, relay nodes and the base station (BS) are typically equipped with large-scale antenna arrays. This increases the cost of relay-assisted D2D MEC systems and limits their deployment. Movable antenna (MA) technology is used to work around this limitation without compromising performance. Specifically, the core of MA technology lies in optimizing the antenna positions to increase system capacity. Therefore, this paper proposes a novel resource allocation scheme for MA-enhanced relay-assisted D2D MEC systems. Specifically, the MA positions and beamforming of user equipments (UEs), relay, and BS as well as the allocation of resources and the computation task offloading rate at the MEC server, all are optimized herein with the objective of minimizing the maximum latency while satisfying computation and communication rate constraints. Since this is a multivariable non-convex problem, a parallel and distributed penalty dual decomposition (PDD) based algorithm is developed and combined with successive convex approximation (SCA) to solve this non-convex problem. The results of extensive numerical analyses show that the proposed algorithm significantly improves the performance of the MA-enhanced relay-assisted D2D communication system compared to a counterpart where relays and the BS are equiped with traditional fixed-position antenna (FPA).

Power Source Allocation for RIS-aided Integrating Sensing, Communication, and Power Transfer Systems Based on NOMA

This paper proposes a novel communication system framework based on a reconfigurable intelligent surface (RIS)-aided integrated sensing, communication, and power transmission (ISCPT) communication system. RIS is used to improve transmission efficiency and sensing accuracy. In addition, non-orthogonal multiple access (NOMA) technology is incorporated in RIS-aided ISCPT systems to boost the spectrum utilization efficiency of RIS-aided ISCPT systems. We consider the power minimization problem of the RIS-aided ISCPT-NOMA system. Power minimization is achieved by jointly optimizing the RIS phase shift, decoding order, power splitting (PS) factor, and transmit beamforming while satisfying quality of service (QoS), radar target sensing accuracy, and energy harvesting constraints. Since the objective function and constraints in the optimization problem are non-convex, the problem is an NP-hard problem. To solve the non-convex problem, this paper proposes a block coordinate descent (BCD) algorithm. Specifically, the non-convex problem is divided into four sub-problems: i.e. the transmit beamforming, RIS phase shift, decoding order and PS factor optimization subproblems. We employ semidefinite relaxation (SDR) and successive convex approximation (SCA) techniques to address the transmit beamforming optimization sub-problem. Subsequently, we leverage the alternating direction method of multipliers (ADMM) algorithm to solve the RIS phase shift optimization problem. As for the decoding order optimization, we provide a closed-form expression. For the PS factor optimization problem, the SCA algorithm is proposed. Simulation results illustrate the effectiveness of our proposed algorithm and highlight the balanced performance achieved across sensing, communication, and power transfer.

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$\%$.

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.

Coordinated Half-Duplex/Full-Duplex Cooperative Rate-Splitting Multiple Access in Multi-Cell Networks

This paper explores downlink Cooperative Rate-Splitting Multiple Access (C-RSMA) in a multi-cell wireless network with the assistance of Joint-Transmission Coordinated Multipoint (JT-CoMP). In this network, each cell consists of a base station (BS) equipped with multiple antennas, one or more cell-center users (CCU), and multiple cell-edge users (CEU) located at the edge of the cells. Through JT-CoMP, all the BSs collaborate to simultaneously transmit the data to all the users including the CCUs and CEUs. To enhance the signal quality for the CEUs, CCUs relay the common stream to the CEUs by operating in either half-duplex (HD) or full-duplex (FD) decode-and-forward (DF) relaying mode. In this setup, we aim to jointly optimize the beamforming vectors at the BS, the allocation of common stream rates, the transmit power at relaying users, i.e., CCUs, and the time slot fraction, aiming to maximize the minimum achievable data rate. However, the formulated optimization problem is non-convex and is challenging to solve directly. To address this challenge, we employ change-of-variables, first-order Taylor approximations, and a low-complexity algorithm based on Successive Convex Approximation (SCA). We demonstrate through simulation results the efficacy of the proposed scheme, in terms of average achievable data rate, and we compare its performance to that of four baseline schemes, including HD/FD cooperative non-orthogonal multiple access (C-NOMA), NOMA, and RSMA without user cooperation. The results show that the proposed FD C-RSMA can achieve 25% over FD C-NOMA and the proposed HD C-RSMA can achieve 19% over HD C-NOMA respectively, when the BS transmit power is 20 dBm.

Extremely Large-Scale Dynamic Metasurface Antennas (XL-DMAs): Near-Field Modeling and Channel Estimation

Dynamic metasurface antennas (DMAs) represent a novel transceiver array architecture for extremely large-scale (XL) communications, offering the advantages of reduced power consumption and lower hardware costs compared to conventional arrays. This paper focuses on near-field channel estimation for XL-DMAs. We begin by analyzing the near-field characteristics of uniform planar arrays (UPAs) and introducing the Oblong Approx. model. This model decouples elevation-azimuth (EL-AZ) parameters for XL-DMAs, providing an effective means to characterize the near-field effect. It offers simpler mathematical expressions than the second-order Taylor expansion model, all while maintaining negligible model errors for oblong-shaped arrays. Building on the Oblong Approx. model, we propose an EL-AZ-decoupled estimation framework that involves near- and far-field parameter estimation for AZ/EL and EL/AZ directions, respectively. The former is formulated as a distributed compressive sensing problem, addressed using the proposed off-grid distributed orthogonal least squares algorithm, while the latter involves a straightforward parallelizable search. Crucially, we illustrate the viability of decoupled EL-AZ estimation for near-field UPAs, exhibiting commendable performance and linear complexity correlated with the number of metasurface elements. Moreover, we design an measurement matrix optimization method with the Lorentzian constraint on DMAs and highlight the estimation performance degradation resulting from this constraint.