Aerial Cooperative Jamming for Cellular-Enabled UAV Secure Communication Network: Joint Trajectory and Power Control Design

To improve the secrecy performance of cellular-enabled unmanned aerial vehicle (UAV) communication networks, this paper proposes an aerial cooperative jamming scheme and studies its optimal design to achieve the maximum average secrecy rate. Specifically, a base station (BS) transmits confidential messages to a UAV and meanwhile another UAV performs the role of an aerial jammer by cooperatively sending jamming signals to oppose multiple suspicious eavesdroppers on the ground. As the UAVs have the advantage of the controllable mobility, the objective is to maximize the worst-case average secrecy rate by the joint optimization of the two UAVs’ trajectories and the BS’s/UAV jammer’s transmit/jamming power over a given mission period. The objective function of the formulated problem is highly non-linear regarding the optimization variables and the problem has non-convex constraints, which is, in general, difficult to achieve a globally optimal solution. Thus, we divide the original problem into four subproblems and then solve them by applying the successive convex approximation (SCA) and block coordinate descent (BCD) methods. Numerical results demonstrate that the significantly better secrecy performance can be obtained by using the proposed algorithm in comparison with benchmark schemes.

Download Full-text

Robust Secure Beamforming Design for Cooperative Cognitive Radio Nonorthogonal Multiple Access Networks

Security and Communication Networks ◽

10.1155/2021/5526485 ◽

2021 ◽

Vol 2021 ◽

pp. 1-9

Author(s):

Quanzhong Li ◽

Sai Zhao

Keyword(s):

Cognitive Radio ◽

Secure Communication ◽

Multiple Access ◽

Spectrum Efficiency ◽

Maximization Problem ◽

Artificial Noise ◽

Practical Case ◽

Secrecy Rate ◽

Worst Case ◽

Rank One

By the integration of cooperative cognitive radio (CR) and nonorthogonal multiple access (NOMA), cooperative CR NOMA networks can improve the spectrum efficiency of wireless networks significantly. Due to the openness and exposure of wireless signals, secure communication is an important issue for cooperative CR NOMA networks. In this paper, we investigate the physical layer security design for cooperative CR NOMA networks. Our objective is to achieve maximum secrecy rate of the secondary user by designing optimal beamformers and artificial noise covariance matrix at the multiantenna secondary transmitter under the quality-of-service at the primary user and the transmit power constraint at the secondary transmitter. We consider the practical case that the channel state information (CSI) of the eavesdropper is imperfect, and we model the imperfect CSI by the worst-case model. We show that the robust secrecy rate maximization problem can be transformed to a series of semidefinite programmings based on S-procedure and rank-one relaxation. We also propose an effective method to recover the optimal rank-one solution. Simulations are provided to show the effectiveness of our proposed robust secure algorithm with comparison to the nonrobust secure design and traditional orthogonal multiple access schemes.

Download Full-text

Robust Destination Jamming Aided Secrecy Precoding for an AF MIMO Untrusted Relay System

Wireless Communications and Mobile Computing ◽

10.1155/2019/1081682 ◽

2019 ◽

Vol 2019 ◽

pp. 1-9 ◽

Cited By ~ 1

Author(s):

Feng Zhou ◽

Rugang Wang ◽

Jiahong Bian

Keyword(s):

Relay Network ◽

Amplify And Forward ◽

Secrecy Rate ◽

Relay System ◽

Worst Case ◽

Alternating Optimization ◽

Cooperative Jamming ◽

Sign Definiteness ◽

The Difference ◽

Untrusted Relay

We consider a secrecy dual-hop amplify-and-forward (AF) untrusted relay network, where the relay is willing to forward the signal to the destination while acting as a potential eavesdropper. Assuming that all these nodes are equipped with multiple antennas, we propose a joint destination aided cooperative jamming and precoding at both the source and the relay scheme, with the objective to maximize the worst case secrecy rate. The formulated problem is highly non-convex due to the maximization of the difference of several logarithmic determinant (log-det) functions in the CSI uncertainty region. To handle this challenge, we propose to linearize these log-det terms. After linearization, we tackle the CSI uncertainty based on epigraph reformulation and the sign-definiteness lemma. Finally, an alternating optimization (AO) algorithm is proposed to solve the reformulated problem. Numerical results are provided to demonstrate the performance of the proposed scheme.

Download Full-text

Joint Power Allocation at the Base Station and the Relay for Untrusted Relay Cooperation OFDMA Network

International Journal of Antennas and Propagation ◽

10.1155/2015/530632 ◽

2015 ◽

Vol 2015 ◽

pp. 1-15 ◽

Cited By ~ 1

Author(s):

Weiheng Jiang ◽

Wenjiang Feng

Keyword(s):

Access Control ◽

Power Allocation ◽

Secure Communication ◽

Base Station ◽

Optimization Approach ◽

Transmission Power ◽

Secrecy Rate ◽

Joint Power ◽

Mobile Stations ◽

Allocation Algorithms

The secure communication that multiple OFDMA-based cell-edge mobile stations (MS) can only transmit confidential messages to base station (BS) through an untrusted intermediate relay (UR) is discussed. Specifically, with the destination-based jamming (DBJ) scheme and fixed MS transmission power assumption, our focus is on the joint BS and US power allocation to maximize system sum secrecy rate. We first analyze the challenges in solving this problem. The result indicates that our nonconvex joint power allocation is equivalent to a joint MS access control and power allocation. Then, by problem relaxation and the alternating optimization approach, two suboptimal joint MS access control and power allocation algorithms are proposed. These algorithms alternatively solve the subproblem of joint BS and UR power allocation and the subproblem of MS selection until system sum secrecy rate is nonincreasing. In addition, the convergence and computational complexity of the proposed algorithms are analyzed. Finally, simulations results are presented to demonstrate the performance of our proposed algorithms.

Download Full-text

Secrecy Energy-Efficient UAV Communication via Trajectory Design and Power Control

Wireless Communications and Mobile Computing ◽

10.1155/2021/9969311 ◽

2021 ◽

Vol 2021 ◽

pp. 1-10

Author(s):

An Li ◽

Huohuo Han ◽

Chuanxin Yu

Keyword(s):

Communication System ◽

Large Scale ◽

Descent Method ◽

Performance Comparison ◽

Approximation Technique ◽

Flight Period ◽

Trajectory Design ◽

Secrecy Rate ◽

Worst Case ◽

Aerial Vehicle

This paper investigates the problem of maximizing the secrecy energy efficiency (SEE) for unmanned aerial vehicle- (UAV-) to-ground wireless communication system, in which a fixed-wing UAV tries to transmit covert information to a terrestrial legitimate destination receiver with multiple terrestrial eavesdroppers. In particular, we intend to maximize the worst-case SEE of UAV by jointly optimizing UAV’s flight trajectory and transmit power over a finite flight period. However, the formulated problem is challenging to solve because of its large-scale nonconvexity. For efficiently solving this problem, we first decouple the above optimization problem into two subproblems and then propose an alternating iterative algorithm by adopting block coordinate descent method and Dinkelbach’s algorithm as well as successive convex approximation technique to seek a suboptimal solution. For the sake of performance comparison, two benchmark schemes, the secrecy rate maximization (SRM) scheme and constrained energy minimization (CEM) scheme are considered to obtain more useful insights. Finally, simulation results are executed to verify that our proposed SEE maximization (SEEM) algorithm is superior to two benchmark schemes for the UAV-ground communication system.

Download Full-text

Secure Performance of an Untrusted AF Relay System with a Friendly Wireless Powered Jammer

Mobile Information Systems ◽

10.1155/2019/6968730 ◽

2019 ◽

Vol 2019 ◽

pp. 1-8

Author(s):

An Li ◽

Nong Qu

Keyword(s):

Secure Communication ◽

A Priori ◽

Exact Expression ◽

Initial Energy ◽

Cooperative Networks ◽

Performance Comparison ◽

Secrecy Rate ◽

Cooperative Jamming ◽

Power Region ◽

Untrusted Relay

We propose a jam-then-harvest protocol for dual-hop cooperative networks with an untrusted relay, where an external friendly jammer helps keep information secret from the untrusted relay by transmitting a priori jamming signal for the destination. In particular, the wireless powered jammer scavenges energy from the received forwarded signal and recovers its initial energy to perform jamming in next time slot. We analytically derive an exact expression of the probability of nonzero secrecy rate (PNSR) for the proposed jam-then-harvest protocol. For performance comparison, cooperative jamming with the constant power supply is provided as a lower bound benchmark. Our results show that the proposed protocol not only can achieve the secure communication but also can harvest the enough energy without a loss of performance in the low jamming power region.

Download Full-text

Average Worst-Case Secrecy Rate Maximization via UAV and Base Station Resource Allocation

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) ◽

10.1109/allerton.2019.8919955 ◽

2019 ◽

Cited By ~ 1

Author(s):

Shakil Ahmed ◽

Boulat A. Bash

Keyword(s):

Resource Allocation ◽

Base Station ◽

Secrecy Rate ◽

Worst Case ◽

Rate Maximization

Download Full-text

Secrecy Wireless-Powered Sensor Networks for Internet of Things

Wireless Communications and Mobile Computing ◽

10.1155/2020/8859264 ◽

2020 ◽

Vol 2020 ◽

pp. 1-12

Author(s):

Junxia Li ◽

Hui Zhao ◽

Xueyan Chen ◽

Zheng Chu ◽

Li Zhen ◽

...

Keyword(s):

Time Allocation ◽

Optimization Problem ◽

Optimal Solution ◽

Access Point ◽

Case Scenario ◽

Secrecy Rate ◽

Global Optimal Solution ◽

Worst Case ◽

Sdp Relaxation ◽

Global Optimal

This paper investigates a secure wireless-powered sensor network (WPSN) with the aid of a cooperative jammer (CJ). A power station (PS) wirelessly charges for a user equipment (UE) and the CJ to securely transmit information to an access point (AP) in the presence of multiple eavesdroppers. Also, the CJ are deployed, which can introduce more interference to degrade the performance of the malicious eavesdroppers. In order to improve the secure performance, we formulate an optimization problem for maximizing the secrecy rate at the AP to jointly design the secure beamformer and the energy time allocation. Since the formulated problem is not convex, we first propose a global optimal solution which employs the semidefinite programming (SDP) relaxation. Also, the tightness of the SDP relaxed solution is evaluated. In addition, we investigate a worst-case scenario, where the energy time allocation is achieved in a closed form. Finally, numerical results are presented to confirm effectiveness of the proposed scheme in comparison to the benchmark scheme.

Download Full-text

Optimal UAV Deployment and Resource Management in UAV Relay Networks

Sensors ◽

10.3390/s21206878 ◽

2021 ◽

Vol 21 (20) ◽

pp. 6878

Author(s):

Sang Ik Han ◽

Jaeuk Baek

Keyword(s):

Resource Allocation ◽

Three Dimensional ◽

Optimal Solution ◽

Relay Node ◽

Base Station ◽

Computational Effort ◽

Relay Network ◽

Relay Location ◽

Aerial Vehicle ◽

A Cell

UAV equipped three-dimensional (3D) wireless networks can provide a solution for the requirements of 5G communications, such as enhanced Mobile Broadband (eMBB) and massive Machine Type Communications (mMTC). Especially, the introduction of an unmanned aerial vehicle (UAV) as a relay node can improve the connectivity, extend the terrestrial base station (BS) coverage and enhance the throughput by taking advantage of a strong air-to-ground line of sight (LOS) channel. In this paper, we consider the deployment and resource allocation of UAV relay network (URN) to maximize the throughput of user equipment (UE) within a cell, while guaranteeing a reliable transmission to UE outside the coverage of BS. To this end, we formulate joint UAV deployment and resource allocation problems, whose analytical solutions can be hardly obtained, in general. We propose a fast and practical algorithm to provide the optimal solution for the number of transmit time slots and the UAV relay location in a sequential manner. The transmit power at BS and UAV is determined in advance based on the availability of channel state information (CSI). Simulation results demonstrate that the proposed algorithms can significantly reduce the computational effort and complexity to determine the optimal UAV location and transmit time slots over an exhaustive search.

Download Full-text