Literature Database Entry
basaran2025gen-twin
Osman Tugay Basaran, Davide Villa, Pedram Johari, Michele Polese, Claudio Fiandrino, Falko Dressler and Tommaso Melodia, "Gen-TWIN: Generative-AI-Enabled Digital Twin for Open Radio Access Networks," Proceedings of 44th IEEE International Conference on Computer Communications (INFOCOM 2025), Digital Twins over NextG Wireless Networks (DTWin 2025), London, United Kingdom, May 2025. (to appear)
Abstract
The realization of efficient Artificial Intelligence (AI) solutions for the optimization of next-generation Radio Access Network (RAN) relies on the availability of expansive, high-quality datasets that accurately capture nuanced, site-specific conditions. However, obtaining such abundant, domain-specific measurements poses a significant challenge, especially as network complexity and energy efficiency demand surge toward 6G. In response, we introduce GenerativeAI-enabled Digital Twin (Gen-TWIN), a synthetic data generation framework underpinned by a soft-attention LSTM-based generative adversarial network (soft-GAN). Our model augments realistic transmitter and receiver-focused RF datasets by supplementing scarce empirical samples and providing the synthetic data volumes essential for training advanced AI models on RAN. Accuracy results show that soft-GAN provided 19% performance improvement compared to baseline models.
Quick access
Contact
Osman Tugay Basaran
Davide Villa
Pedram Johari
Michele Polese
Claudio Fiandrino
Falko Dressler
Tommaso Melodia
BibTeX reference
@inproceedings{basaran2025gen-twin,
author = {Basaran, Osman Tugay and Villa, Davide and Johari, Pedram and Polese, Michele and Fiandrino, Claudio and Dressler, Falko and Melodia, Tommaso},
note = {to appear},
title = {{Gen-TWIN: Generative-AI-Enabled Digital Twin for Open Radio Access Networks}},
publisher = {IEEE},
address = {London, United Kingdom},
booktitle = {44th IEEE International Conference on Computer Communications (INFOCOM 2025), Digital Twins over NextG Wireless Networks (DTWin 2025)},
month = {5},
year = {2025},
}
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.