Secrecy, Covertness and Authentication in Wireless Communications: Physical Layer Security Approach (Wireless Networks)

Preface
Acknowledgements
Contents
Acronyms
1 Introduction
	1.1 Wireless Communications
		1.1.1 Wireless Communication Systems
			1.1.1.1 Single-Hop Communication Systems
			1.1.1.2 Two-Hop Relay Systems
		1.1.2 Wireless Communication Networks
			1.1.2.1 Ad Hoc Networks
			1.1.2.2 Cellular Networks
			1.1.2.3 MIMO
	1.2 Fundamentals of Physical Layer Security
		1.2.1 Physical Layer Secure Communications
			1.2.1.1 Shannon\'s Cipher System
			1.2.1.2 Wyner\'s Degraded Wiretap Channel
			1.2.1.3 Physical Layer Secure Communication Techniques
		1.2.2 Physical Layer Covert Communications
			1.2.2.1 Covertness Under Neyman-Pearson Test
			1.2.2.2 Covertness Under Binary Hypothesis Test
			1.2.2.3 Covert Communication Techniques
		1.2.3 Physical Layer Authentication
			1.2.3.1 RFF-Based PLA
			1.2.3.2 Channel-Based PLA
	1.3 Outline of This Book
	References
2 Physical Layer Secure Communications
	2.1 Beamforming-Based Secure Communication
		2.1.1 System Model
		2.1.2 Optimal Beamforming Design
			2.1.2.1 Source Beamforming Design
			2.1.2.2 Relay Beamforming Design
		2.1.3 Implementable Sub-optimal Beamforming Design
			2.1.3.1 Beamforming Scheme Based on Wiener Prediction
			2.1.3.2 Beamforming Scheme Based on Asymptotic Approximation
		2.1.4 Numerical Results
			2.1.4.1 Simulation Setting
			2.1.4.2 Comparison of OP, WP, and AA
			2.1.4.3 Comparison of WP, AA, HD, and DT
		2.1.5 Conclusion
	2.2 Precoding-Based Secure Communication
		2.2.1 System Model
		2.2.2 Precoding Design
			2.2.2.1 Equivalent Transformations
			2.2.2.2 Alternate Optimization
			2.2.2.3 Solution for Problem (2.73)
			2.2.2.4 Solution for Problem (2.74)
			2.2.2.5 Special Case: SSRM
		2.2.3 GSVD-Based Low-Complexity Precoding Design
		2.2.4 Numerical Results
			2.2.4.1 Simulation Setting
			2.2.4.2 Convergence Performance
			2.2.4.3 Effect of Transmit Power
			2.2.4.4 Effect of Secrecy Rate Requirement
			2.2.4.5 Effect of Number of Antennas
		2.2.5 Conclusion
	2.3 Link Selection-Based Secure Communication
		2.3.1 System Model
		2.3.2 Link Selection Policies
			2.3.2.1 Transmission Scheduling
			2.3.2.2 Link Selection Policy with CSI Feedback
			2.3.2.3 Link Selection Policy Without CSI Feedback
		2.3.3 Performance Evaluation
			2.3.3.1 Secrecy Outage Probability
			2.3.3.2 Throughput and Secrecy Throughput
		2.3.4 Performance Optimization
		2.3.5 Numerical Results
			2.3.5.1 Simulation Settings
			2.3.5.2 Validation
			2.3.5.3 Performance Discussion
			2.3.5.4 Comparison Results
		2.3.6 Conclusion
	2.4 Relay Selection-Based Secure Communication
		2.4.1 System Model and Definitions
			2.4.1.1 System Model
			2.4.1.2 Buffer-Aided Relay Selection
		2.4.2 General Framework
			2.4.2.1 Source-Relay Delivery Process Modeling
			2.4.2.2 Relay-Destination Delivery Process Modeling
		2.4.3 E2E STP and Delay Analysis
			2.4.3.1 E2E STP Analysis
			2.4.3.2 E2E Delay Analysis
		2.4.4 Simulation Results
			2.4.4.1 Simulation Settings
			2.4.4.2 Model Validation
			2.4.4.3 Performance Discussion
			2.4.4.4 Security-Delay Tradeoff Analysis
		2.4.5 Conclusion
	2.5 Cooperative Jamming-Based Secure Communication
		2.5.1 System Model
			2.5.1.1 Network Model
			2.5.1.2 Antenna Model
			2.5.1.3 Blockage and Propagation Model
			2.5.1.4 Sight-Based Cooperative Jamming (SCJ) Scheme
			2.5.1.5 Performance Metrics
		2.5.2 Performance Analysis: Simplified Scenario
			2.5.2.1 Connection Probability
			2.5.2.2 Secrecy Probability
		2.5.3 Performance Analysis: General Scenario
			2.5.3.1 Connection Probability
			2.5.3.2 Secrecy Probability
			2.5.3.3 Optimal SCJ Parameters
		2.5.4 Numerical Results
			2.5.4.1 Optimal STC vs. Density of Potential Jammers λP
			2.5.4.2 Optimal STC vs. Density of Transmission Pairs λT
			2.5.4.3 Optimal STC and Energy Efficiency vs. Total Density Constraint
			2.5.4.4 Optimal STC vs. Density of Eavesdroppers λE
		2.5.5 Conclusion
	References
3 Physical Layer Covert Communications
	3.1 Covert Communication in Two-Way Relay Systems
		3.1.1 Prerequisites
			3.1.1.1 System Model
			3.1.1.2 Transmission Schemes
			3.1.1.3 Detection Schemes
			3.1.1.4 Covertness Strategies
		3.1.2 Four-Slot Transmission Scenario
			3.1.2.1 Ignorant Legitimate Nodes Case
			3.1.2.2 Smart Legitimate Nodes Case
		3.1.3 Three-Slot Transmission Scenario
			3.1.3.1 Ignorant Legitimate Nodes Case
			3.1.3.2 Smart Legitimate Nodes Case
		3.1.4 Two-Slot Transmission Scenario
			3.1.4.1 Ignorant Legitimate Nodes Case
			3.1.4.2 Smart Legitimate Nodes Case
		3.1.5 Conclusion
	3.2 Covert Communication in Full-Duplex Relay Systems
		3.2.1 System Model and Performance Metrics
			3.2.1.1 FD Mode
			3.2.1.2 HD Mode
			3.2.1.3 Covertness Requirement
			3.2.1.4 Performance Metrics
		3.2.2 Covert Rate Under FD Mode
			3.2.2.1 Instantaneous Covert Rate
			3.2.2.2 Average Covert Rate
		3.2.3 Covert Rate Under HD Mode
			3.2.3.1 Instantaneous Covert Rate
			3.2.3.2 Average Covert Rate
		3.2.4 Covert Rate Under Joint FD/HD Mode
			3.2.4.1 Instantaneous Covert Rate
			3.2.4.2 Average Covert Rate
		3.2.5 Numerical Results
			3.2.5.1 Analysis of Maximum Instantaneous Covert Rate
			3.2.5.2 Analysis of Average Covert Rate
		3.2.6 Conclusion
	3.3 Covert Communication in Two-Hop Relay Systems with Outdated CSI
		3.3.1 System Model and Preliminaries
			3.3.1.1 System Model
			3.3.1.2 Outdated CSI
			3.3.1.3 Transmission Process
			3.3.1.4 Source\'s Detection Strategy
		3.3.2 Successful Transmission Probability
			3.3.2.1 Derivations of p(0)su
			3.3.2.2 Derivations of p(1)su
			3.3.2.3 Derivations of p(2)su
		3.3.3 Performance Analysis Under RCT Scheme
			3.3.3.1 Derivation of Detection Error Probability
			3.3.3.2 Derivation of Covert Rate
			3.3.3.3 Max-Min DEP and CR Optimization Problems
		3.3.4 Performance Analysis Under PCT Scheme
			3.3.4.1 Derivation of Detection Error Probability
			3.3.4.2 Derivation of Covert Rate
			3.3.4.3 Max-Min DEP and CR Optimization Problems
		3.3.5 Simulation and Numerical Results
			3.3.5.1 Simulation Settings and Model Validation
			3.3.5.2 DEP Analysis Under Two Schemes
			3.3.5.3 CR Analysis Under Two Schemes
			3.3.5.4 Max-Min DEP and Maximal ECR
			3.3.5.5 The Impact of CSI Time Delay on ξ† and c*
			3.3.5.6 Joint Optimization of Qc, Pc, and η
		3.3.6 Conclusion
	References
4 Physical Layer Authentication
	4.1 RFF-Based PLA
		4.1.1 System Model
		4.1.2 Visibility Graph Entropy
			4.1.2.1 Visibility Graph
			4.1.2.2 Preprocessing
			4.1.2.3 VG Conversion
			4.1.2.4 Normalized Shannon Entropy
		4.1.3 Experimental Study
			4.1.3.1 Experiment Platform and Setup
			4.1.3.2 Data Processing and Device Identification
			4.1.3.3 Experimental Results
			4.1.3.4 Detailed Identification Gains
		4.1.4 Conclusion
	4.2 Channel-Based PLA
		4.2.1 System Model
			4.2.1.1 Network Model
			4.2.1.2 Channel Model
			4.2.1.3 Communication Model with Hardware Impairments
		4.2.2 Implementation of Channel-Based PLA
			4.2.2.1 Channel Estimation
			4.2.2.2 Hypothesis Testing
		4.2.3 False Alarm and Detection Probabilities
			4.2.3.1 No Spatial Correlation (|ρX|=0)
			4.2.3.2 Full Spatial Correlation (|ρX|=1)
			4.2.3.3 Partial Spatial Correlation (0<|ρX|<1)
		4.2.4 Numerical Results
			4.2.4.1 System Parameters and Simulation Setting
			4.2.4.2 Models of pF and pD Validation
			4.2.4.3 Authentication Performance Analysis
		4.2.5 Conclusion
	4.3 Hybrid PLA
		4.3.1 Communication and Phase Noise Model
		4.3.2 Implementation of Hybrid PLA
			4.3.2.1 Channel and Phase Noise Estimation
			4.3.2.2 Authentication Verification
		4.3.3 False Alarm and Detection Probabilities
			4.3.3.1 Nonsynchronous Mode
			4.3.3.2 Synchronous Mode
		4.3.4 Numerical Results
			4.3.4.1 System Parameters and Simulation Setting
			4.3.4.2 Validation Models for pF and pD
			4.3.4.3 Authentication Performance Comparison
			4.3.4.4 Impact of κh
			4.3.4.5 Impact of κδ
			4.3.4.6 Impact of α
		4.3.5 Conclusion
	References
5 Secure Routing
	5.1 Security/QoS-Aware Route Selection in Multi-hop Wireless Ad Hoc Networks
		5.1.1 System Model and Forwarding Strategies
			5.1.1.1 System Model
			5.1.1.2 Amplify-and-Forward
			5.1.1.3 Decode-and-Forward
		5.1.2 Outage Probabilities Analysis
			5.1.2.1 Link Outage Probabilities
			5.1.2.2 Route Outage Probabilities
			5.1.2.3 Comparison Between AF and DF
		5.1.3 Route Selection
		5.1.4 Numerical Results
		5.1.5 Conclusion
	5.2 Secure Routing for Optimal Secrecy-QoS Tradeoffs
		5.2.1 System Models
			5.2.1.1 Network Model
			5.2.1.2 Wireless Channel Model
		5.2.2 Outage Probabilities Analysis
			5.2.2.1 COP Analysis
			5.2.2.2 SOP Analysis
		5.2.3 Optimal Secrecy-QoS Tradeoffs
			5.2.3.1 SO-COP: Security-Based Optimal COP
			5.2.3.2 QO-SOP: QoS-Based Optimal SOP
		5.2.4 Routing Algorithm
			5.2.4.1 Routing Algorithm for SO-COP
			5.2.4.2 Routing Algorithm for QO-SOP
		5.2.5 Numerical Results and Discussions
			5.2.5.1 Simulation Settings
			5.2.5.2 Validation for COP and SOP
			5.2.5.3 Performance Tradeoffs
			5.2.5.4 Routing Performance
		5.2.6 Conclusion
	5.3 Secure Routing Design with Selfish Cooperative Jammers
		5.3.1 System Model
			5.3.1.1 Network Model
			5.3.1.2 Wireless Channel Model
		5.3.2 PLS Performance Modeling
		5.3.3 Incentive Mechanism Design
			5.3.3.1 Utility Function Design
			5.3.3.2 Jamming Power Determination
		5.3.4 Source Utility Maximization
		5.3.5 Routing Design
			5.3.5.1 IJS Routing Algorithm
			5.3.5.2 IJS Routing Implementation
		5.3.6 Simulation Results
			5.3.6.1 Validation of PLS Performance Evaluation
			5.3.6.2 Routing Performance
		5.3.7 Conclusion
	References
6 Summary
	6.1 Concluding Remarks
	6.2 Challenges and Future Directions