<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">61869</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.061869</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Lightweight Convolutional Neural Network with Squeeze and Excitation Module for Security Authentication Using Wireless Channel</article-title>
<alt-title alt-title-type="left-running-head">A Lightweight Convolutional Neural Network with Squeeze and Excitation Module for Security Authentication Using Wireless Channel</alt-title>
<alt-title alt-title-type="right-running-head">A Lightweight Convolutional Neural Network with Squeeze and Excitation Module for Security Authentication Using Wireless Channel</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Qiu</surname><given-names>Xiaoying</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>20192329@bistu.edu.cn</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Ma</surname><given-names>Xiaoyu</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Zhao</surname><given-names>Guangxu</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Yu</surname><given-names>Jinwei</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Jiang</surname><given-names>Wenbao</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Guo</surname><given-names>Zhaozhong</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Xu</surname><given-names>Maozhi</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>College of Computer Science, Beijing Information Science and Technology University</institution>, <addr-line>Beijing, 100192</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Information and Communication Engineering, Beijing University of Posts and Telecommunications</institution>, <addr-line>Beijing, 100876</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>School of Mathematical Sciences, Peking University</institution>, <addr-line>Beijing, 100871</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Xiaoying Qiu. Email: <email>20192329@bistu.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>16</day><month>04</month><year>2025</year>
</pub-date>
<volume>83</volume>
<issue>2</issue>
<fpage>2025</fpage>
<lpage>2040</lpage>
<history>
<date date-type="received">
<day>05</day>
<month>12</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>2</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_61869.pdf"></self-uri>
<abstract>
<p>Physical layer authentication (PLA) in the context of the Internet of Things (IoT) has gained significant attention. Compared with traditional encryption and blockchain technologies, PLA provides a more computationally efficient alternative to exploiting the properties of the wireless medium itself. Some existing PLA solutions rely on static mechanisms, which are insufficient to address the authentication challenges in fifth generation (5G) and beyond wireless networks. Additionally, with the massive increase in mobile device access, the communication security of the IoT is vulnerable to spoofing attacks. To overcome the above challenges, this paper proposes a lightweight deep convolutional neural network (CNN) equipped with squeeze and excitation module (SE module) in dynamic wireless environments, namely SE-ConvNet. To be more specific, a convolution factorization is developed to reduce the complexity of PLA models based on deep learning. Moreover, an SE module is designed in the deep CNN to enhance useful features and maximize authentication accuracy. Compared with the existing solutions, the proposed SE-ConvNet enabled PLA scheme performs excellently in mobile and time-varying wireless environments while maintaining lower computational complexity.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Physical layer authentication</kwd>
<kwd>blockchain</kwd>
<kwd>squeeze and excitation module</kwd>
<kwd>computational cost</kwd>
<kwd>mobile scenario</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Key R&#x0026;D Program of China</funding-source>
<award-id>2022YFB2703000</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Young Backbone Teachers Support Plan of BISTU</funding-source>
<award-id>YBT202437</award-id>
</award-group>
<award-group id="awg3">
<funding-source>R&#x0026;D Program of Beijing Municipal Education Commission</funding-source>
<award-id>KM202211232012</award-id>
</award-group>
<award-group id="awg4">
<funding-source>Educational Innovation Program of BISTU</funding-source>
<award-id>2025JGYB19</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Advancements in wireless technology are driving the rapid deployment of Internet of Things (IoT) devices, enabling extensive connectivity across various applications and environments [<xref ref-type="bibr" rid="ref-1">1</xref>]. However, the increasing transmission of sensitive data over wireless channels has raised significant concerns about the security of IoT network communications [<xref ref-type="bibr" rid="ref-2">2</xref>]. Given the massive scale of mobile device access, ensuring IoT communication security has become increasingly critical [<xref ref-type="bibr" rid="ref-3">3</xref>]. Blockchain, a type of distributed ledger technology, is utilized in cryptographic algorithms for its secure, reliable, and tamper-proof characteristics [<xref ref-type="bibr" rid="ref-4">4</xref>]. Fang et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] proposed a smooth handover authentication approach that utilizes decentralized edge intelligence and hierarchical blockchain technology in the zero-trust Internet of Vehicles (IoV). However, blockchain technology inherently relies on the execution of complex cryptographic algorithms and consensus mechanisms, both of which demand significant computational resources [<xref ref-type="bibr" rid="ref-6">6</xref>]. To enhance the utilization of computing resources, researchers have turned to physical layer authentication (PLA) technique that offers distinct advantages over traditional upper-layer authentication methods based on encryption. Unlike encryption, PLA is characterized by low latency and reduced complexity [<xref ref-type="bibr" rid="ref-7">7</xref>]. In light of the security threats posed by potential attackers, a rapid and efficient lightweight authentication scheme is essential for identifying unknown IoT transmitting devices effectively [<xref ref-type="bibr" rid="ref-8">8</xref>].</p>
<p>In recent years, PLA has proven to be a promising approach for detecting spoofing attacks by utilizing physical layer characteristics [<xref ref-type="bibr" rid="ref-9">9</xref>]. PLA differentiates between legitimate and illegitimate devices by analyzing radio frequency (RF) [<xref ref-type="bibr" rid="ref-10">10</xref>] fingerprints, including received signal strength (RSS), and carrier frequency offset (CFO). However, a device&#x2019;s RF fingerprint arises from inherent hardware imperfections and is influenced by environmental conditions, such as temperature. Time-varying factors can also impact these fingerprints, posing challenges for reliable authentication [<xref ref-type="bibr" rid="ref-11">11</xref>]. RSS and CFO have limitations as they only provide limited information on signal strength and frequency offset, and fail to capture the multi-dimensional characteristics of the channel, such as phase and delay [<xref ref-type="bibr" rid="ref-12">12</xref>]. Channel state information (CSI) provides a more detailed and fine-grained fingerprint of the wireless channel. Based on the widely used Jakes model, received signals become decorrelated beyond a distance of half a wavelength, making it challenging for attackers to replicate the channel between legitimate devices [<xref ref-type="bibr" rid="ref-13">13</xref>]. Therefore, CSI fingerprints offer high spatial resolution, making them highly effective for detecting illegitimate devices [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>CSI provides detailed insights into channel conditions, including amplitude and phase data across multiple channels [<xref ref-type="bibr" rid="ref-15">15</xref>]. Such fine-grained information allows CSI-based authentication methods to distinguish more accurately between devices or devices by leveraging specific channel characteristics. PLA can be broadly classified according to the decision strategy into threshold-based and threshold-free methods. Additionally, it can be further subdivided based on the characteristics of the authenticated devices into categories such as static user authentication and mobile user authentication.</p>
<p>On the one hand, some researchers propose physical layer authentication in static scenarios. Liao et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] and Li et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] used convolutional neural networks (CNNs) to differentiate legitimate and illegitimate devices under simulated conditions, achieving a certain degree of accuracy. In [<xref ref-type="bibr" rid="ref-18">18</xref>], Qiu et al. introduced an adaptive neural network capable of tracking time-varying CSI data for intelligent authentication. In [<xref ref-type="bibr" rid="ref-19">19</xref>], the use of a confidence branch in combination with CNNs enabled not only discrimination between legitimate and illegitimate devices but also identification of distinct legitimate devices. Further, Gao et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] proposed an angle-delay calculation method using environmental semantics, leveraging the YOLO network and a lightweight architecture to extract CSI data and achieve high-precision authentication. Xie et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] suggested utilizing phase differences to map wireless device locations for spoofing attack detection, feeding phase-difference-generated heatmaps into a neural network model for training. The results successfully demonstrated the superior performance of this approach. In [<xref ref-type="bibr" rid="ref-22">22</xref>], Chen et al. propose a Convolutional Denoising Autoencoder (CDAE) structure to denoise CSI with noise, and then used K-Nearest Neighbors (K-NN) algorithm to distinguish between legitimate and illegitimate devices. Chen et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] use a threshold-based detection approach utilizing channel differences to create labeled offline training datasets for machine learning algorithms, eliminating the need for manual labeling. Martins et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] propose using CSI parameters as an authentication mechanism and tracking the wireless channel to prevent network attacks from impersonating legitimate users&#x2019; communication. On the other hand, several studies explore the implementation of physical layer security authentication in mobile environments. Study [<xref ref-type="bibr" rid="ref-25">25</xref>] present a deep learning-based authentication approach that captures and monitors changes in channel characteristics, improving the adaptability of PLA. In [<xref ref-type="bibr" rid="ref-26">26</xref>], Jing et al. introduce a multi-attribute PLA mechanism without the need for thresholds. Wang et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] introduced a spatiotemporal gradient-based physical layer authentication (STG-PLA) algorithm enhanced by CSI-to-image transformation. It extracts correlation and scattering features to represent channel characteristics and converts multiple CSI sequences into a CSI image for efficient analysis. In [<xref ref-type="bibr" rid="ref-28">28</xref>], Pan et al. apply residual network (ResNet) to achieve legal and illegal residual network authentication in the mobile industrial Internet scene, and proved that the accuracy of ResNet authentication in the mobile scene is higher than the K-NN algorithm. In [<xref ref-type="bibr" rid="ref-29">29</xref>], data augmentation and transfer learning are introduced into the authentication scheme. ResNet50 network is used to realize multi-user authentication in the industrial IoT environment.</p>
<p>However, PLA has been extensively studied, addressing the memory and computational constraints of authentication systems in dynamic, time-varying mobile environments remains a challenging aspect. This paper aims to enhance authentication performance for mobile devices in dynamic environments by introducing a lightweight model for resource-constrained devices, addressing the real-time needs of IoT devices. We collect instantaneous CSI data from the IoT environment to use as training data for our model. When an external device attempts to intrude and submits an access request, its instantaneous CSI data is input into the trained authentication model to extract intricate CSI features, allowing for precise identification of the unknown device&#x2019;s type. Therefore, we introduce the Squeeze and Excitation Convolutional Network (SE-ConvNet), a network that reduces complexity through the integration of the SE module and convolution factorization, while leveraging the squeeze and excitation mechanism of the SE module to enhance the accuracy of the authenticator. Our contributions are summarized below:
<list list-type="order">
<list-item>
<p>We propose a scheme based on the SE module and convolution factorization for authenticating CSI from mobile devices in IoT. The goal is to balance authentication accuracy and computation complexity for mobile devices.</p></list-item>
<list-item>
<p>In order to reduce the computation complexity, we introduce the SE module and convolution factorization. The SE module enhances useful features and suppresses irrelevant ones, demonstrating outstanding performance in various image processing tasks. Convolution factorization decomposes complex convolution operations into simpler ones, reducing computational complexity.</p></list-item>
<list-item>
<p>Comprehensive evaluation metrics are proposed to evaluate the proposed scheme. Simulation findings indicate that SE-ConvNet not only effectively verifies device identity but also demonstrates robustness in time-varying wireless conditions.</p></list-item>
</list></p>
<p>The rest of the paper is as follows: the <xref ref-type="sec" rid="s2">Section 2</xref> describes our proposed PLA framework in detail through a flowchart, explaining the key methods and principles of its main components. In <xref ref-type="sec" rid="s3">Section 3</xref>, we present the experimental setup, results, and comparisons with alternative algorithms. Finally in the <xref ref-type="sec" rid="s4">Section 4</xref>, we summarizes our findings and discusses potential directions for future research.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Methodology</title>
<p>In this section, we begin by presenting the system model for PLA. Next, we detail the proposed SE-ConvNet, including its mechanism and the design of the authentication model. Finally, we provide an analysis of the model&#x2019;s complexity.</p>
<sec id="s2_1">
<label>2.1</label>
<title>System Model</title>
<p>PLA must account for the time-varying characteristics of wireless channels, including fading and multipath effects. Additionally, it should consider the mobility of both the transmitter and receiver. Device movement can cause fluctuations in channel characteristics, influenced by factors such as Doppler shift and coherence time. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> depicts the standard Alice-Bob-Eve model in a wireless communication scenario. In this model, Alice, the legitimate transmitter, communicates with Bob, the legitimate receiver, in a multipath scattering environment. Meanwhile, a malicious device, Eve, attempts to impersonate Alice and gain illegitimate access to Bob. Such an attack diminishes the credibility of the legitimate transmitter, posing a threat to the security of the communication system.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>PLA model in the mobile scenario</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-1.tif"/>
</fig>
<p>Assuming that orthogonal frequency division multiplexing (OFDM) technology is utilized in this study and <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>N</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:math></inline-formula> subcarriers are assigned for communication, let the vectors <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">X</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">Y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> denote the transmitted and received signals, respectively. We have the following equation:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">Y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mi>a</mml:mi></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">X</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">W</mml:mtext></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the channel frequency response (CFR) matrix with dimensions <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>N</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:math></inline-formula>, where <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>N</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:math></inline-formula> is the number of antennas and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>N</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:math></inline-formula> is the number of subcarriers. This matrix can be estimated using pilot signals. The term <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:mtext mathvariant="bold">W</mml:mtext></mml:mrow></mml:math></inline-formula> represents additive white Gaussian noise. For the <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>i</mml:mi></mml:math></inline-formula>-th antenna and the <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>j</mml:mi></mml:math></inline-formula>-th subcarrier, the CFR <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub></mml:math></inline-formula> is defined as a complex number:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi mathvariant="normal">&#x2220;</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mtext>real</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext>img</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The channel matrix <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub></mml:math></inline-formula> typically represents the CSI. Changes in the wireless communication environment can affect some signal paths, while others remain invariant. The receiver (Bob) collects the CSI between itself and the transmitter (Alice), and uses this CSI as a reference for identifying legitimate communication. Given that Eve, an eavesdropper within communication range, may attempt to inject illegitimate messages, Bob must determine the legitimacy of a message source based on the real-time CSI characteristics.</p>
<p>To facilitate authentication, Bob labels the CSI data with unique identifiers to distinguish between transmitters. CSI from Eve is labeled as 0, while Alice&#x2019;s data is labeled as 1. Bob uses historical CSI data and corresponding labels to train the lightweight SE-ConvNet network for authentication. When Bob receives a signal from an unidentified transmitter, he inputs the estimated CSI into the pretrained SE-ConvNet model. By activating the sigmoid function at the end of the fully connected layer, a prediction score mapped to between 0 and 1 is obtained. Finally, the score is compared to the threshold:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>if&#xA0;</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>score</mml:mtext></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>if&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mtext>score</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> denotes that there is a legitimate device, and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> denotes that there is no legitimate devices and threshold <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> is obtained through experiments.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Proposed PLA Scheme</title>
<sec id="s2_2_1">
<label>2.2.1</label>
<title>Establishment of Authentication Mechanism</title>
<p>The proposed authentication mechanism is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. It consists of three stages: acquisition of instantaneous CSI data, extraction of deep CSI features and establishment of the authentication model, and access authentication for unknown devices.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>PLA mechanism based on SE-ConvNet</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-2.tif"/>
</fig>
<p>We divide the wireless communication environment into multiple grids, sampled multiple devices moving differently within this space, and collected numerous snapshots of instantaneous CSI data. This approach yields a substantial dataset, ensuring ample training samples for effective model development. Given the distinctiveness of wireless channels, the channel characteristics between each legitimate device and the access point (AP) are unique, which makes them suitable for authentication. When an unknown device attempts to connect to the AP, we capture its real-time CSI data and feed it into the pre-trained authentication model. This process enables the extraction of deep features from the CSI, allowing us to accurately verify the legitimacy of the device&#x2019;s identity. The mathematical expression for this phase is represented in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> as follows:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mtext>class</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mrow><mml:mtext>conv</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mi>a</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mtext>conv</mml:mtext></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the proposed PLA mechanism, which effectively differentiates between the types of user authentication. The term <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mi>a</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the current CSI, while <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mtext>class</mml:mtext></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> indicates the output authentication identity type. The establishment process of the proposed authentication mechanism is illustrated in Algorithm 1.</p>
<fig id="fig-11">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-11.tif"/>
</fig>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title>The Structure of SE-ConvNet</title>
<p>As the core of the proposed PLA mechanism, the design of SE-ConvNet has a great impact on the overall authentication performance. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrates the architecture of SE-ConvNet.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The structure of SE-ConvNet</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-3.tif"/>
</fig>
<p>After each convolution layer in the SE-ConvNet architecture is a Batch Normalization (BN) layer and a Leaky ReLU activation function. Inspired by ResNet [<xref ref-type="bibr" rid="ref-30">30</xref>] and channel attention mechanism [<xref ref-type="bibr" rid="ref-31">31</xref>], we introduce the SE module suitable for lightweight processing while designing the network structure. During network training, the BN layer normalizes a group of sample features with the same dimension, which speeds up model training and improves accuracy. The activation function gives the network nonlinear modeling capabilities, allowing it to perform nonlinear transformations on separable CSI data and enabling the verifier to capture and model underlying core features. SE-ConvNet applies Leaky ReLU to the various convolution layers. The Leaky ReLU formula is shown below:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mtext>Leaky ReLU</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>if&#xA0;</mml:mtext></mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>&#x03B1;</mml:mi><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>if&#xA0;</mml:mtext></mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the negative slope. We set <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> to 0.3 in the SE-ConvNet. The various components of the SE-ConvNet network structure are integral to its functionality, and these components are described in detail below.</p>
<p><bold>Convolution Factorization</bold> Convolution factorization is a technique that decomposes a standard convolution kernel into multiple smaller kernels. This approach is widely utilized in deep learning, particularly in the design of CNNs. In this paper, convolution factorization is incorporated into the proposed SE-ConvNet architecture to reduce both computational complexity and the number of parameters, while striving to maintain model accuracy as much as possible. The structure is illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Convolution factorization</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-4.tif"/>
</fig>
<p>This approach involves decomposing the standard convolution kernel into multiple smaller convolution kernels. The core concept of convolution factorization is rooted in tensor decomposition theory, which has been extensively applied in signal processing, pattern recognition, and machine learning. By decomposing high-dimensional tensors into the product of multiple low-dimensional tensors, this approach effectively reduces both storage requirements and computational costs. This principle has been seamlessly incorporated into the optimization of convolution operations in deep learning, particularly in the development of lightweight models and their deployment on mobile and embedded systems. In our proposed design, convolution factorization is integrated into the SE-ConvNet architecture, with the specific calculation formula represented as:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4A6;</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4A6;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x039E;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msup><mml:mi>U</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> refers to the output of neurons in layer <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>l</mml:mi></mml:math></inline-formula>, while <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents their activation function. <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mrow><mml:mi>&#x1D4A6;</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mrow><mml:mi>&#x1D4A6;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> denote convolution kernels of size <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, respectively. The dimensions of the neurons&#x2019; output in layer <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>l</mml:mi></mml:math></inline-formula> are specified as <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>K</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> correspond to the number of convolution kernels and the number of neurons in this layer, respectively. The weight of the <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>k</mml:mi></mml:math></inline-formula>-th convolution kernel in layer <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>l</mml:mi></mml:math></inline-formula> is denoted as <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msubsup><mml:mi>w</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:msubsup></mml:math></inline-formula>. Parameters <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>s</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mi>p</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> define the stride and the size of padding applied in the convolution layer. The threshold matrix is represented by <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi mathvariant="normal">&#x039E;</mml:mi></mml:math></inline-formula>. Padding involves surrounding the edges of the input matrix with additional elements (such as zeros, ones, or repeated values) to ensure that the output matrix has the same dimensions as the input after convolution. Stride determines how far the convolution kernel moves with each step during the operation. This decomposition method effectively reduces computational complexity while preserving the model&#x2019;s expressiveness.</p>
<p><bold>SE Module</bold> We introduce the SE module, which is designed based on the principles of Squeeze and Excitation Networks. The objective of this module is to enhance model accuracy while maintaining a low floating-point operations (FLOPS) count. The structure of the SE Module is illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The structure of SE module</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-5.tif"/>
</fig>
<p><bold>Step 1 Squeeze:</bold> Each learned filter operates within a local receptive field, which means that each unit of the transformation output global channel information cannot leverage contextual information beyond that localized region, the formula to be applied is <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover><mml:mi>U</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. This issue becomes more pronounced at the lower levels of the network, where the receptive field is relatively small. To mitigate this limitation, we propose compressing the global channel information into a single channel descriptor. This can be accomplished by employing global average pooling to generate channel-level statistics. Formally, in the spatial dimension of the narrow <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>h</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>w</mml:mi></mml:math></inline-formula> output <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>D</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:math></inline-formula>, we generate statistics <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>z</mml:mi></mml:math></inline-formula>, with the first <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>Z</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:math></inline-formula> elements calculated using the following formula:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>Z</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>D</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mrow><mml:mtext>for&#xA0;</mml:mtext></mml:mrow><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:math></disp-formula></p>
<p><bold>Step 2 Excitation:</bold> To maximize the information gathered during the compression process, a second operation is performed to effectively capture channel dependencies. This operation needs to meet two key requirements: firstly, it must be able to learn nonlinear interactions between channels; secondly, it should account for non-mutually exclusive relationships, enabling multiple channels to be considered at the same time rather than isolating a single activation. To fulfill these requirements, we have selected a simple gating mechanism and employed the sigmoid activation function:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>the channel weight <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>s</mml:mi></mml:math></inline-formula> generated by the excitation operation provides crucial information for subsequent weighting. We apply these weights to the original feature map <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>u</mml:mi></mml:math></inline-formula>, enabling the model to dynamically adjust the significance of each feature based on channel importance. Dimensionality is reduced through the fully connected layer with a Leaky ReLU activation function, usually reducing the dimension from <italic>C</italic> to <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>C</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>r</mml:mi></mml:math></inline-formula> (where <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>r</mml:mi></mml:math></inline-formula> is the scaling factor). This approach enhances the expressive power and overall performance of the network. The channel weight <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>s</mml:mi></mml:math></inline-formula> is applied to the original feature map <italic>D</italic>, with weighting achieved through channel-level multiplication. Consequently, the output feature map can be expressed as follows:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi></mml:math></disp-formula></p>
</sec>
<sec id="s2_2_3">
<label>2.2.3</label>
<title>Complexity Analysis of SE-ConvNet</title>
<p>To some degree, the number of FLOPS reflects the computational complexity of SE-ConvNet. The complexity of a single convolution layer can be expressed as <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:msub><mml:mi>w</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:msubsup><mml:mi>k</mml:mi><mml:mi>l</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. The convolution factor complexity introduced in this paper is given by <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:msub><mml:mi>w</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Because the SE module utilizes fully connected layers and global average pooling layers, its computational complexity can be described as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>C</mml:mi><mml:mi>r</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>C</mml:mi><mml:mi>r</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mi>r</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msup><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mi>r</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>By integrating the complexity of the convolution layers with the complexity formula of the SE module, the overall complexity of SE-ConvNet can be derived as follows:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:msub><mml:mi>w</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mfrac><mml:msup><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mi>r</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mi>w</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> denote the height and width of the feature map, with <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>k</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula> representing the size of the filter. <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the number of output channels from the preceding layer, and <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>C</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> refers to the output channels in the current layer. The relationship between the output feature at layer <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>l</mml:mi></mml:math></inline-formula> and the feature map from the previous layer is given by <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>, where <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>p</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>s</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></inline-formula> indicate the padding and stride values for the <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>l</mml:mi></mml:math></inline-formula>-th layer, respectively. If the size is not divisible evenly, the convolutional layer truncates the size, while the pooling layer performs rounding up.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>p</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>w</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>p</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experiment Results</title>
<p>This section outlines the experimental setup, including the key parameters, simulation environment, evaluation criteria, and datasets used. We then present the results of the proposed approach, followed by an in-depth analysis of the findings.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Experimental Parameters</title>
<p>We set the learning rate to <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> to strike a balance between fast convergence and training stability. A higher learning rate may cause instability during training, whereas a lower value could result in unnecessarily prolonged training. To mitigate overfitting, we employ a weight decay coefficient of <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mn>5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> for regularization, penalizing large weights and promoting simpler models that generalize better to unseen data. The model is trained for 50 epochs, a number selected based on monitoring both training and validation losses to ensure sufficient learning without overfitting. A batch size of 32 is used during training, balancing efficiency and memory constraints; smaller batches introduce noise in gradient updates, while larger ones may exceed memory capacity.</p>
<p>The integration of these hyperparameters is crucial to the training process and significantly impacts the model&#x2019;s performance in the authentication task. This section first describes the source of the channel dataset, followed by a comparison of the performance of SE-ConvNet and a traditional CNN. During testing, both the SE-ConvNet and CNN models are evaluated by feeding them the test set. The comparison not only involves the probability of the received channel data belonging to the legitimate device (Alice), but also includes a series of other performance metrics.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Performance Metrics</title>
<p>Recall and False Positive Rate (FPR) are critical metrics for assessing the effectiveness of PLA schemes. Recall, also referred to as True Positive Rate (TPR), indicates the percentage of actual positive instances correctly identified by the model. Conversely, FPR reflects the model&#x2019;s propensity to misclassify negative samples. A low FPR indicates better discrimination between positive and negative samples. This is particularly important in applications such as security monitoring and fraud detection, where minimizing false alarms is critical. Precision, on the other hand, measures the proportion of samples labeled as positive by the model that are truly positive. The formulas for these metrics are given below:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Recall(TPR)</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>FPR</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>In these equations, <italic>FP</italic> denotes instances where Bob incorrectly classifies Eve&#x2019;s channel matrix as authenticated. <italic>TN</italic> indicates the number of illegitimate labels that Eve&#x2019;s signal should have received. <italic>FN</italic> represents the number of legitimate channels that Bob misclassifies as illegitimate, while <italic>TP</italic> signifies the correct identification of legitimate tags from legitimate devices. The accuracy of the model is computed using the following formula:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mtext>Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>To comprehensively assess the overall performance of SE-ConvNet, this study also introduces the F1-score, which combines accuracy and recall. The F1-score offers a comprehensive assessment of the model&#x2019;s performance, with values ranging from 0 to 1, where a higher score signifies better performance. The formula for the F1-score is as follows:
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:mtext>F1-score</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The loss function used for training the model is the binary cross-entropy loss, expressed as:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>cross</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In this equation, the classification labels for legitimate and illegitimate devices are assigned values of 1 and 0, respectively. The variable <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow></mml:math></inline-formula> represents the true label of the data, while <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:mover><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> indicates the predicted probability that the data comes from a legitimate device.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Dataset</title>
<p>In this study, we employed the advanced wireless channel generator QuaDRiGa [<xref ref-type="bibr" rid="ref-32">32</xref>] to simulate channel environments and obtain CSI data. The QuaDRiGa platform incorporates a drift model that enables the smooth evolution of small-scale parameters, such as multipath power, delay, departure angles, and arrival angles, over short time intervals as mobile terminals move along a specified trajectory.</p>
<p>The receiver&#x2019;s movement trajectory in the automobile assembly plant is illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. Our experiment considers a 100 m <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mo>&#x00D7;</mml:mo></mml:math></inline-formula> 100 m region, where a stationary receiver records channel data as the transmitter moves along different paths, introducing channel heterogeneity. CSI data gathered from various locations within this region are treated as originating from distinct emitters, thereby simulating the CSI of multiple transmitters.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The receiver&#x2019;s position and the transmitter&#x2019;s movement trajectory in an automotive assembly plant</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-6.tif"/>
</fig>
<p>QuaDRiGa generated two datasets for this study: Dataset A, using parameters aligned with [<xref ref-type="bibr" rid="ref-17">17</xref>], and Dataset B, employing parameters tailored for experimental validation as described in <xref ref-type="table" rid="table-1">Table 1</xref>. The QuaDRiGa platform generated a complex CSI matrix of size <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mn>10,000</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1024</mml:mn></mml:math></inline-formula>, with each CSI instance represented as a <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1024</mml:mn></mml:math></inline-formula> complex vector. Each vector was subsequently converted into a <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mn>32</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>32</mml:mn></mml:math></inline-formula> channel matrix. The dataset was partitioned into three subsets for training, validation, and testing, with a distribution of 80%, 10%, and 10%, respectively. For comparative evaluation, we selected a CNN architecture from [<xref ref-type="bibr" rid="ref-17">17</xref>] as a baseline model.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Parameter settings for Dataset B</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Options</th>
<th>Parameter settings</th>
</tr>
</thead>
<tbody>
<tr>
<td>Channel model</td>
<td>3GPP_38.901_UMi_NLOS</td>
</tr>
<tr>
<td>Center frequency</td>
<td>3.5 GHz</td>
</tr>
<tr>
<td>Bandwidth</td>
<td>20 MHz</td>
</tr>
<tr>
<td>Base station height</td>
<td>10 m</td>
</tr>
<tr>
<td>User height</td>
<td>1.5 m</td>
</tr>
<tr>
<td>User movement speed</td>
<td>1 m/s</td>
</tr>
<tr>
<td>Number of subcarriers</td>
<td>32</td>
</tr>
<tr>
<td>Polarization direction</td>
<td>Vertical polarization</td>
</tr>
<tr>
<td>Antenna configuration</td>
<td>AP: 32 antenna</td>
</tr>
<tr>
<td></td>
<td>Nodes: Single antenna</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Since SE-ConvNet requires a specific data format for training and testing, the CSI data must be normalized. Normalization refers to mapping the input values to the range of <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> to enhance the learning efficiency of the authenticator. The normalization formula is as follows:
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msubsup><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mrow><mml:mtext>norm</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mi>l</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In the 1-D case, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mi>a</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is transformed by obtaining its maximum <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and minimum <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> values. The 1-D is denoted as <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msubsup><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, and the normalized value is <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:msubsup><mml:mrow><mml:mover><mml:mrow><mml:mtext mathvariant="bold">H</mml:mtext></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mtext>norm</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mi>l</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Moreover, before using the authenticator to identify devices in the wireless communication environment, the authenticator must be trained. Specifically, we input the preprocessed dataset into the authenticator for training to extract deep features, thereby acquiring an authentication model that can represent and differentiate spatiotemporal environmental features at different locations.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Comparative Experiments and Results Analysis</title>
<p>When tested on Dataset A, both CNN and the proposed SE-ConvNet achieved high accuracy, as shown in <xref ref-type="table" rid="table-2">Table 2</xref> below:</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison of network models and authentication accuracy on Dataset A</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Name</th>
<th>Network model</th>
<th>Accuracy (under 0 dB)</th>
</tr>
</thead>
<tbody>
<tr>
<td>Our scheme</td>
<td>SE-ConvNet</td>
<td>96.9%</td>
</tr>
<tr>
<td>Scheme proposed by X. Li</td>
<td>CNN</td>
<td>94.8%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> illustrates the authentication accuracy comparison between SE-ConvNet and a traditional CNN across varying SNR conditions on Dataset B. When the SNR is 20 dB, both models achieve over 95% accuracy, demonstrating their effectiveness in high-quality signal environments. However, as the SNR drops to 0 dB, SE-ConvNet maintains high accuracy, whereas the CNN&#x2019;s performance declines significantly. The robustness of SE-ConvNet at 0 dB SNR can be attributed to the SE module, which enhances the model&#x2019;s ability to accurately process low-SNR channel data.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>A comparison of authentication accuracy between PLA scheme based on SE-ConvNet and CNN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-7.tif"/>
</fig>
<p>To further analyze the training process of SE-ConvNet, <xref ref-type="fig" rid="fig-8">Fig. 8</xref> illustrates the evolution of its accuracy and loss curves as the number of epochs increases under different SNR levels. The training and validation losses consistently decrease, while accuracy enhances, demonstrating that the model effectively fits the data with strong generalization ability. These results validate the training efficacy of SE-ConvNet under specific channel conditions and highlight its adaptability to the training data. Moreover, the stable trends suggest that the model avoids overfitting during training, providing a robust foundation for practical applications.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Accuracy and loss curves: (a) Accuracy curves; (b) Loss curves</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-8.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-9">Fig. 9a</xref> presents the ROC curve of SE-ConvNet under different signal-to-noise ratios (SNR). At an SNR of 0 dB, the area under the ROC curve (AUC) reaches 0.980, indicating SE-ConvNet&#x2019;s strong performance in distinguishing legitimate from illegitimate devices even in low-SNR environments. <xref ref-type="fig" rid="fig-9">Fig. 9b</xref> illustrates the F1-score variations across different thresholds when the SNR is 0 dB. The F1-score remains above 0.9 for thresholds within the [0.5, 0.9] range, peaking near a threshold of 0.85, which signifies optimal classification accuracy under these challenging conditions.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Classification performance metrics: (a) ROC curves; (b) F1-scores at 0 dB (SNR)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-9.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-10">Fig. 10</xref> provides a comparative analysis of FLOPS and memory usage between SE-ConvNet and CNN with an input data size of <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>32</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>32</mml:mn></mml:math></inline-formula>. FLOPS serves as a key indicator of a model&#x2019;s computational complexity, with lower values indicating greater efficiency in inference. Memory usage measures the amount of memory required for model parameters and intermediate activations during inference. Time per batch indicates the duration needed to process a specified number of input samples. A lower time per batch reflects higher throughput and faster response times, critical for real-time applications. Analyzing this metric helps identify optimization opportunities for improved computational efficiency. The comparison clearly shows that SE-ConvNet has significantly lower computational complexity than traditional CNN while maintaining accuracy. This finding not only demonstrates SE-ConvNet&#x2019;s advantages in resource-constrained environments but also indicates its feasibility for large-scale deployment.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Model efficiency comparison</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61869-fig-10.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this paper, we present SE-ConvNet, a lightweight scheme designed to detect physical layer spoofing attacks for mobile devices in IoT scenarios. This approach achieves packet authentication by leveraging the CSI of devices across various locations to accurately identify spoofing attacks. The simulation results show that, compared to other authentication schemes, the proposed SE-ConvNet exhibits superior robustness under time-varying conditions and environmental disturbances, while maintaining a lower model overhead. Notably, even at 0dB (SNR), the AUC remains above 0.980, highlighting the scheme&#x2019;s resilience under challenging signal conditions. The current approach may still experience performance degradation under certain class imbalance conditions in the dataset. Therefore, future work can address these issues through further improvements in data processing and model architecture.</p>
<p>Future research should focus on developing PLA schemes suitable for large-scale multi-user mobile scenario. As proposed in [<xref ref-type="bibr" rid="ref-27">27</xref>], optimizing feature extraction and selection of CSI samples enhances feature discriminability, improving PLA efficiency in complex communication environments. Additionally, exploring methods that adapt to multiple application scenario while balancing performance and complexity will be critical.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to express their gratitude to the anonymous reviewers and the editorial team for their feedback and suggestions.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported in part by the National Key R&#x0026;D Program of China under grant no. 2022YFB2703000, in part by the Young Backbone Teachers Support Plan of BISTU under grant no. YBT202437, in part by the R&#x0026;D Program of Beijing Municipal Education Commission under grant no. KM202211232012, and in part by the Educational Innovation Program of BISTU under grant no. 2025JGYB19.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Xiaoying Qiu, Xiaoyu Ma; data collection: Xiaoyu Ma; analysis and interpretation of results: Xiaoying Qiu, Guangxu Zhao; draft manuscript preparation: Xiaoying Qiu, Xiaoyu Ma, Guangxu Zhao, Jinwei Yu, Wenbao Jiang, Zhaozhong Guo, Maozhi Xu. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>All the experimental data are presented in this paper.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Jiang</surname> <given-names>JR</given-names></string-name></person-group>. <article-title>Short survey on physical layer authentication by machine-learning for 5G-based Internet of Things</article-title>. In: <conf-name>2020 3rd IEEE International Conference on Knowledge Innovation and Invention (ICKII)</conf-name>; <year>2020</year>; <publisher-loc>Kaohsiung, Taiwan</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>41</fpage>&#x2013;<lpage>4</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Illi</surname> <given-names>E</given-names></string-name>, <string-name><surname>Qaraqe</surname> <given-names>M</given-names></string-name>, <string-name><surname>Althunibat</surname> <given-names>S</given-names></string-name>, <string-name><surname>Alhasanat</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alsafasfeh</surname> <given-names>M</given-names></string-name>, <string-name><surname>de Ree</surname> <given-names>M</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Physical layer security for authentication, confidentiality, and malicious node detection: a paradigm shift in securing IoT networks</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2024</year>;<volume>26</volume>(<issue>1</issue>):<fpage>347</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1109/COMST.2023.3327327</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kaur</surname> <given-names>B</given-names></string-name>, <string-name><surname>Dadkhah</surname> <given-names>S</given-names></string-name>, <string-name><surname>Shoeleh</surname> <given-names>F</given-names></string-name>, <string-name><surname>Neto</surname> <given-names>ECP</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>P</given-names></string-name>, <string-name><surname>Iqbal</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Internet of things (IoT) security dataset evolution: challenges and future directions</article-title>. <source>Internet Things</source>. <year>2023</year>;<volume>22</volume>(<issue>10</issue>):<fpage>100780</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.iot.2023.100780</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang F, Shi</surname> <given-names>BX</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>WB</given-names></string-name></person-group>. <article-title>Review of key technology and its application of blockchain</article-title>. <source>Chin J Netw Inf Secur</source>. <year>2018</year>;<volume>4</volume>:<fpage>22</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Decentralized edge collaboration for seamless handover authentication in zero-trust IoV</article-title>. <source>IEEE Trans Wirel Commun</source>. <year>2024</year>;<volume>23</volume>(<issue>8</issue>):<fpage>8760</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TWC.2024.3354064</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dotan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Pignolet</surname> <given-names>YA</given-names></string-name>, <string-name><surname>Schmid</surname> <given-names>S</given-names></string-name>, <string-name><surname>Tochner</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zohar</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Survey on blockchain networking: context, state-of-the-art</article-title>. <source>chall ACM Comput Surv (CSUR)</source>. <year>2021</year>;<volume>54</volume>(<issue>5</issue>):<fpage>1</fpage>&#x2013;<lpage>34</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>N</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Alipour-Fanid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Jiao</surname> <given-names>L</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Physical layer security of 5G wireless networks for IoT: challenges and opportunities</article-title>. <source>IEEE Internet Things J</source>. <year>2019</year>;<volume>PP</volume>(<issue>99</issue>):<fpage>1</fpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2019.2927379</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>N</given-names></string-name>, <string-name><surname>Li</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Alipour-Fanid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Physical layer authentication for 5G communications: opportunities and road ahead</article-title>. <source>IEEE Netw</source>. <year>2020</year>;<volume>34</volume>(<issue>6</issue>):<fpage>198</fpage>&#x2013;<lpage>204</lpage>. doi:<pub-id pub-id-type="doi">10.1109/MNET.011.2000122</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Physical layer authentication enhancement using two-dimensional channel quantization</article-title>. <source>IEEE Trans Wirel Commun</source>. <year>2016</year>;<volume>15</volume>(<issue>6</issue>):<fpage>4171</fpage>&#x2013;<lpage>82</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TWC.2016.2535442</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname> <given-names>N</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A survey of physical layer authentication in wireless communications</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2020</year>;<volume>23</volume>(<issue>1</issue>):<fpage>282</fpage>&#x2013;<lpage>310</lpage>. doi:<pub-id pub-id-type="doi">10.1109/COMST.2020.3042188</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>HM</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>QY</given-names></string-name></person-group>. <article-title>Channel-prediction-based one-class mobile IoT device authentication</article-title>. <source>IEEE Internet Things J</source>. <year>2021</year>;<volume>9</volume>(<issue>10</issue>):<fpage>7731</fpage>&#x2013;<lpage>45</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3114348</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zheng</surname> <given-names>R</given-names></string-name>, <string-name><surname>Saad</surname> <given-names>W</given-names></string-name>, <string-name><surname>Han</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>Device fingerprinting in wireless networks: challenges and opportunities</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2016</year>;<volume>18</volume>(<issue>1</issue>):<fpage>94</fpage>&#x2013;<lpage>104</lpage>. doi:<pub-id pub-id-type="doi">10.1109/COMST.2015.2476338</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hong</surname> <given-names>YWP</given-names></string-name></person-group>. <article-title>Deep learning-enhanced physical layer authentication for mobile devices</article-title>. In: <conf-name>GLOBECOM 2023&#x2014;2023 IEEE Global Communications Conference</conf-name>; <year>2023</year>; <publisher-loc>Kuala Lumpur, Malaysia</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>826</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hoang</surname> <given-names>TM</given-names></string-name>, <string-name><surname>Vahid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Tuan</surname> <given-names>HD</given-names></string-name>, <string-name><surname>Hanzo</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Physical layer authentication and security design in the machine learning era</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2024</year>;<volume>26</volume>(<issue>3</issue>):<fpage>1830</fpage>&#x2013;<lpage>60</lpage>. doi:<pub-id pub-id-type="doi">10.1109/COMST.2024.3363639</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>R</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>The wireless IoT device identification based on channel state information fingerprinting</article-title>. In: <conf-name>2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)</conf-name>; <year>2020</year>; <publisher-loc>Chongqing, China</publisher-loc>: <publisher-name>IEEE</publisher-name>. Vol. <volume>9</volume>, p. <fpage>534</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ITAIC49862.2020</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liao</surname> <given-names>R</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Pan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Song</surname> <given-names>H</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>A</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>A novel physical layer authentication method with convolutional neural network</article-title>. In: <conf-name>2019 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA)</conf-name>; <year>2019</year>; <publisher-loc>Dalian, China</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>231</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>X</given-names></string-name></person-group>. <article-title>A physical layer authentication mechanism for IoT devices</article-title>. <source>China Commun</source>. <year>2021</year>;<volume>19</volume>(<issue>5</issue>):<fpage>129</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.23919/JCC.2021.00.014</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Qiu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Dai</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hayes</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A learning approach for physical layer authentication using adaptive neural network</article-title>. <source>IEEE Access</source>. <year>2020</year>;<volume>8</volume>:<fpage>26139</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2020.2971260</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>CSI-based physical layer authentication via deep learning</article-title>. <source>IEEE Wirel Commun Lett</source>. <year>2022</year>;<volume>11</volume>(<issue>8</issue>):<fpage>1748</fpage>&#x2013;<lpage>52</lpage>. doi:<pub-id pub-id-type="doi">10.1109/LWC.2022.3180901</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>N</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Li</surname> <given-names>C</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>S</given-names></string-name>, <string-name><surname>Matthaiou</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Environment semantics enabled physical layer authentication</article-title>. <source>IEEE Wirel Commun Lett</source>. <year>2024</year>;<volume>13</volume>(<issue>1</issue>):<fpage>178</fpage>&#x2013;<lpage>82</lpage>. doi:<pub-id pub-id-type="doi">10.1109/LWC.2023.3324981</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>C</given-names></string-name></person-group>. <article-title>A novel PHY-layer spoofing attack detection scheme based on WGAN-encoder model</article-title>. <source>IEEE Trans Inf Forensics Secur</source>. <year>2024</year>;<volume>19</volume>(<issue>9</issue>):<fpage>8616</fpage>&#x2013;<lpage>29</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIFS.2024.3460373</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>He</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xing</surname> <given-names>B</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Physical layer authentication for industrial control based on convolutional denoising autoencoder</article-title>. <source>IEEE Internet Things J</source>. <year>2024</year>;<volume>11</volume>(<issue>9</issue>):<fpage>15633</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2023.3347603</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>S</given-names></string-name>, <string-name><surname>Pang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Automated labeling and learning for physical layer authentication against clone node and sybil attacks in industrial wireless edge networks</article-title>. <source>IEEE Trans Ind Inform</source>. <year>2020</year>;<volume>17</volume>(<issue>3</issue>):<fpage>2041</fpage>&#x2013;<lpage>51</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TII.2020.2963962</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Martins</surname> <given-names>J</given-names></string-name>, <string-name><surname>Gomes</surname> <given-names>M</given-names></string-name>, <string-name><surname>Silva</surname> <given-names>V</given-names></string-name>, <string-name><surname>Dinis</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Deep learning-based channel prediction for wireless physical layer security</article-title>. In: <conf-name>2024 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)</conf-name>; <year>2024</year>; <publisher-loc>Madrid, Spain</publisher-loc>: <publisher-name>IEEE</publisher-name>; p. <fpage>114</fpage>&#x2013;<lpage>8</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Qiu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>X</given-names></string-name>, <string-name><surname>Hayes</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Enhanced security authentication based on convolutional-LSTM networks</article-title>. <source>Sensors</source>. <year>2021</year>;<volume>21</volume>(<issue>16</issue>):<fpage>5379</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s21165379</pub-id>; <pub-id pub-id-type="pmid">34450819</pub-id></mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jing</surname> <given-names>T</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Huo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Threshold-free multi-attributes physical layer authentication based on expectation&#x2013;conditional maximization channel estimation in Internet of Things</article-title>. <source>Int J Distrib Sens Netw</source>. <year>2022</year>;<volume>18</volume>(<issue>7</issue>):<fpage>15501329221107822</fpage>. doi:<pub-id pub-id-type="doi">10.1177/15501329221107822</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Pang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Spatiotemporal gradient-based physical-layer authentication enhanced by CSI-to-image transformation for industrial mobile devices</article-title>. <source>IEEE Trans Ind Inform</source>. <year>2024</year>;<volume>20</volume>(<issue>3</issue>):<fpage>4236</fpage>&#x2013;<lpage>45</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TII.2023.3316178</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Pu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name></person-group>. <source>Physical layer authentication based on residual network for industrial wireless CPSs</source>; <year>2020</year>; <publisher-loc>Singapore</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>4368</fpage>&#x2013;<lpage>73</lpage>. doi:<pub-id pub-id-type="doi">10.1109/IECON43393.2020</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jing</surname> <given-names>T</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Huo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Multi-user physical layer authentication based on CSI using ResNet in mobile IIoT</article-title>. <source>IEEE Trans Inf Forensics Secur</source>. <year>2024</year>;<volume>19</volume>:<fpage>1896</fpage>&#x2013;<lpage>907</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIFS.2023.3340090</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>He</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Ren</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Deep residual learning for image recognition</article-title>. In: <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>; <year>2016</year>; <publisher-loc>Las Vegas, NV, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>770</fpage>&#x2013;<lpage>8</lpage>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>L</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Squeeze-and-excitation networks</article-title>. In: <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>; <year>2018</year>; <publisher-loc>Salt Lake City, UT, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>7132</fpage>&#x2013;<lpage>41</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jaeckel</surname> <given-names>S</given-names></string-name>, <string-name><surname>Raschkowski</surname> <given-names>L</given-names></string-name>, <string-name><surname>B&#x00F6;rner</surname> <given-names>K</given-names></string-name>, <string-name><surname>Thiele</surname> <given-names>L</given-names></string-name></person-group>. <article-title>QuaDRiGa: a 3-D multi-cell channel model with time evolution for enabling virtual field trials</article-title>. <source>IEEE Trans Antennas Propag</source>. <year>2014</year>;<volume>62</volume>(<issue>6</issue>):<fpage>3242</fpage>&#x2013;<lpage>56</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TAP.2014.2310220</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>