Literature Database Entry
wahb2026asynchronous
Sama Wahb, Ahmed El-Mahdy and Falko Dressler, "Asynchronous 2-layer Full-duplex Cooperative RSMA with Imperfect Channel State Information and Imperfect Successive Interference Cancellation," Computers and Electrical Engineering, vol. 136, pp. 111226, August 2026.
Abstract
Sixth-generation (6G) wireless systems require advanced multiple access techniques capable of delivering high data rates, low latency, and robust performance under practical impairments. Rate-Splitting Multiple Access (RSMA) has emerged as a strong candidate due to its efficient interference management and robustness to imperfect Channel State Information (CSI). However, its performance is often limited by the weakest user, and existing cooperative approaches mainly rely on half-duplex relaying and ideal assumptions. In this paper, a downlink full-duplex multi-user 2-layer cooperative RSMA (C-RSMA) framework is proposed under asynchronous reception, imperfect CSI, and imperfect Successive Interference Cancellation (SIC). The 2-layer structure enhances interference mitigation and fairness, while full-duplex relaying improves spectral efficiency. An alternative optimization technique based on Weighted Minimum Mean Square Error (WMMSE) is used to jointly optimize precoding, rate allocation, and relay power to maximize the minimum user rate under latency constraints. Numerical results show that the proposed scheme enhances fairness and robustness over other schemes.
Quick access
Original Version
(at publishers web site)
Authors' Version
(PDF on this web site)
BibTeX ![]()
Contact
Sama Wahb
Ahmed El-Mahdy
Falko Dressler
BibTeX reference
@article{wahb2026asynchronous,
author = {Wahb, Sama and El-Mahdy, Ahmed and Dressler, Falko},
doi = {10.1016/j.compeleceng.2026.111226},
title = {{Asynchronous 2-layer Full-duplex Cooperative RSMA with Imperfect Channel State Information and Imperfect Successive Interference Cancellation}},
pages = {111226},
journal = {Computers and Electrical Engineering},
publisher = {Elsevier},
month = {8},
volume = {136},
year = {2026},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
This page was automatically generated using BibDB and bib2web.





