Physical layer security (PLS) has been extensively explored as an alternative to conventional cryptographic schemes for securing wireless links. Many studies have shown that the cooperation between ...the legitimate nodes of a network can significantly enhance their secret communications performance, relative to the noncooperative case. Motivated by the importance of this class of PLS systems, this paper provides a comprehensive survey of the recent works on cooperative relaying and jamming techniques for securing wireless transmissions against eavesdropping nodes, which attempt to intercept the transmissions. First, it provides a in-depth overview of various secure relaying strategies and schemes. Next, a review of recently proposed solutions for cooperative jamming techniques is provided with an emphasis on power allocation and beamforming techniques. Then, the latest developments in hybrid techniques, which use both cooperative relaying and jamming, are elaborated. Finally, several key challenges in the domain of cooperative security are presented along with an extensive discussion on the applications of cooperative security in key enablers for 5G communications, such as nonorthogonal multiple access, device-to-device communications, and massive multiple-input multiple-output systems.
UAV-Enabled Communication Using NOMA Nasir, Ali Arshad; Tuan, Hoang Duong; Duong, Trung Q. ...
IEEE transactions on communications,
07/2019, Letnik:
67, Številka:
7
Journal Article
Recenzirano
Odprti dostop
Unmanned aerial vehicles (UAVs) can be deployed as flying base stations (BSs) to leverage the strength of line-of-sight connections and effectively support the coverage and throughput of wireless ...communication. This paper considers a multiuser communication system, in which a single-antenna UAV-BS serves a large number of ground users by employing non-orthogonal multiple access (NOMA). The max-min rate optimization problem is formulated under total power, total bandwidth, UAV altitude, and antenna beamwidth constraints. The objective of max-min rate optimization is non-convex in all optimization variables, i.e., UAV altitude, transmit antenna beamwidth, power allocation, and bandwidth allocation for multiple users. A path-following algorithm is proposed to solve the formulated problem. Next, orthogonal multiple access (OMA) and dirty paper coding (DPC)-based max-min rate optimization problems are formulated and respective path-following algorithms are developed to solve them. The numerical results show that NOMA outperforms OMA and achieves rates similar to those attained by DPC. In addition, a clear rate gain is observed by jointly optimizing all the parameters rather than optimizing a subset of parameters, which confirms the desirability of their joint optimization.
We consider the cell-free massive multiple-input multiple-output (MIMO) downlink, where a very large number of distributed multiple-antenna access points (APs) serve many single-antenna users in the ...same time-frequency resource. A simple (distributed) conjugate beamforming scheme is applied at each AP via the use of local channel state information (CSI). This CSI is acquired through time-division duplex operation and the reception of uplink training signals transmitted by the users. We derive a closed-form expression for the spectral efficiency taking into account the effects of channel estimation errors and power control. This closed-form result enables us to analyze the effects of backhaul power consumption, the number of APs, and the number of antennas per AP on the total energy efficiency, as well as, to design an optimal power allocation algorithm. The optimal power allocation algorithm aims at maximizing the total energy efficiency, subject to a per-user spectral efficiency constraint and a per-AP power constraint. Compared with the equal power control, our proposed power allocation scheme can double the total energy efficiency. Furthermore, we propose AP selections schemes, in which each user chooses a subset of APs, to reduce the power consumption caused by the backhaul links. With our proposed AP selection schemes, the total energy efficiency increases significantly, especially for large numbers of APs. Moreover, under a requirement of good quality-of-service for all users, cell-free massive MIMO outperforms the colocated counterpart in terms of energy efficiency.
Key generation from the randomness of wireless channels is a promising alternative to public key cryptography for the establishment of cryptographic keys between any two users. This paper reviews the ...current techniques for wireless key generation. The principles, performance metrics and key generation procedure are comprehensively surveyed. Methods for optimizing the performance of key generation are also discussed. Key generation applications in various environments are then introduced along with the challenges of applying the approach in each scenario. The paper concludes with some suggestions for future studies.
In this paper, we investigate secure device-to-device (D2D) communication in energy harvesting large-scale cognitive cellular networks. The energy constrained D2D transmitter harvests energy from ...multiantenna equipped power beacons (PBs), and communicates with the corresponding receiver using the spectrum of the primary base stations (BSs). We introduce a power transfer model and an information signal model to enable wireless energy harvesting and secure information transmission. In the power transfer model, three wireless power transfer (WPT) policies are proposed: 1) co-operative power beacons (CPB) power transfer, 2) best power beacon (BPB) power transfer, and 3) nearest power beacon (NPB) power transfer. To characterize the power transfer reliability of the proposed three policies, we derive new expressions for the exact power outage probability. Moreover, the analysis of the power outage probability is extended to the case when PBs are equipped with large antenna arrays. In the information signal model, we present a new comparative framework with two receiver selection schemes: 1) best receiver selection (BRS), where the receiver with the strongest channel is selected; and 2) nearest receiver selection (NRS), where the nearest receiver is selected. To assess the secrecy performance, we derive new analytical expressions for the secrecy outage probability and the secrecy throughput considering the two receiver selection schemes using the proposed WPT policies. We presented Monte carlo simulation results to corroborate our analysis and show: 1) secrecy performance improves with increasing densities of PBs and D2D receivers due to larger multiuser diversity gain; 2) CPB achieves better secrecy performance than BPB and NPB but consumes more power; and 3) BRS achieves better secrecy performance than NRS but demands more instantaneous feedback and overhead. A pivotal conclusion is reached that with increasing number of antennas at PBs, NPB offers a comparable secrecy performance to that of BPB but with a lower complexity.
In this paper, we investigate a mobile edge computing (MEC) network, where the user has some computational tasks to be assisted by multiple computational access points (CAPs) through offloading. We ...consider practical communication scenarios with limited spectrum resources, and the cochannel interference arising from the aggressive reuse of frequency severely degrades the system offloading performance. To enhance the system performance, we provide three CAP selection criteria to choose one best CAP among multiple ones. Specifically, criterion I maximizes the computational capability at the CAP, criterion II minimizes the interfering power, while criterion III maximizes the instantaneous channel gain of data link. In time-varying channel environments, the CAP selection may be outdated, which deteriorates the system performance. For the three criteria, we evaluate the system outage probability in the outdated channel state information (CSI) by taking into account the latency, energy consumption and data rate, and provide the analytical and asymptotic expressions of outage probability, from which we obtain some critical insights on the system design. Simulation results are finally demonstrated to verify the proposed studies. In particular, criterion III under the perfect CSI can achieve the system whole diversity order coming from multiple CAPs.
A wireless network of multiple transmitter-user pairs overheard by an eavesdropper, where the transmitters are equipped with multiple antennas, while the users and eavesdropper are equipped with a ...single antenna, is considered. At different levels of wireless channel knowledge, the problem of interest is beamforming to optimize the users' quality-of-service (QoS) in terms of their secrecy throughputs or maximize the network's energy efficiency under users' QoS. All these problems are seen as very difficult optimization problems with many nonconvex constraints and nonlinear equality constraints in beamforming vectors. The paper develops path-following computational procedures of low complexity and rapid convergence for the optimal beamforming solution. Their practicability is demonstrated through numerical examples.
A communication system is considered consisting of a full-duplex multiple-antenna base station (BS) and multiple single-antenna downlink users (DLUs) and single-antenna uplink users (ULUs), where the ...latter need to harvest energy for transmitting information to the BS. The communication is thus divided into two phases. In the first phase, the BS uses all available antennas for conveying information to DLUs and wireless energy to ULUs via information and energy beamforming, respectively. In the second phase, ULUs send their independent information to the BS using their harvested energy while the BS transmits the information to the DLUs. In both the phases, the communication is operated at the same time and over the same frequency band. The aim is to maximize the sum rate and energy efficiency under ULU achievable information throughput constraints by jointly optimizing beamforming and time allocation. The utility functions of interest are nonconcave and the involved constraints are nonconvex, so these problems are computationally troublesome. To address them, path-following algorithms are proposed to arrive at least at local optima. The proposed algorithms iteratively improve the objectives with convergence guaranteed. Simulation results demonstrate that they achieve rapid convergence and outperform conventional solutions.
This paper considers a network consisting of a multiple antenna array access point serving multiple single antenna downlink users with the assistance of a reconfigurable intelligent surface (RIS). ...The reflecting coefficients of the RIS can be programmed to ensure that the signals reflected from the RIS elements add coherently at the users. The joint design of these programmable reflecting coefficients and transmit beamforming to maximize the users' worst rate is addressed. Under either proper Gaussian signaling (PGS) or improper Gaussian signaling (IGS), the design poses a very computationally challenging nonconvex problem. Based on their exactly penalized optimization reformulation, which incorporates the computationally intractable unit-modulus constraints on the reflecting coefficients into the optimization objectives, new iterative algorithms of low computational complexity, which converge at least to a locally optimal solution, are developed. The provided simulations show not only the benefit of using the RIS, but also the advantage of IGS over PGS in delivering higher rates to users.
This paper studies the security aspect of a recently introduced "cell-free massive MIMO" network under a pilot spoofing attack. First, a simple method to recognize the presence of this type of an ...active eavesdropping attack to a particular user is shown. In order to deal with this attack, we consider the problem of maximizing the achievable data rate of the attacked user or its achievable secrecy rate. The corresponding problems of minimizing the power consumption subject to security constraints are also considered in parallel. Path-following algorithms are developed to solve the posed optimization problems under different power allocation to access points (APs). Under equip-power allocation to APs, these optimization problems admit closed-form solutions. Numerical results show their efficiency.
PDF
