7 June 2023 in IEEE Internet of Things Journal
This article considers a smart-duplex (SD) powered user-centric ultra dense networks (UC-UDNs), where each user is served cooperatively by multiple access points (APs) adopting the de-cellular concept to achieve desired Quality-of-Service (QoS). The average QoS satisfaction ratio maximization problem for the considered SD UC-UDN is formulated as a Markov decision process (MDP) with large discrete action space by designing the user association and power allocation. To reduce the action space, user association and power allocation are modeled as a two-layer tree, and selecting an action for each user is equivalent to finding the path from the root to one leaf of the constructed tree. Then, a multiagent tree-structured policy gradient (MATSPG)-based deep reinforcement learning (DRL) algorithm is proposed to solve the MDP problem, whose training process is shown to be equivalent to that of the two-layer neural networks. Next, the time and space complexity of searching one action in the proposed MATSPG are also proved to be lower than the conventional DRL algorithms. Finally, simulations show that the proposed MATSPG algorithm significantly improves the average QoS satisfaction ratio than the conventional multiagent deep deterministic policy gradient and multiagent deep Q-network methods in typical scenarios.
22 March 2022 in IEEE Wireless Communications Letters
This letter studies the spectrum transaction strategy for an unmanned aerial vehicle (UAV) assisted communications: the mobile device (MD) with much more spectrum resource can temporally lend its spectrum to the UAV to boost the transmissions from the UAV to the base station (BS); in return, the UAV with better channel condition allocates a proportion of its power to forward the MD’s signal to the BS. We study how the MD and the UAV establish effective spectrum transactions to increase their transmission rates. When the MD has perfect channel state information (CSI), the spectrum transaction between the MD and the UAV is modeled as a two-stage game, and the corresponding subsequent perfect equilibrium is derived; when the MD only knows statistical CSI for the UAV-BS link, we model it as a Bayesian game, whose Bayesian Nash equilibrium is computed by the Monte Carlo searching method.
11 November 2025 in IEEE Transactions on Communications
Next-generation wireless networks are expected to develop a novel paradigm of integrated sensing and communications (ISAC) to enable both the high-accuracy sensing and high-speed communications. However, conventional mono-static ISAC systems, which simultaneously transmit and receive at the same equipment, may suffer from severe self-interference, and thus significantly degrade the system performance. To address this issue, this paper studies a multi-static ISAC system for cooperative target localization and communications, where the transmitter transmits ISAC signal to multiple receivers (REs) deployed at different positions. We derive the closed-form of weighted sum Cramér-Rao bound (CRB) on the joint estimations of both the transmission delay and Doppler shift for cooperative target localization, and the weighted sum CRB minimization problem is formulated by considering the cooperative cost and communication rate requirements for the REs. To solve this problem, we first decouple it into two subproblems for RE selection and transmit beamforming, respectively. Then, a minimax linkage-based method is proposed to solve the RE selection subproblem, and a successive convex approximation algorithm is adopted to deal with the transmit beamforming subproblem with non-convex constraints. Finally, numerical results validate our analysis and reveal that our proposed multi-static ISAC scheme achieves better ISAC performance than the conventional mono-static ones with ideal SI cancellation when the number of cooperative REs is large.
16 August 2022 in IEEE Internet of Things Journal
Ultra dense networks (UDNs) with smart-duplex (SD), which allows the base stations (BSs) to flexibly switch between the half-duplex (HD) and full-duplex (FD), are expected to support high-density transmissions. However, to centrally handle a large network is costly, while distributed processing may suffer from the severe performance loss due to the complicated intercell interferences in the UDNs. This article aims to balance the system performance and clustering cost of the SD UDNs by dividing all small cells into several clusters. A Markov decision process (MDP) problem is formulated to maximize the average weighted sum of network throughput and clustering cost for all clusters. To approximately solve this problem, we first adopt an affinity propagation method to determine the number of clusters and the center of each cluster. Then, by treating small cells as agents, the original MDP problem is proved to be equivalent to a multiagent MDP to maximize the average reward of all small cells. Next, a multiagent deep reinforcement learning (DRL) is proposed to jointly implement the dynamic clustering for noncenter small cells, resource allocation, and duplex mode selection. Simulation results show that SD has prominent advantages over both the HD and FD in UDNs, and the proposed multiagent DRL outperforms other clustering schemes under the considered scenarios.
6 July 2020 in IEEE Access
This paper considers a two-transmitter and two-receiver interference channel (IC), where each transmitter sends a message to its desired receiver. In particular, the full-duplex (FD) amplify-and-forward (AF) protocol is adopted to build up the receiver cooperations: each receiver can receive the signals from the two transmitters and two receivers, and after self-interference (SI) cancellation and message decoding, it forwards them to its counterpart. With the above scheme, the equivalent channel model is analyzed, and the statistics of the accumulated residual interference and noise (ARIN), generated by the imperfect SI cancellation and the AF scheme at the receivers, is calculated by mathematical induction. Then, the achievable rate regions of both the single-user and joint decoding schemes are derived. It is proved that one-side cooperation, i.e., only one of the two receivers forwards its counterpart’s signal, is optimal to achieve the best system performance. Next, to characterize the obtained rate regions, the rate maximization problems are formulated and approximately solved by a sequential parametric convex approximation (SPCA) method. Simulation results show that the proposed scheme can improve the achievable rate compared to the conventional non-cooperative scheme in several typical scenarios.
21 August 2019 in IEEE Access
This paper considers a Gaussian interference channel (IC), where two transmitters send two messages to two receivers respectively. By utilizing the in-band full-duplex (FD) amplify-and-forward (AF) scheme, transmitter cooperations are deployed to enhance the system performance. In particular, each transmitter is capable of listening to its counterpart and then simultaneously transmits both the source signals to achieve higher power gain. Based on the proposed scheme, the equivalent channel model as well as the statistics of the accumulated residual self-interference and noise (ARIN) introduced by the transmitter cooperations and imperfect self-interference (SI) cancellation is analyzed. With the joint and single-user decoding schemes, the corresponding achievable rate regions are derived and a two-stage iterative algorithm is proposed to characterize these regions: in each step, fix the covariance matrix of the interferences and noises, and then adopt a two-step iterative semidefinite relaxation (SDR) method to optimize the two transmitters’ transmission parameters, respectively. Simulation results reveal that the proposed scheme can significantly improve the achievable rate under several channel conditions.