Chen Dai

Chen Dai

Auto-generated profile, based on publicly available information

Chen Dai

Nanjing University of Posts and Telecommunications

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
4 July 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
CDChen Dai
Chen Dai
Kun ZhuKun Zhu
Kun Zhu
EHEkram Hossain
Ekram Hossain
In multi-UAV networks, the downlink (DL) and uplink (UL) associations between a UAV and a user equipment (UE) is typically coupled, which restricts each UE to associate to the same UAV for both DL and UL. However, this mode may not be efficient since UAV networks can be heterogeneous (e.g., multi-tier UAV networks) and can experience high link uncertainty due to the mobility of UAVs. The introduction of full-duplex communication in a multi-UAV network further complicates the UE-UAV association. For this reason, the idea of DL-UL decoupling (DUDe) is introduced in this work, with which each UE is allowed to associate with separate UAVs for UL and DL transmissions. Besides, the UE-UAV association depends on the flight trajectory of the UAVs, which makes the DUDe design challenging. In this article, we study the joint decoupled UL-DL association and trajectory design problem for full-duplex multi-UAV networks. A joint optimization problem is formulated with the objective of maximizing the UEs’ sum-rate in both UL and DL. Since the problem is non-convex with sophisticated states and an individual UAV may not know the reward functions of other UAVs, a robust partially observable Markov decision process (POMDP) model is proposed to characterize the model uncertainty. A multi-agent deep reinforcement learning (MADRL) approach is proposed which enables each UAV to select its policy in a distributed manner. To train the actor-critic neural networks in the MADRL approach, an improved clip and count-based proximal policy optimization (PPO) algorithm is developed. In particular, a modified clip distribution is designed to deal with the hard restrictions between current and old policies, and an intrinsic reward is introduced to enhance the exploration capability. Simulation results illustrate the superiority of our proposed schemes when compared to the benchmarks. The codes are made publicly available in GitHub ( https://github.com/isdai/MADRL-PPO ).

15 February 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
CDChen Dai
Chen Dai
Kun ZhuKun Zhu
Kun Zhu
ZLZhenzhen Li
Zhenzhen Li
EHEkram Hossain
Ekram Hossain
We study the joint user association and resource allocation problem in both uplink (UL) and downlink (DL) for full-duplex heterogeneous cellular networks (HCNs), wherein base stations (BSs) are densely deployed with reusable subchannels and highly variable transmit powers. To reap the benefits of BS densification, decoupled multiple-association (DMA) is considered, which enables each user equipment (UE) to associate with multiple BSs for UL and DL in a decoupled manner. Furthermore, in order to provide the best service, appropriate holistic subchannel and power allocation are jointly studied and an optimization problem is formulated. However, it is challenging to solve the joint problem due to its combinatorial nature. To this end, we formulate a novel distributed four-sided matching game in which the UEs, BSs, subchannels, and power levels are ranked based on designed preference metrics for optimal matching. To obtain the solution, a low-complexity algorithm is developed. The convergence of the algorithm to a stable matching is proved and the worst-case complexity is analyzed. Numerical results are presented to demonstrate the performance of the proposed scheme in terms of the UEs’ sum-rate in UL and DL, respectively. The superiority of DMA is also investigated by comparisons.

18 August 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
CDChen Dai
Chen Dai
Kun ZhuKun Zhu
Kun Zhu
Changyan YiChangyan Yi
Changyan Yi
EHEkram Hossain
Ekram Hossain
User association is a crucial aspect which greatly affects the performance of wireless networks. In this work, we investigate the user association problem in full-duplex cellular networks, wherein base stations (BSs) are densely deployed with highly variable transmit powers and topologies (e.g., heterogeneous networks). To enhance the system performance, decoupled UL-DL (DUDe) association is considered, which enables each user equipment (UE) to associate with different BSs in uplink (UL) and downlink (DL), respectively. Considering the challenges raised by asymmetric information (e.g., channel gains and intercell interferences) between UEs and BSs, we propose a contract-theory based distributed user association approach. Specifically, the association process is modeled as a labor market, where the BSs act as employers and offer two-dimensional contracts to employees (i.e., UEs) for maximizing the utility of the BS. Theoretical proof for contract feasibility is presented by providing sufficient and necessary conditions. To reach the optimality, a contract-theoretic decoupled user association algorithm is developed, in which a BS broadcasts the drafted contracts, and each UE self-selects the optimal contract by considering her own demands. Numerical results are presented to demonstrate the performance of the proposed approach in terms of node utilities and social surplus. Impacts of system settings on the network performance are also investigated.

13 November 2019 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
CDChen Dai
Chen Dai
Kun ZhuKun Zhu
Kun Zhu
RWRan Wang
Ran Wang
BCBing Chen
Bing Chen
The new trends in network densification and heterogeneity introduce new challenges for user association. Currently, user association is typically coupled, with which a user is constrained to associate with the same base station in both uplink (UL) and downlink (DL). In homogeneous networks, this is simple and effective. However, it could restrict the performance in heterogeneous ultra dense networks (UDNs), wherein BSs are densely deployed with highly variable transmit powers and topologies. Besides, the backhaul capacity could be the bottleneck in UDNs, and caching popular contents at BSs becomes an effective method for alleviating the backhauling traffic. In this paper, we propose a novel cache-aware decoupled multiple association mechanism for full-duplex UDNs, which allows a user to associate with multiple BSs in UL and DL, in a decoupled manner. Considering that users can form a self-learning system, a contextual multi-armed bandit (CMAB) problem is formulated where network states are unknown random variables. For obtaining the optimal strategy, an SINR-based linear upper confidence bound algorithm is developed. And deep learning is adopted when considering a large-scale network with expansion of the dimension in state space. The convergence of the algorithm is proven. Simulation results validate the feasibility and superiority of the proposed approach by comparisons.

18 December 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CDChen Dai
Chen Dai
YWYize Wang
Yize Wang
TWTianyu Wu
Tianyu Wu
XGXiaolin Gu
Xiaolin Gu
HCHaotong Cao
Haotong Cao
GSGuozi Sun
Guozi Sun
Integrated sensing and communication (ISAC) is envisioned as a key enabler of 6 G networks, allowing communication and sensing to share spectrum and hardware resources in a unified manner. Unmanned aerial vehicles (UAVs) can further enhance ISAC systems by providing flexible deployment and reliable line-of-sight (LoS) links. However, the openness of UAV communication channels, coupled with their dynamic mobility and limited energy, makes them highly vulnerable to eavesdropping and exacerbates physical layer security (PLS) concerns. To address these challenges, we propose a reconfigurable intelligent surface (RIS)-assisted framework for enhancing PLS in dynamic and uncertain UAV-enabled ISAC networks. We formulate a secrecy-oriented joint optimization problem that integrates UAV trajectory design, RIS phase shift configuration, beamforming, and decoupled uplink–downlink (DUDe) user association. To render this problem tractable, we adopt a two-stage approach. First, the beamforming subproblem is solved via fractional programming and successive convex approximation to obtain closed-form solutions. Subsequently, with beamforming fixed, we reformulate the remaining coupled design of trajectories, associations, and RIS phases as a Partially Observable Markov Decision Process (POMDP). To address the challenges of high-dimensional sequential decision-making and the need for scalable, real-time coordination inherent in multi-UAV systems, we develop a robust multi-agent deep reinforcement learning (MADRL) solution, effectively circumventing the prohibitive communication overhead of centralized control and the intractability of single-agent formulations suffering from the curse of dimensionality. Specifically, we design a stochastic environment-aware Proximal Policy Optimization (PPO) algorithm that incorporates random environment distribution to capture environmental randomness, intrinsic rewards to guide UAV exploration of secure regions, and uncertainty estimation to refine policy updates. Simulation results verify that the proposed framework significantly outperforms benchmark methods in terms of secrecy rate and robustness, especially under dynamic scenarios with varying numbers of users and eavesdroppers.

1 January 2026 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JLJialiuyuan Li
Jialiuyuan Li
YSYou Shi
You Shi
CDChen Dai
Chen Dai
YFYongjian Fan
Yongjian Fan
Changyan YiChangyan Yi
Changyan Yi
JSJiantao Shi
Jiantao Shi