While unmanned aerial vehicles (UAVs) with flexible mobility are envisioned to enhance physical layer security in wireless communications, the efficient security design that adapts to such high network dynamics is rather challenging. The conventional approaches extended from optimization perspectives are usually quite involved, especially when jointly considering factors in different scales such as deployment and transmission in UAV-related scenarios. In this paper, we address the UAV-enabled multi-user secure communications by proposing a deep graph reinforcement learning framework. Specifically, we reinterpret the security beamforming as a graph neural network (GNN) learning task, where mutual interference among users is managed through the message-passing mechanism. Then, the UAV deployment is obtained through soft actor-critic reinforcement learning, where the GNN-based security beamforming is exploited to guide the deployment strategy update. Simulation results demonstrate that the proposed approach achieves near-optimal security performance and significantly enhances the efficiency of strategy determination. Moreover, the deep graph reinforcement learning framework offers a scalable solution, adaptable to various network scenarios and configurations, establishing a robust basis for information security in UAV-enabled communications.
6 June 2024 in IEEE Transactions on Wireless Communications
With the rapidly increasing number of satellites, the handover scheme design is critically important for the low Earth orbit (LEO) satellite networks, especially for the mega-constellations that include massive number of LEO satellites. However, the existing handover schemes for LEO satellite networks are designed based on the static propagation conditions, which cannot satisfy the dynamic feature of communication environment caused by the mobility of LEO satellites and users. To address this issue, a centralized adaptive intelligent handover scheme for mega-constellations is proposed, where the dynamics of the propagation conditions and limited LEO satellite capacity are taken into considerations. Specifically, we first use a three-state Markov model to characterize the dynamically varying propagation conditions between satellites and users. Then, the Loo model is employed to describe the dynamic land mobile satellite channels. By considering the user transmission rate requirement and the load-balancing demand of satellites, we design the user utility function and formulate an optimization problem that aims to maximize the overall long-term utility of the network. To reduce the handover decision-making complexity, a multi-agent successive hysteretic deep Q-learning algorithm is developed and it can efficiently solve the formulated problem by reducing the state and action space. To reduce the signaling overhead and the computation complexity of the proposed centralized handover scheme brought to the control center, a distributed intelligent handover scheme is further developed, where each user is enabled to independently make the handover decision only based on the local information. Simulation results show that both the proposed centralized and distributed approaches can efficiently improve the network performance over the existing schemes.
5 December 2019 in IEEE Transactions on Communications
The multi-access edge computing (MEC)-enabled low Earth orbit (LEO) satellite network is a promising approach to meet the growing ubiquitous diverse computation demands around the world. In this paper, a joint task offloading and resource allocation strategy is proposed for hybrid MEC-enabled LEO satellite networks, where two types of MEC tasks, namely delay-sensitive edgy-cloud task and data-and computation-intensive cloudy-edge task, are considered simultaneously. Specifically, we first design the cost functions for the two types of tasks, which take the delay-sensitive feature of edgy-cloud task and data-and computation-intensive characteristics of cloudy-edge task into consideration. Then, an overall terminal cost minimization problem is formulated for task offloading and resource allocation under the communication and computation capability constraints and the service delay requirements. In practice, terminals usually only care about their own costs, but satellites pursue the overall cost minimization of all the served terminals. Thus, considering the individual and collective rationality simultaneously, a two-level hierarchical game is constructed to solve the formulated problem. In the upper level, a hedonic coalition formation game is established, which enables each terminal to make the coalition selection and task offloading decision based on the designed coalition switch rule. In the lower level, the joint channel and power allocation in each coalition is first formulated as a noncooperative game to represent the individual rationality of each terminal. Then, each satellite performs the optimal computation resource allocation to maximize the coalition value with collective rationality. We prove that the Nash equilibrium (NE) for the noncooperative game exists and the coalition partition converges to a Nash stable state. Simulation results are provided to demonstrate the superiority of the proposed strategy.
1 February 2018 in IEEE Transactions on Information Forensics and Security
A pilot spoofer can paralyze the channel estimation in multi-user orthogonal frequency-division multiplexing (OFDM) systems by using the same publicly known pilot tones as legitimate nodes. This causes the problem of pilot authentication (PA). To solve this, we propose, for a two-user multi-antenna OFDM system, a code-frequency block group (CFBG) coding-based PA mechanism. Here multi-user pilot information, after being randomized independently to avoid being spoofed, is converted into activation patterns of subcarrier-block groups on code-frequency domain. Those patterns, though overlapped and interfered mutually in the wireless transmission environment, are qualified to be separated and identified as the original pilots with high accuracy, by exploiting CFBG coding theory and channel characteristic. Particularly, we develop the CFBG code through two steps, i.e., 1) devising an ordered signal detection technique to recognize the number of signals coexisting on each subcarrier block, and encoding each subcarrier block with the detected number and 2) constructing a zero-false-drop code and block detection-based code via k-dimensional Latin hypercubes and integrating those two codes into the CFBG code. This code can bring a desirable pilot separation error probability, inversely proportional to the number of occupied subcarriers and antennas with a power of k. To apply the code to PA, a scheme of pilot conveying, separation, and identification is proposed. Based on this novel PA, a joint channel estimation and identification mechanism is proposed to achieve high-precision channel recovery and simultaneously enhance PA without occupying extra resources. Simulation results verify the effectiveness of our proposed mechanism.
23 January 2019 in IEEE Transactions on Wireless Communications
Due to the spectrum-sharing feature of cognitive radio networks (CRNs) and the broadcasting nature of wireless channels, providing Quality-of-Service (QoS) provisioning for primary users (PU) and protecting information security for secondary users (SU) are two crucial and fundamental issues for CRNs. Consequently, in this paper, we establish a unified QoS and security provisioning framework for wiretap CRNs. Specifically, different from the widely used deterministic QoS provisioning method and information-theoretical security protection approach, our established framework, which is built on the theory of statistical queueing analysis, can quantitatively characterize PU’s QoS and SU’s security requirements. By adopting the theories of effective capacity and effective bandwidth, we further convert the QoS and security requirements to the equivalent PU’s effective capacity and SU’s effective bandwidth constraints. Following our developed framework, we formulate the nonconvex optimization problem which aims at maximizing the average throughput of SU subject to PU’s QoS requirement, SU’s security constraint, as well as SU’s average and peak transmit power limitations. Then, we adopt the techniques of convex hull and probabilistic transmission to convert the original nonconvex problem to the equivalent convex problem and obtain the optimal power allocation scheme through the Lagrangian method. Moreover, we also develop a fixed power allocation scheme which is suboptimal but has low complexity. Simulation results are also provided which demonstrate the impact of PU’s QoS and SU’s security requirements on SU’s throughput as well as the advantage of our proposed optimal power allocation scheme over the fixed power allocation scheme and the conventional security-based water-filling policy.