core challenge in physical-layer security is the difficulty of obtaining the channel state information (CSI) of potential eavesdroppers. The inherent sensing functionality of integrated sensing and communication (ISAC) systems offers a promising solution by enabling the estimation of key parameters, such as the eavesdropper’s angles of departure (AoDs). Capitalizing on this capability, we propose a sensing-assisted secure communication scheme for a movable antenna (MA)-aided ISAC system. The scheme comprises two stages: eavesdropper AoD sensing and secure communication. In the first stage, the base station (BS) optimizes the positions of its transmit and receive MAs to enhance sensing accuracy. We derive the closed-form Cramèr-Rao bound (CRB) for the estimated AoDs to fundamentally characterize how MA positions influence the estimation uncertainty. In the second stage, the BS ensures secure communication by designing a robust beamforming vector that accounts for the AoD uncertainty region and by further optimizing the transmit MAs’ positions to maximize the secrecy rate. To manage the end-to-end design, we formulate a joint optimization problem. This intractable non-convex problem is decomposed into two subproblems. For the first subproblem, we develop an alternating optimization (AO) algorithm to solve the CRB minimization problem. For the second subproblem, we solve the worst-case secrecy rate maximization problem using a method based on backward induction, convex hull construction, and AO. Finally, simulation results are provided to demonstrate the significant advantages of the proposed scheme compared to various benchmarks.

This study addresses the challenges of near-field interference suppression and resource allocation in extremely large-scale multiple-input multiple-output (XL-MIMO) communication systems, particularly under dense-user scenarios. We propose a quality-of-service (QoS)-aware joint user scheduling and power control scheme. Leveraging the spherical wave (SW) characteristics of near field channels, a dual-domain interference suppression strategy is developed by analyzing the spatial correlation of beam focusing vectors in terms of both angular separation and distance constraints. Based on this, a spatial correlation-based scheduling (SCS) algorithm is designed. By integrating this user selection strategy with a dynamic power allocation mechanism, the proposed approach optimizes the sum spectral efficiency while ensuring the user QoS. This framework is further extended to modular XL-MIMO systems. We show how modular deployment can enhance spatial resolution and develop an adapted QoS-aware user scheduling algorithm, called modular SCS (SCS-mod), for this architecture. Simulation results validate that the proposed algorithms significantly outperform existing schemes in terms of sum spectral efficiency and the number of scheduled users, especially under high user density and high transmission power conditions.

In this paper, we consider an unmanned aerial vehicle (UAV)-enabled mobile edge computing (MEC) system, where multiple ground devices offload portions of their latency-sensitive and mission-critical computational tasks to a UAV-carried MEC server for remote computing and compute the remaining portions locally. To meet the low-latency requirements of the MEC, ultra-reliable and low-latency communication (URLLC) is used to offload tasks from the devices to the UAV. We minimize the maximum computation latency among all devices by jointly optimizing the computing times and CPU frequencies of the devices and the UAV, the offloading bandwidths of the devices, and the three-dimensional location of the UAV. We propose an algorithm that decomposes the joint optimization problem into three subproblems, which optimize the UAV’s horizontal location, the UAV’s altitude, and the offloading bandwidths and computing CPU frequencies, respectively. In solving the subproblems, the data rate expression of the devices’ finite-blocklength offloading is accurately approximated by a tractable logarithmic function, and the successive convex approximation technique is applied to tackle the non-convex structure. Furthermore, a semi-closed-form solution to the subproblem that optimizes the bandwidths and CPU frequencies is derived to reduce the complexity. Simulation results show that the proposed algorithm can significantly reduce the system’s computation latency compared to the benchmark schemes.

In wireless sensor networks, unmanned aerial vehicles (UAVs) can be employed to collect data from sensor nodes (SNs) efficiently. In this article, we consider a dual-UAV-enabled (long-distance) data collection system, where one UAV is dispatched to collect data from distributed SNs, while the other UAV is employed to relay data from the data-collection UAV to a fusion center (FC) that locates far from the SNs. To shorten the time duration for the FC to collect all data, we propose to minimize the completion time of the data collection task by jointly optimizing the transmit power and bandwidth of all SNs and the UAVs, as well as the three-dimensional trajectories of the two UAVs. Instead of assuming the simplified line-of-sight UAV-ground channel model as in most existing works, we model the channels between the UAVs and SNs as well as that between the UAVs and FC by applying the practically more accurate elevation-angle-dependent Rician fading channel model. The resulting optimization problem is nonconvex and thus is difficult to solve in general. Nevertheless, we propose an algorithm to solve it efficiently by using the techniques of block coordinate descent, slack variable substitution, and successive convex approximation. Simulation results show that our proposed algorithm can achieve higher communication efficiency than other benchmark schemes and greatly reduce the task completion time for data collection.

In this paper, we consider an intelligent reflecting surface (IRS)-assisted cognitive radio system and maximize the secondary user (SU) rate by jointly optimizing the transmit power of secondary transmitter (ST) and the IRS’s reflect beamforming, subject to the constraints of the minimum required signal-to-interference-plus-noise ratio at the primary receiver, the ST’s maximum transmit power, and the unit modulus of the IRS reflect beamforming vector. This joint optimization problem can be solved suboptimally by the non-convex optimization techniques, which however usually require complicated mathematical transformations and are computationally intensive. To address this challenge, we propose an algorithm based on the deep deterministic policy gradient (DDPG) method. To achieve a higher learning efficiency and a lower reward variance, we propose another algorithm based on the soft actor-critic (SAC) method. In these proposed algorithms, a reward impact adjustment approach is proposed to improve their learning efficiency and stability. Simulation results show that the two proposed algorithms can achieve comparable SU rate performance with much shorter running time, as compared to the existing non-convex optimization-based benchmark algorithm, and that the proposed SAC-based algorithm learns faster and achieves a higher average reward with lower variance, as compared to the proposed DDPG-based algorithm.

In ultra-dense networks, the increasing popularity of computation intensive applications imposes challenges to the resource-constrained smart mobile devices (SMDs), which may be solved by offloading these computation tasks to the nearby mobile edge computing centers. However, when massive SMDs offload computation tasks in a dynamic wireless environment simultaneously, the joint optimization of their offloading decisions becomes prohibitively complex. In this paper, we firstly model the joint optimization problem as a multi-user non-cooperative dynamic stochastic game, then propose a mean field game based algorithm to solve it with a drastically reduced complexity. We derive the two partial differential equations ruling the optimal strategies of the mean field game, namely the Hamilton-Jacobi-Bellman and Fokker-Planck-Kolmogorov equations, which are solved in an iterative manner in our proposed algorithm. Numerical results demonstrate that the proposed mean field game-based offloading algorithm requires a lower cumulated cost than the conventional strategies under the latency constraints of computation tasks, with perfect prediction of future channel states. It also appears that the performance of the mean field game-based offloading strategy depends on the accuracy of the future channel knowledge provided to the system, as the uncertainty may compromise its cumulated cost performance.

Unmanned aerial vehicle (UAV) communication is anticipated to be widely applied in the forthcoming fifth-generation wireless networks, due to its many advantages such as low cost, high mobility, and on-demand deployment. However, the broadcast and line-of-sight nature of air-to-ground wireless channels give rise to a new challenge on how to realize secure UAV communications with the destined nodes on the ground. This paper aims to tackle this challenge by applying the physical layer security technique. We consider both the downlink and uplink UAV communications with a ground node, namely, UAV-to-ground (U2G) and ground-to-UAV (G2U) communications, respectively, subject to a potential eavesdropper on the ground. In contrast to the existing literature on the wireless physical layer security only with the ground nodes at fixed or quasi-static locations, we exploit the high mobility of the UAV to proactively establish favorable and degraded channels for the legitimate and eavesdropping links, through its trajectory design. We formulate new problems to maximize the average secrecy rates of the U2G and G2U transmissions, by jointly optimizing the UAV's trajectory, and the transmit power of the legitimate transmitter over a given flight period of the UAV. Although the formulated problems are non-convex, we propose iterative algorithms to solve them efficiently by applying the block coordinate descent and successive convex optimization methods. Specifically, both the transmit power and UAV trajectory are optimized, with the other being fixed in an alternating manner, until the algorithms converge. The simulation results show that the proposed algorithms can improve the secrecy rates for both U2G and G2U communications, as compared to other benchmark schemes without power control and/or trajectory optimization.

The non-orthogonal multiple access (NOMA) technique can provide higher spectral efficiency and massive connectivities to wireless networks. The wireless power transfer (WPT) technique is a controllable and promising way to solve the energy scarcity problem of wireless devices. In this paper, we introduce the NOMA and WPT techniques into a multi-user wireless network, where multiple users need to transmit their information to an information receiver within a very limited spectrum and they suffer from the energy scarcity problem. We consider a harvest-then-transmit protocol by dividing each transmission block into two time-slots. In the first time-slot, a power station sends dedicated energy to the users via wireless energy beamforming. In the second time-slot, using their harvested energy in the previous time-slot, the users transmit their information to the information receiver in the NOMA manner. In this network, the throughput can be optimized by jointly optimizing the energy beamforming at the power station, the transmit powers of the users, as well as the time allocation between the two time-slots. We propose an algorithm to find the optimal solution of the throughput maximizing joint energy beamforming and resource allocation problem. Simulation results show that the proposed algorithm achieves higher throughput than the benchmark scheme.

Unmanned aerial vehicle (UAV) communications has drawn significant interest recently due to many advantages such as low cost, high mobility, and on-demand deployment. This paper addresses the issue of physical-layer security in a UAV communication system, where a UAV sends confidential information to a legitimate receiver in the presence of a potential eavesdropper which are both on the ground. We aim to maximize the secrecy rate of the system by jointly optimizing the UAV's trajectory and transmit power over a finite horizon. In contrast to the existing literature on wireless security with static nodes, we exploit the mobility of the UAV in this paper to enhance the secrecy rate via a new trajectory design. Although the formulated problem is non-convex and challenging to solve, we propose an iterative algorithm to solve the problem efficiently, based on the block coordinate descent and successive convex optimization methods. Specifically, the UAV's transmit power and trajectory are each optimized with the other fixed in an alternating manner until convergence. Numerical results show that the proposed algorithm significantly improves the secrecy rate of the UAV communication system, as compared to benchmark schemes without transmit power control or trajectory optimization.

Simultaneous wireless information and power transfer (SWIPT) is a potential technique to solve the energy scarcity problem in wireless communication networks. Information transmission security is one of the key issues to be addressed in SWIPT. In this study, the authors consider guaranteeing the information transmission security of a multiple‐input multiple‐output non‐regenerative relay system with SWIPT in the physical layer by designing source and relay beamforming to maximise the security rate of the system. The problem is to design the source signal and artificial noise (AN) beamforming and the relay forwarding beamforming jointly, which is highly non‐convex. They first propose an alternating optimisation‐based algorithm, which designs the beamforming matrices at the source and relay separately and alternately. Next, they propose a joint design algorithm which designs the source signal and AN beamforming and the relay beamforming together. Finally, they propose a non‐iterative design algorithm with low complexity. The performances of the proposed design algorithms have been verified by computer simulations.

For conventional subcarrier pairing scheme in cooperative orthogonal frequency division multiplexing decode‐and‐forward multi‐relay networks, to avoid interference, each subcarrier pair (SP) is assigned to a single relay. Over a specific subcarrier, the destination receives signals transmitted from the relay. In this study, to better exploit the degrees of spatial freedom, the authors propose to assign each SP to multiple relays. Thus, over a specific subcarrier, the destination receives signals transmitted from multiple relays. Under the total network power constraint, to maximise the sum transmission rate, they propose a joint resource allocation scheme, in which they jointly optimised the four types of resources: assisting relays selection, transmission mode selection, subcarrier pairing and power allocation. They further propose a suboptimal algorithm which can significantly reduce the computational complexity of the aforementioned optimal allocation scheme with sacrificing little on the performance. It is shown from simulation results that the author's proposed schemes have significant performance improvement over the resource allocation schemes in the literature.