Ruoyang Chen

Ruoyang Chen

Auto-generated profile, based on publicly available information

Ruoyang Chen

College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
RCRuoyang Chen
Ruoyang Chen
Changyan YiChangyan Yi
Changyan Yi
Kun ZhuKun Zhu
Kun Zhu
BCBing Chen
Bing Chen
Jun CaiJun Cai
Jun Cai
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
In this paper, a novel hierarchical game framework for physical layer security (PLS) aware wireless communications with dynamic trilateral coalitions is studied. In the considered system, legitimate users (LUs) aim to transmit secret data to associated base stations (BSs) via uplink communications under the threat of eavesdroppers (EVs), while there also exists jammers (JAs) which may choose to form coalitions with either LUs for increasing their secrecy transmission rates or EVs for increasing their eavesdropping rates in exchange for potential rewards. Different from the existing work, we explore such complicated while dynamic coalition relationships under uncertainties of wireless systems (e.g., time-varying channel conditions), and formulate a hierarchical game integrated with a dynamic trilateral coalition formation game to model strategic interactions among LUs, JAs and EVs. Particularly, we first analyze stability conditions of the trilateral coalitions and propose a hedonic coalition selection and formation algorithm for reaching the stable coalition partition in each time slot. On top of this, we propose a deep reinforcement learning (DRL) based solution, which can achieve the equilibrium with long-term performance guarantees for the hierarchical game running over multiple time slots with dynamic evolutions. Simulations evaluate the proposed solution and show its superiority over counterparts.

24 June 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
RCRuoyang Chen
Ruoyang Chen
Changyan YiChangyan Yi
Changyan Yi
FZFuhui Zhou
Fuhui Zhou
JKJiawen Kang
Jiawen Kang
YWYuan Wu
Yuan Wu
DNDusit Niyato
Dusit Niyato
In this paper, we propose a novel federated framework for constructing the digital twin (DT) model, referring to a living and self-evolving visualization model empowered by artificial intelligence, enabled by distributed sensing under edge-cloud collaboration. In this framework, the DT model to be built at the cloud is regarded as a global one being split into and integrating from multiple functional components, i.e., partial-DTs, created at various edge servers (ESs) using feature data collected by associated sensors. Considering time-varying DT evolutions and heterogeneities among partial-DTs, we formulate an online problem that jointly and dynamically optimizes partial-DT assignments from the cloud to ESs, ES-sensor associations for partial-DT creation, and as well as computation and communication resource allocations for global-DT integration. The problem aims to maximize the constructed DT’s model quality while minimizing all induced costs, including energy consumption and configuration costs, in long runs. To this end, we first transform the original problem into an equivalent hierarchical game with an upper-layer two-sided matching game and a lower-layer overlapping coalition formation game. After analyzing these games in detail, we apply the Gale-Shapley algorithm and particularly develop a switch rules-based overlapping coalition formation algorithm to obtain short-term equilibria of upper-layer and lower-layer subgames, respectively. Then, we design a deep reinforcement learning-based solution, called DMO, to extend the result into a long-term equilibrium of the hierarchical game, thereby producing the solution to the original problem. Simulations show the effectiveness of the introduced framework, and demonstrate the superiority of the proposed solution over counterparts.

11 September 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
DLDenghui Liu
Denghui Liu
RCRuoyang Chen
Ruoyang Chen
Changyan YiChangyan Yi
Changyan Yi
Tong ZhangTong Zhang
Tong Zhang
Xiaolong LiXiaolong Li
Xiaolong Li
Kun ZhuKun Zhu
Kun Zhu
This paper investigates a dynamic game framework for physical layer security (PLS)-aware wireless network with third-party collaborative users (TCUs). In the considered system, legitimate users (LUs) aim to transmit secret signals under the threat of eavesdroppers (EVs). There exists TCUs rationally selecting to form coalitions with LUs or EVs, strategically enhancing the secrecy transmission rates for LUs or increasing eavesdropping rates for EVs to obtain rewards. Due to the unpredictability of wireless systems (e.g., time-varying channel conditions, user mobility), coalitions among the three parties may be unfixed and dynamically changing. A hierarchical game integrating a matching subgame with a coalition formation subgame is formulated to model the interactions among LUs, EVs, and TCUs. In order to derive the optimal long-term strategies while solving the equilibrium of the hierarchical game, we first introduce a constrained Gale-Shapley algorithm which determines the optimal power, mode, and channel selections of TCUs with the known coalition partition, and then propose a coalition selection algorithm for reaching the stability of coalition partitions. Moreover, we develop a deep reinforcement learning (DRL)-based solution to concatenate the aforementioned algorithms, producing the long-term optimal strategies for LUs, EVs and TCUs over multiple time slots. Simulations evaluate the performance of the proposed scheme, and demonstrate its superiority over counterparts.

27 May 2025 in IEEE Network
Verified
Journal Article
Closed access
Xiaolong LiXiaolong Li
Xiaolong Li
JWJianhao Wei
Jianhao Wei
HWHaidong Wang
Haidong Wang
LDLi Dong
Li Dong
RCRuoyang Chen
Ruoyang Chen
XSXuemin Shen
Xuemin Shen
In intelligent transportation systems (ITSs), integrating pedestrians and vehicles into traffic management models is essential for developing realistic and safe solutions. However, current systems often fail to simulate complex, real-world scenarios due to the absence of a comprehensive digital twin framework across diverse traffic environments and effective modeling of pedestrian-vehicle interactions. In this article, we propose a surveillance video-assisted federated digital twin (SV-FDT) framework to enhance ITSs by incorporating pedestrians and vehicles into the control loop. SV-FDT improves computational efficiency and communication performance by transmitting only semantic data and agent parameters, rather than raw video streams. The proposed framework adopts three-layer architecture and constructs detailed pedestrian-vehicle interaction models using multi-source traffic surveillance videos. The three-layer architecture includes: (i) an end layer that collects surveillance videos from multiple sources; (ii) an edge layer that performs self-supervised semantic segmentation to extract interactions, converts them into executable traffic codes, and generates local digital twin systems (LDTSs) for regional traffic modeling; and (iii) a cloud layer that integrates LDTSs into a real-time global digital twin model. Key design considerations, challenges, and practical implementation guidelines are discussed for SV-FDT, and a testbed evaluation is used to show that SV-FDT improves traffic flow, reduces mirroring delay, and enhances recognition accuracy and system efficiency compared to traditional terminal-server frameworks. Finally, we outline open challenges and potential directions for future research in digital twin-enabled ITS.

24 April 2025 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
HZHaipeng Zhou
Haipeng Zhou
RCRuoyang Chen
Ruoyang Chen
Changyan YiChangyan Yi
Changyan Yi
JZJianjun Zhang
Jianjun Zhang
JKJiawen Kang
Jiawen Kang
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
In this paper, we introduce third-party intelligent reflecting surfaces (TIRSs) into the physical layer security aware wireless communication system, where a central legitimate transmitter is designed to transmit secret signals to a group of legitimate receivers in the presence of the threat from an active eavesdropper (EV). Due to the channel reshaping ability of TIRSs, they are able to not only help legitimate pairs (LPs) enhance the secure transmission rate but also assist EV in improving the eavesdropping performance. Furthermore, with the potential selfishness, TIRSs may dynamically choose to ally with LPs or EV in exchange for potential benefits (e.g., payoffs). This leads to complex dynamic ally-adversary relationships among LPs, EV, and TIRSs under unpredictable wireless channel conditions. To address this issue, we formulate a repeated coalition formation game (RCFG) with dynamic decision-making to model the long-term strategic interactions among LPs, EV, and TIRSs. In particular, we theoretically analyze the existence of Nash equilibrium in the formulated RCFG, and then propose a switch operations-based coalition selection along with a deep reinforcement learning (DRL)-based approach for obtaining such an equilibrium. Simulations examine the feasibility of the proposed approach and show its superiority over counterparts.

10 March 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
RCRuoyang Chen
Ruoyang Chen
Changyan YiChangyan Yi
Changyan Yi
HZHaifeng Zhu
Haifeng Zhu
Wen WuWen Wu
Wen Wu
JKJiawen Kang
Jiawen Kang
DNDusit Niyato
Dusit Niyato
Aiming to provide high-fidelity and real-time virtual replicas, a digital twin (DT) model must be dynamically updated to precisely characterize the evolution of physical objects. Unlike the existing work, this paper studies a novel edge-cloud collaborative DT update framework with adaptive model splitting and reliable crowdsourcing under uncertain data distortions. Specifically, we consider that a global DT model can be split into arbitrary subsets of its elementary components (DT units), re-forming disjoint partial-DTs. Each partial-DT is constructed on distributed edge servers (ESs) by model training using the locally collected feature data. To enhance the system reliability, being more robust against uncertain data distortions that widely occur in practice, we further improve partial-DT constructions via crowdsourcing. In other words, each partial-DT is simultaneously trained by multiple ESs, i.e., an ES crowd, with one coordinator ES intermediately aggregating all models from participating ESs into a unified one. Then, the cloud collects and integrates partial-DTs from ES crowds to update the global DT. We formulate an online joint optimization problem to adaptively determine partial-DT splitting and ES crowdsourcing across different DT evolution periods or frames, with the objective of maximizing the long-term physical-virtual mapping accuracy. To this end, we first study a simplified short-term problem in each frame, modeled as a Bayesian coalition formation game (BCFG). We then develop an uncertainty-aware crowd formation algorithm based on a particularly established believe function to solve the BCFG for short-term optimal partial-DT assignment and coordinator ES selection, given any partial-DT splitting decisions. Moreover, we modify the BCFG to accommodate dynamic settings and design a deep reinforcement learning-based algorithm integrated with this modified BCFG, called DBC. The DBC algorithm extends the short-term solution to a long-term one, which jointly and dynamically optimizes partial-DT splitting and ES crowdsourcing, thereby addressing the original problem. Simulations show the effectiveness of the introduced dynamic DT update framework, and demonstrate the superiority of the proposed DBC algorithm over counterparts in terms of increasing the average DT update accuracy while reducing the associated costs.