Yang Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yang Gao has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Jiangbo Si
Xidian University
3 shared publications - Naofal Al-Dhahir
The University of Texas at Dallas
3 shared publications - Zan Li
Xidian University
3 shared publications Dong-Sheng Li
2 shared publications- Pengpeng Liu
State Key Laboratory of Integrated Services Networks, Xidian University, Xian, China
2 shared publications - Chao Li
Shanghai Jiao Tong University, Shanghai, China
1 shared publication
Latest Publications
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 5015-5024
Use a Little Force to Move a Great Mass: A Jamming Leverage Strategy for Covert Communications
We propose a joint covert beamforming design and jamming strategy to protect the communication process between Alice and Bob from being discovered by Willie with the help of another pair of neutral nodes. Specifically, with the help of irrelevant communication parties that commonly exist in practical communication scenarios, Jammer increases his transmission power by interfering with the neutral receiver, thus indirectly increasing the interference to Willie, which can be viewed as leveraging the force to make a big impact with a small effect. In our designed beamformer, we jointly optimize the beam power allocation factor, Alice’s transmission power, and Jammer’s transmission power when Alice transmits, to maximize the covert rate, which also maximizes Alice’s transmission power. In the perfect channel state information (CSI) scenario, the transformed optimization problem is solved via a one-dimensional search method and CVX solver. Due to the solution’s high complexity, we further propose a method to determine the optimal power allocation factor. For the imperfect Willie’s CSI scenario, three cases are investigated: Alice to Willie imperfect CSI, Transmitter to Willie imperfect CSI, and Jammer to Willie imperfect CSI. We utilize the S-procedure to tackle the optimization problem. Simulation results demonstrate the effectiveness of our proposed strategy.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 5015-5024
Use a Little Force to Move a Great Mass: A Jamming Leverage Strategy for Covert Communications
We propose a joint covert beamforming design and jamming strategy to protect the communication process between Alice and Bob from being discovered by Willie with the help of another pair of neutral nodes. Specifically, with the help of irrelevant communication parties that commonly exist in practical communication scenarios, Jammer increases his transmission power by interfering with the neutral receiver, thus indirectly increasing the interference to Willie, which can be viewed as leveraging the force to make a big impact with a small effect. In our designed beamformer, we jointly optimize the beam power allocation factor, Alice’s transmission power, and Jammer’s transmission power when Alice transmits, to maximize the covert rate, which also maximizes Alice’s transmission power. In the perfect channel state information (CSI) scenario, the transformed optimization problem is solved via a one-dimensional search method and CVX solver. Due to the solution’s high complexity, we further propose a method to determine the optimal power allocation factor. For the imperfect Willie’s CSI scenario, three cases are investigated: Alice to Willie imperfect CSI, Transmitter to Willie imperfect CSI, and Jammer to Willie imperfect CSI. We utilize the S-procedure to tackle the optimization problem. Simulation results demonstrate the effectiveness of our proposed strategy.
- Open Access
- 27 February 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (5) , 691
A New Multi-Target Three-Way Threat Assessment Method with Heterogeneous Information and Attribute Relevance
Target threat assessment provides support for combat decision making. The multi-target threat assessment method based on a three-way decision can obtain threat classification while receiving threat ranking, thus avoiding the limitation of traditional two-way decisions. However, the heterogeneous situation information, attribute relevance, and adaptive information processing needs in complex battlefield environment bring challenges to existing methods. Therefore, this paper proposes a new multi-target three-way threat assessment method with heterogeneous information and attribute relevance. Firstly, dynamic assessment information is represented by heterogeneous information, and attribute weights are calculated by heterogeneous Criteria Importance Through Intercriteria Correlation (CRITIC). Then, the conditional probability is calculated by the heterogeneous weighted Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), and the adaptive risk avoidance coefficients are constructed by calculating the uncertainty of the assessment value, and then the relative loss function matrices are constructed. Finally, the comprehensive loss function matrices are obtained by the weighted Heronian mean (HM) operator, and the comprehensive thresholds are calculated to obtain the three-way rules. The case study shows that compared with the existing methods, the proposed method can effectively handle the heterogeneous information and attribute relevance, and obtain the risk avoidance coefficients without presetting or field subjective settings, which is more suitable for the complex mission environment.
- 27 February 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (5) , 691
Open AccessA New Multi-Target Three-Way Threat Assessment Method with Heterogeneous Information and Attribute Relevance
Target threat assessment provides support for combat decision making. The multi-target threat assessment method based on a three-way decision can obtain threat classification while receiving threat ranking, thus avoiding the limitation of traditional two-way decisions. However, the heterogeneous situation information, attribute relevance, and adaptive information processing needs in complex battlefield environment bring challenges to existing methods. Therefore, this paper proposes a new multi-target three-way threat assessment method with heterogeneous information and attribute relevance. Firstly, dynamic assessment information is represented by heterogeneous information, and attribute weights are calculated by heterogeneous Criteria Importance Through Intercriteria Correlation (CRITIC). Then, the conditional probability is calculated by the heterogeneous weighted Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), and the adaptive risk avoidance coefficients are constructed by calculating the uncertainty of the assessment value, and then the relative loss function matrices are constructed. Finally, the comprehensive loss function matrices are obtained by the weighted Heronian mean (HM) operator, and the comprehensive thresholds are calculated to obtain the three-way rules. The case study shows that compared with the existing methods, the proposed method can effectively handle the heterogeneous information and attribute relevance, and obtain the risk avoidance coefficients without presetting or field subjective settings, which is more suitable for the complex mission environment.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 17388-17401
Joint 3-D Trajectory and Power Optimization for Dual-UAV-Assisted Short-Packet Covert Communications
This paper investigates a dual-unmanned aerial vehicle (UAV) assisted short packet covert communication system in the presence of a warden. Specifically, one flying UAV serves as the base station to transmit covert information to a legitimate ground user, and the other flying UAV is deployed as a cooperative jammer to transmit artificial noise against detection by a warden. Considering a more practical scenario, where only imperfect location information of the warden is known at both UAVs, we jointly optimize both UAVs’ transmit powers and three-dimensional (3D) trajectories to maximize the average covert transmission rate under the constraints of both UAVs’ mobility, transmit powers and warden’s detection error probability (DEP). On the one hand, the incomplete Gamma function involved in warden’s DEP makes the covertness constraint intractable for further analysis. To facilitate the design, warden’s DEP is lower bounded by Pinsker’s inequality. On the other hand, the formulated optimization problem is intractable to solve directly owing to the multiple highly coupled variables and the uncertainty of the warden’s location. The alternating optimization algorithm combined with the successive convex approximation and S-procedure techniques is leveraged to solve three optimization subproblems iteratively. Numerical results reveal that superior performance can be achieved by employing the proposed joint optimization of both UAVs’ transmit powers and 3D trajectories algorithm compared with the traditional two-dimensional trajectory optimization algorithm and the scheme without the assistance of the cooperative UAV.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 17388-17401
Joint 3-D Trajectory and Power Optimization for Dual-UAV-Assisted Short-Packet Covert Communications
This paper investigates a dual-unmanned aerial vehicle (UAV) assisted short packet covert communication system in the presence of a warden. Specifically, one flying UAV serves as the base station to transmit covert information to a legitimate ground user, and the other flying UAV is deployed as a cooperative jammer to transmit artificial noise against detection by a warden. Considering a more practical scenario, where only imperfect location information of the warden is known at both UAVs, we jointly optimize both UAVs’ transmit powers and three-dimensional (3D) trajectories to maximize the average covert transmission rate under the constraints of both UAVs’ mobility, transmit powers and warden’s detection error probability (DEP). On the one hand, the incomplete Gamma function involved in warden’s DEP makes the covertness constraint intractable for further analysis. To facilitate the design, warden’s DEP is lower bounded by Pinsker’s inequality. On the other hand, the formulated optimization problem is intractable to solve directly owing to the multiple highly coupled variables and the uncertainty of the warden’s location. The alternating optimization algorithm combined with the successive convex approximation and S-procedure techniques is leveraged to solve three optimization subproblems iteratively. Numerical results reveal that superior performance can be achieved by employing the proposed joint optimization of both UAVs’ transmit powers and 3D trajectories algorithm compared with the traditional two-dimensional trajectory optimization algorithm and the scheme without the assistance of the cooperative UAV.
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10187-10199
Joint Information-Theoretic Secrecy and Covertness for UAV-Assisted Wireless Transmission With Finite Blocklength
In this paper, we study a novel joint information-theoretic secrecy and covertness model for an unmanned aerial vehicle (UAV)-assisted finite blocklength transmission system, in which an UAV delivers classified information to a ground user (Bob) in the presence of two unauthorized users (Eve and Willie). Specifically, Eve tries to decode the legitimate information while Willie tries to detect if the UAV's transmission is present or not. Firstly, we assume that the perfect location knowledge of both Eve and Willie is known at the UAV. In this scenario, to guarantee security and covertness, the average secrecy rate maximization problem is formulated via joint design of the UAV's transmit power and three dimensional (3D) trajectory under Willie's covertness constraint. Technically speaking, the optimization problem is non-convex and mathematically intractable to tackle owing to the coupling of multiple variables. To address this non-convex problem, an iterative alternating optimization (AO) algorithm is developed with the assistance of the successive convex approximation (SCA) technique. After that, we extend the system model to both Eve's and Willie's imperfect location knowledge case, which is more sophisticated compared to the perfect location knowledge case due to the uncertain location constraints. We still utilize the iterative AO algorithm combined with SCA and $\mathcal {S}$ -procedure techniques to cope with the nonconvex problem. Numerical results indicate that our proposed 3D optimization algorithm performs better than the conventional two dimensional (2D) scheme and the benchmark scheme for both perfect and imperfect location knowledge cases.
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10187-10199
Joint Information-Theoretic Secrecy and Covertness for UAV-Assisted Wireless Transmission With Finite Blocklength
In this paper, we study a novel joint information-theoretic secrecy and covertness model for an unmanned aerial vehicle (UAV)-assisted finite blocklength transmission system, in which an UAV delivers classified information to a ground user (Bob) in the presence of two unauthorized users (Eve and Willie). Specifically, Eve tries to decode the legitimate information while Willie tries to detect if the UAV's transmission is present or not. Firstly, we assume that the perfect location knowledge of both Eve and Willie is known at the UAV. In this scenario, to guarantee security and covertness, the average secrecy rate maximization problem is formulated via joint design of the UAV's transmit power and three dimensional (3D) trajectory under Willie's covertness constraint. Technically speaking, the optimization problem is non-convex and mathematically intractable to tackle owing to the coupling of multiple variables. To address this non-convex problem, an iterative alternating optimization (AO) algorithm is developed with the assistance of the successive convex approximation (SCA) technique. After that, we extend the system model to both Eve's and Willie's imperfect location knowledge case, which is more sophisticated compared to the perfect location knowledge case due to the uncertain location constraints. We still utilize the iterative AO algorithm combined with SCA and $\mathcal {S}$ -procedure techniques to cope with the nonconvex problem. Numerical results indicate that our proposed 3D optimization algorithm performs better than the conventional two dimensional (2D) scheme and the benchmark scheme for both perfect and imperfect location knowledge cases.
- 1 July 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 125, 69-80
A consensus model for heterogeneous multi-attribute group decision making with several attribute sets
- 1 July 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 125, 69-80
A consensus model for heterogeneous multi-attribute group decision making with several attribute sets
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Wireless and Mobile Computing
- Vol. 16 (3) , 222
A novel quantum-inspired binary wolf pack algorithm for difficult knapsack problem
0-1 knapsack problem is a classical combinatorial optimisation problem, which is often used to validate the search performance of intelligent algorithms. Although the Binary Wolf Pack Algorithm (BWPA) can provide an effective solution to the general knapsack problem, it cannot achieve satisfactory optimisation results for the difficult knapsack problems. In order to improve the BWPA's searching ability in a difficult knapsack problem which has not been well resolved, a novel Quantum-Inspired WPA (QWPA) based on quantum encoding to enhance the performance of BWPA is presented. In this paper, the detailed quantitative design with a modified form of quantum collapse for the three important behaviours in QWPA is proposed and a new diversity analysis mechanism to verify the diversity of the proposed algorithm is given. Numerical simulation is obtained to show that the QWPA has a comparative performance than other quantum-inspired algorithms in solving the difficult knapsack problems.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Wireless and Mobile Computing
- Vol. 16 (3) , 222
A novel quantum-inspired binary wolf pack algorithm for difficult knapsack problem
0-1 knapsack problem is a classical combinatorial optimisation problem, which is often used to validate the search performance of intelligent algorithms. Although the Binary Wolf Pack Algorithm (BWPA) can provide an effective solution to the general knapsack problem, it cannot achieve satisfactory optimisation results for the difficult knapsack problems. In order to improve the BWPA's searching ability in a difficult knapsack problem which has not been well resolved, a novel Quantum-Inspired WPA (QWPA) based on quantum encoding to enhance the performance of BWPA is presented. In this paper, the detailed quantitative design with a modified form of quantum collapse for the three important behaviours in QWPA is proposed and a new diversity analysis mechanism to verify the diversity of the proposed algorithm is given. Numerical simulation is obtained to show that the QWPA has a comparative performance than other quantum-inspired algorithms in solving the difficult knapsack problems.
- Open Access
- 20 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 73328-73340
UAV Swarm Cooperative Situation Perception Consensus Evaluation Method Based on Three-Parameter Interval Number and Heronian Mean Operator
UAV swarm cooperative situation perception consensus (SPC), a core part of swarm cooperative situation awareness (SA) consensus, directly influences whether a swarm could gain information superiority under complex mission environments. The related studies of evaluation indices and methods for UAV swarm cooperative SPC are not sufficient and are not very suitable for complex mission environments, e.g. battlefield or combat simulation environment, this paper systematically analyzes the connotation of swarm cooperative SPC, establishes the evaluation indices via information quality evaluation theory and proposes evaluation method of swarm cooperative SPC based on three-parameter interval number and Heronian mean (HM) operator. The proposed method includes developing a new method to represent multi-time evaluation indices by three-parameter interval number, proposing a variable weight strategy to obtain index weight and aggregating index information by three-parameter interval number weighted HM operator. The simulation results show that the established evaluation attributes can reasonably analyze the swarm cooperative SPC and the proposed approach can effectively deal with the uncertainty of situation information; HM operator is superior to multiplicative synthesis in representing the correlations among attributes; compared to the evaluation method based on combined weights, the proposed approach has a better performance in the discrimination, which is more beneficial to the comparison of swarm cooperative SPC in different conditions.
- 20 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 73328-73340
Open AccessUAV Swarm Cooperative Situation Perception Consensus Evaluation Method Based on Three-Parameter Interval Number and Heronian Mean Operator
UAV swarm cooperative situation perception consensus (SPC), a core part of swarm cooperative situation awareness (SA) consensus, directly influences whether a swarm could gain information superiority under complex mission environments. The related studies of evaluation indices and methods for UAV swarm cooperative SPC are not sufficient and are not very suitable for complex mission environments, e.g. battlefield or combat simulation environment, this paper systematically analyzes the connotation of swarm cooperative SPC, establishes the evaluation indices via information quality evaluation theory and proposes evaluation method of swarm cooperative SPC based on three-parameter interval number and Heronian mean (HM) operator. The proposed method includes developing a new method to represent multi-time evaluation indices by three-parameter interval number, proposing a variable weight strategy to obtain index weight and aggregating index information by three-parameter interval number weighted HM operator. The simulation results show that the established evaluation attributes can reasonably analyze the swarm cooperative SPC and the proposed approach can effectively deal with the uncertainty of situation information; HM operator is superior to multiplicative synthesis in representing the correlations among attributes; compared to the evaluation method based on combined weights, the proposed approach has a better performance in the discrimination, which is more beneficial to the comparison of swarm cooperative SPC in different conditions.
- Open Access
- 1 July 2018
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 392 (6) , 062169
Target situation assessment based on twice variable weight strategy
How to reasonably calculate index weight is an important topic in target situation assessment and other information processing studies. The traditional method is to obtain the subjective weight and the objective weight respectively, and then calculate the summation by multiplying the given coefficients. However, the traditional method is constant weight summation, which could not adjust under different situation and easily lead to unreasonable result, and the coefficients are difficult to determine. This letter presents a twice variable weight strategy. The strategy could provide a better consideration of subjectivity and objectivity without additional coefficients, and adaptively adjust index weight as the situation changes. Experimental results demonstrate that the target situation assessment based on the proposed strategy is more reasonable than that under constant weight.
- 1 July 2018
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 392 (6) , 062169
Open AccessTarget situation assessment based on twice variable weight strategy
How to reasonably calculate index weight is an important topic in target situation assessment and other information processing studies. The traditional method is to obtain the subjective weight and the objective weight respectively, and then calculate the summation by multiplying the given coefficients. However, the traditional method is constant weight summation, which could not adjust under different situation and easily lead to unreasonable result, and the coefficients are difficult to determine. This letter presents a twice variable weight strategy. The strategy could provide a better consideration of subjectivity and objectivity without additional coefficients, and adaptively adjust index weight as the situation changes. Experimental results demonstrate that the target situation assessment based on the proposed strategy is more reasonable than that under constant weight.
- 6 November 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 113-121
Electronic Countermeasures Jamming Resource Optimal Distribution
- 6 November 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 113-121
Electronic Countermeasures Jamming Resource Optimal Distribution