Radio frequency fingerprint identification (RFFI) is a physical layer security methodology to recognize individual devices by leveraging hardware imperfections inevitably induced in the manufacturing process. However, the performance degradation caused by the time-varying channel impacts and interferences has severely restricted the development of RFFI. To this end, we present a channel-agnostic RFFI system, which consists of three modules, i.e., signal preprocessing module, feature extraction module, and classification module. In the signal preprocessing module, we first propose a novel approach, referred to as limiter-based spectral circular shift bidirectional division (LB-SCSBD), to generate two parallel spectral quotient (SQ) sequences. Then, we define the spectral quotient constellation (SQC) symbols according to different modulation formats, and thereby transform the SQ sequences into four magnitude-based sequences in terms of two channel-robust signal representations, i.e., the SQ magnitude (SQM) and SQC error vector magnitude (SQC-EVM). In the feature extraction module, we present a moment-based statistical feature extractor (MB-SFE) to extract the device-specific information from the above four sequences. In the classification module, the extracted statistics are fed into the multi-class support vector machine (SVM) for training and testing. We take WiFi as a case study and evaluate the performance of the proposed RFFI system by classifying eight simulated device models and six universal software radio peripheral (USRP) transmitter radios. Experimental results show that (i) the proposed method achieves the accuracies of 99.84% and 98.26% with eight devices in QPSK and 16QAM cases, as well as the accuracy of 92.42% with six USRP devices (ii) the proposed method exhibits superior classification performance in comparison to some existing RFFI methods, leading to a significant accuracy improvement of at least 38.33%.
6 January 2025 in IEEE Transactions on Vehicular Technology
Integrated sensing and communication (ISAC) is a foundational technology for sixth-generation (6G) networks, with networked ISAC enabling multiple distributed sensing nodes to collaborate in target detection. This paper addresses the critical challenge of managing dynamic interference in cooperative ISAC systems, focusing on fast-moving unmanned aerial vehicles (UAVs) operating in complex propagation environments. Rapid UAV motion induces significant Doppler shifts and fluctuating interference, leading to uneven signal quality and degraded detection performance, particularly in high-interference zones. To tackle this, we propose a fairness-based resource allocation framework that prioritizes the weakest links by maximizing the minimum radar sensing signal-to-interference-plus-noise ratio (SINR). We formulate a joint optimization problem for ISAC beamforming and target allocation, ensuring communication quality of service (QoS) and base station (BS) power constraints. Although the problem is non-convex, we develop an alternating optimization approach. Optimal receive beamforming is derived using the generalized Rayleigh quotient, while transmit beamforming and target assignment are solved via Dinkelbach's method, exploiting strong duality. Numerical results demonstrate the proposed algorithm's superiority over benchmarks, achieving robust and equitable sensing performance across UAVs, even in dynamic, high-mobility scenarios. These results highlight the potential of cooperative ISAC with multiple BSs for reliable target detection and communication under challenging conditions.
14 February 2022 in IEEE Transactions on Vehicular Technology
Ultra-reliable low-latency communication (uRLLC) emerges as one of the three service categories in fifth-generation (5G) wireless networks, with a potential to support multiple advanced services for latency-sensitive communications. The inherent openness of the wireless environment makes security in 5G unprecedentedly urgent to be addressed. Accordingly, the physical layer security (PLS) technique exploits the randomness characteristics of the wireless channel to fulfill security and confidentiality of information transmission. Different from many current works, which ignored the significance of security in uRLLC, this paper studies secrecy improvement strategy design in uRLLC scenarios. First, we propose suitable performance metrics for evaluating PLS of uRLLC and make a compromise between reliability, latency, and security, while maximizing the network throughput. Next, we identify the key challenging issues for achieving PLS in the context of uRLLC, and discuss the role of cooperative communication and mobility in terms of possible solutions. To the best of our knowledge, this is the first paper to make a trade-off among reliability, security and network throughput. Simulations validate the theoretical analyses.
18 June 2024 in IEEE Transactions on Vehicular Technology
Combing unmanned aerial vehicles (UAVs) with nonorthogonal multiple access (NOMA) in ultra-reliable and low latency communication (uRLLC) is deemed as a new service category of 5 G wireless networks. The openness nature of wireless environment makes security of information transmission unprecedentedly importance. Traditional cryptography methods cannot cater to uRLLC due to high complex design and processing delay. As a result, physical layer security (PLS) has been designed to secure information transmission by exploiting intrinsic property of wireless channel. However, many prior works ignored the role of UAV in study of PLS in uRLLC, and mobility of UAV deserves further investigation. This paper studies security and reliability performances of UAV-based uRLLC by using NOMA, where two kinds of users with different requirements are served, i.e., users with privacy and low latency requirement (PLR), and users with reliability and low latency requirement (RLR). With the tools of stochastic geometry, we formulate the secrecy rate, a popular metric in study of PLS, by establishing the closed-form expressions for static and dynamic UAV. Key system parameters (e.g., transmit power allocation) are optimized for secrecy rate maximization. Simulations evaluate theoretical analysis and give a significant insight into a positive secrecy rate for the network designer.
29 September 2022 in IEEE/ACM Transactions on Networking
Internet of Things (IoT) is rapidly spreading and reaching a multitude of different domains, since the fifth generation (5G) wireless technologies are the key enablers of many IoT applications. It is hence apparent that the broadcast nature of IoT devices makes data security unprecedentedly critical. Compared with traditional cryptography algorithms, which cannot cater for the features of IoT devices characterized by the severe limits in terms of energy, computation and storage capabilities, physical layer security (PLS) has been regarded as a promising solution to facilitate secure communications by exploiting the intrinsic randomness of the wireless medium. However, most of previous works assumed that all devices are static, and the impact of mobility on PLS deserves further investigation. In this paper, applying two types of random mobile models, i.e., the models of Random WayPoint (RWP) and Random Direction (RD), we study the impact of mobility on PLS in a scenario with three types of wireless devices (i.e., a destination, multiple interferers and an eavesdropper). Specifically, we establish an analytical framework for secrecy transmission capacity (STC), a fundamental metric in the study of PLS, under RWP and RD models. To the best of our knowledge, this is the first paper to derive STC and present the condition to achieve a positive STC with the consideration of mobility. We conclude that the RWP mobile destination can achieve a higher STC than that achievable in RD mobile and static scenarios, while RWP mobile eavesdropper is a challenging scenario to obtain a positive STC. Therefore, we propose an effective secrecy improvement strategy for the latter. Simulation validates the theoretical analyses.
15 July 2021 in IEEE/ACM Transactions on Networking
Link scheduling is an appealing solution for ensuring the reliability and latency requirements of Internet of Things (IoT). Most existing results on the link scheduling problem were based on the graph or SINR (Signal-to-Interference-plus-Noise-Ratio) models, which ignored the impact of the random fading gain of the signals strength. In this paper, we address the link scheduling problem under the Rayleigh fading model. Both Shortest Link Scheduling (SLS) and Maximum Link Scheduling (MLS) problems are studied. In particular, we show that a set of links can be activated simultaneously under Rayleigh fading model if all link SINR constraints are satisfied. Based on the analysis of previous Link Diversity Partition (LDP) algorithm, we propose an Improved LDP (ILDP) algorithm and a centralized algorithm by localizing the global interference (denoted by CLT), building on which we design a distributed CLT algorithm (denoted by RCRDCLT) that converges to a constant approximation factor of the optimum with the time complexity of $O(\ln n)$ , where $n$ is the number of links. Furthermore, executing repeatedly RCRDCLT can solve the SLS with an approximation factor of $\Theta (\ln n)$ . Extensive simulations indicate that CLT is more effective than previous six popular link scheduling algorithms, and RCRDCLT has the lowest time complexity while only losses a constant fraction of the optimum schedule.