No abstract

No abstract

Integrated sensing and communications (ISAC) has been considered one of the new paradigms for sixth-generation (6G) wireless networks. In the millimeter-wave (mmWave) ISAC system, hybrid beamforming (HBF) is considered an emerging technology to exploit the limited number of radio frequency (RF) chains in order to reduce the system hardware cost and power consumption. However, the HBF structure reduces the spatial degrees of freedom for the ISAC system, which further leads to increased interference between multiple users and between users and radar sensing. To solve the above problem, rate split multiple access (RSMA), which is a flexible and robust interference management strategy, is considered. We investigate the joint common rate allocation and HBF design problem for the HBF-based RSMA-assisted mmWave ISAC scheme. We propose the penalty dual decomposition (PDD) method coupled with the weighted mean squared error (WMMSE) minimization method to solve this high-dimensional non-convex problem, which converges to the Karush-Kuhn-Tucker (KKT) point of the original problem. Then, we extend the proposed algorithm to the HBF design based on finite-resolution phase shifters (PSs) to further improve the energy efficiency of the system. Simulation results demonstrate the effectiveness of the proposed algorithm and show that the RSMA-ISAC scheme outperforms other benchmark schemes.

With the high flexibility of supporting resourceintensive and time-sensitive applications, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) is proposed as an innovational paradigm to support the mobile users (MUs). As a promising technology, digital twin (DT) is capable of timely mapping the physical entities to virtual models, and reflecting the MEC network state in real-time. In this paper, we first propose an MEC network with multiple movable UAVs and one DT-empowered ground base station to enhance the MEC service for MUs. Considering the limited energy resource of both MUs and UAVs, we formulate an online problem of resource scheduling to minimize the weighted energy consumption of them. To tackle the difficulty of the combinational problem, we formulate it as a Markov decision process (MDP) with multiple types of agents. Since the proposed MDP has huge state space and action space, we propose a deep reinforcement learning approach based on multi-agent proximal policy optimization (MAPPO) with Beta distribution and attention mechanism to pursue the optimal computation offloading policy. Numerical results show that our proposed scheme is able to efficiently reduce the energy consumption and outperforms the benchmarks in performance, convergence speed and utilization of resources.

No abstract