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.
23 January 2024 in IEEE Internet of Things Journal
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.
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.
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.
1 January 2019 in International Journal of Wireless and Mobile Computing
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.