This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Physical Layer Authentication for Non-coherent Massive SIMO-Based Industrial IoT Communications

Zhifang Gu1, He Chen2, Pingping Xu1, Yonghui Li3, and Branka Vucetic3 1National Mobile Communications Research Laboratory, Southeast University, Nanjing, China 2Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China 3School of Electrical and Information Engineering, The University of Sydney, Sydney, Australia
1{zhifang_gu, xpp}@seu.edu.cn, [email protected], 3{yonghui.li, branka.vucetic}@sydney.edu.au
Abstract

Achieving ultra-reliable, low-latency and secure communications is essential for realizing the industrial Internet of Things (IIoT). Non-coherent massive multiple-input multiple-output (MIMO) has recently been proposed as a promising methodology to fulfill ultra-reliable and low-latency requirements. In addition, physical layer authentication (PLA) technology is particularly suitable for IIoT communications thanks to its low-latency attribute. A PLA method for non-coherent massive single-input multiple-output (SIMO) IIoT communication systems is proposed in this paper. Specifically, we first determine the optimal embedding of the authentication information (tag) in the message information. We then optimize the power allocation between message and tag signal to characterize the trade-off between message and tag error performance. Numerical results show that the proposed PLA is more accurate then traditional methods adopting the uniform tag when the communication reliability remains at the same level. The proposed PLA method can be effectively applied to the non-coherent system.

I Introduction

The fast development of the Internet of Things (IoT) has promoted innovations in many fields. The application of the IoT in the industrial sector, referred to as industrial IoT (IIoT), has recently attracted tremendous attention from researchers and engineers owing to its ability to improve the efficiency and productivity of industry. Compared with traditional industrial networks mainly based on wired cables, wireless communications are more suitable for the IIoT due to low maintenance expenditure, flexible deployment, and higher long-term reliability [1]. However, ultra-reliable, low-latency and secure requirements of the IIoT represent main challenges for wireless design [2] [3]. Wireless channels suffer from path-loss, shadowing, fading and interference, thus it is very challenging to design wireless networks to achieve the ultra-reliable transmission[4]. Moreover, the broadcast characteristic of wireless channels makes the IIoT systems more vulnerable to attacks [5]. Non-coherent massive multiple-input multiple-output (MIMO) has recently been proposed as a promising methodology to meet ultra-reliable and low-latency requirements of IIoT communications [6], which uses multiple receive antennas to reduce the effects of fading and uncorrelated noise in wireless channels and boost system reliability. Besides, non-coherent massive MIMO uses energy-based modulation to achieve low latency by avoiding channel estimation and by applying fast non-coherent detection [7] [8]. Two security services have been commonly considered in the IIoT, including integrity and authenticity, which are essential in IIoT systems. Message authentication code (MAC) is a prevalent mechanism to provide these two services. Conventional systems realize message authentication by attaching a MAC to the message and this authentication process is completed above the physical layer [9], e.g., transport layer security (TLS) protocol in the transport layer and Wi-Fi protected access II (WPA2) protocol in the network layer. However, these conventional mechanisms may not be able to meet the stringent low-latency requirement of IIoT communications. Because short packet transmission is one of the characteristics of the IIoT, the transmission overhead for the MAC can be large and excessive in the short packet transmission with small payload, occurring relatively large delay. In addition, the authentication process can only be completed after the data has been transferred to upper layers, which leads to low efficiency. Therefore, we aim to propose a message authentication method at the physical layer which can also reduce transmission overhead.

Physical layer security, according to its implementation method, can be divided into two categories. The first category is based on the information-theoretic approach, which was proposed by Shannon [10] and further developed by Wyner with the wiretap channel model [11]. This kind of approach only guarantees data confidentiality by preventing eavesdropper from understanding the information, but other security services like data integrity and authenticity are not considered. The second category is based on the signal and channel features, which aims to provide authenticity and data integrity. In the IIoT scenario, active attacks (e.g., modification, masquerade or replay attack) are much more harmful than passive attacks (e.g., eavesdropping)[12]. Therefore, we consider physical layer authentication (PLA) from the perspective of the second category. Existing PLA methods have two forms: passive and active [13]. Passive PLA utilizes the intrinsic features of communication systems to authenticate the transmitter, such as radio signal strength indicator, channel state information (CSI) and radio frequency fingerprints [5]. These features were thoroughly analyzed in [14] with a theoretical model and experimental validation. The results of [14] revealed that the intrinsic features are not reliable in practical scenarios due to the device mobility, wireless fading channels and indistinguishable RF fingerprints. In contrast, active PLA refers to the methods in which the transmitter sends additional information (normally referred to as tag) for authentication at the physical layer. Active PLA features embedding a tag in the message information and does not take extra time to transmit the tag. Thanks to its potential to meet the low-latency requirement, active PLA has advantages over conventional authentication methods sending a message and its tag separately [15].

The key issue of implementing active PLA is how to embed a tag in message information at the physical layer. Several methods dealing with this issue have been published. The tag was added as noise in [16]: different additional angle offsets to normal quadrature phase shift keying (QPSK) indicate different tag bits. 4/16 hierarchical quadrature amplitude modulation (QAM) was applied in [17] to transmit a message and its tag simultaneously, where a 4-QAM tag constellation is superimposed on a 4-QAM message constellation. Challenge response PLA was introduced in [18] and the authentication information was embedded during a “challenge and response” process. Although these active PLA methods transmit a tag and a message at the same time, they all need to send separate pilots for channel estimation to acquire the instantaneous CSI. In [19], a tag is embedded in the original pilot to form a new pilot, and the tag detection is completed by a correlation operation. Then the new pilot signal is used to estimate CSI for message recovery. Note that these existing active PLA methods are not suitable for non-coherent massive MIMO-based IIoT systems, in which no estimation of the instantaneous CSI is performed. To our best knowledge, how to perform active PLA for non-coherent systems is still an open problem.

As the first attempt to fill this gap, we focus on designing an active PLA mechanism for non-coherent massive single-input multiple-output (SIMO) IIoT systems. As elaborated in [20], non-negative pulse amplitude modulation (PAM) is a favorable scheme for the considered system. In the system, the variance of the received signal power increases as the transmitted signal amplitude increases. In this context, the tag embedding constellation pattern is not necessary to be uniform as in the existing methods, but needs to be optimized according to the message constellation. The tag embedding design becomes a nontrivial problem as the increased tag signal power reduces the error rate of tag while increasing the error rate of message, leading to the error performance trade-off between message and tag. In this paper, we manage to find an optimal 1-bit tag embedding design based on a given message constellation. Then for a fixed average system power, we attain the optimal power allocation of message and tag signals to characterize the trade-off between message and tag error performance, which can provide useful insights for practical system design.

II System Model

In this paper, we consider the PLA in a massive SIMO-based IIoT communication system, where multiple sensors transmit data to a controller with NN antennas. Each sensor has one single antenna and these sensors send data to the controller with time-division multiple access (TDMA) manner. An attacker is within the range of this wireless communication system, who can receive the signal from sensors and send malicious signals to the controller. To meet the low-latency requirement of the IIoT, we adopt non-negative PAM at the transmitter and non-coherent maximum likelihood (ML) detector at the receiver [6, 7, 8]. Since only statistics of the channel are needed in this method, the channel estimation process is not required and the authentication can be executed faster. To realize PLA, the transmitter embeds the tag signal in the message signal at the physical layer, as illustrated in Fig. 1. MAC is denoted by MM, which is generated by message bits bb and secret key kk with a hash function, and it is given by

M=hash(b,k).M={\rm{hash}}(b,k). (1)

The modulated signal of bb and MM are denoted by mm and tt, which are termed message signal and tag signal, respectively. The transmitted signal xx is then determined by

x=|m|2+|t|2,x=\sqrt{|m|^{2}+|t|^{2}}, (2)

where m={mi|i=1,,Lm}m\in\mathcal{M}=\{m_{i}|i=1,\cdots,L_{m}\} and t𝒯={ti,j|i=1,,Lm;j=1,,Lt}t\in\mathcal{T}=\{t_{i,j}|i=1,\cdots,L_{m};\ j=1,\cdots,L_{t}\}. LmL_{m} and LtL_{t} are the number of constellation points of message signal and tag signal, respectively. The transmitted signal that involves message signal mim_{i} is denoted as xix_{i}. The average power of message signal EmE_{m} and the average power of tag signal EtE_{t} are constrained by the total average system power EtotE_{tot}

Em+EtEtot,E_{m}+E_{t}\leq E_{tot}, (3)

where Em=1Lmi=1Lm|mi|2E_{m}=\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}}|m_{i}|^{2} and Et=1LmLti=1Lmj=1Lt|ti,j|2E_{t}=\frac{1}{L_{m}L_{t}}\sum\limits_{i=1}^{L_{m}}\sum\limits_{j=1}^{L_{t}}|t_{i,j}|^{2}.

Refer to caption
Figure 1: Diagram of the PLA at the transmitter side.

The received signal 𝐲\bf{y} at the controller in the considered massive SIMO system can be represented by

𝐲=𝐡x+𝐧,{\bf{y}}={\bf{h}}x+{\bf{n}}, (4)

where 𝐡=[h1,,hN]T{\bf{h}}=[h_{1},\cdots,h_{N}]^{T} is the SIMO channel vector and 𝐧=[n1,,nN]T{\bf{n}}=[n_{1},\cdots,n_{N}]^{T} is the noise vector between the sensor and controller. We assume that 𝐡\bf{h} is a circularly symmetric complex Gaussian random vector, specifically, each element of 𝐡\bf{h} is independently and identically distributed with zero mean and unit variance (i.e., Rayleigh fading). Another assumption is that 𝐧\bf{n} is a circularly symmetric complex Gaussian random vector which is independent of 𝐡\bf{h}. The mean vector of 𝐧\bf{n} is a zero vector and its covariance matrix is σ2𝐈N\sigma^{2}{\bf I}_{N} . σ2\sigma^{2} is assumed to be known and 𝐈N{\bf I}_{N} is an NN-dimensional unit matrix.

Two steps are required in the signal detection at the receiver side. First, following the ML detection rule, the estimated message signal m^\hat{m} is obtained by solving the problem

m^=argmaxmf(𝐲|m),{\hat{m}}=\operatorname*{arg\max}_{m\in\mathcal{M}}{f({\bf{y}}|m)}, (5)

where f(𝐲|m)f({\bf{y}}|m) is the probability density function (PDF) of 𝐲\bf{y} conditioned on mm. Second, the estimated tag signal t^\hat{t} is obtained based on m^\hat{m} with the ML rule,

t^=argmaxt𝒯f(𝐲|m^,t),{\hat{t}}=\operatorname*{arg\max}_{t\in\mathcal{T}}{f({\bf{y}}|\hat{m},t)}, (6)

where f(𝐲|m^,t)f({\bf{y}}|\hat{m},t) is the PDF of 𝐲\bf{y} conditioned on m^\hat{m} and tt.

After the detection, we can get the estimated message bits bb^{\prime} and the estimated MAC MM^{\prime} with the demodulation of m^\hat{m} and t^\hat{t}, respectively. Then a new MAC MnM_{n} is calculated with bb^{\prime} and kk by the same hash function, i.e., Mn=hash(b,k)M_{n}={\rm hash}(b^{\prime},k). The authentication process is completed by comparing MM^{\prime} with MnM_{n}. If MM^{\prime} and MnM_{n} are identical, the message can be regraded as coming from a legitimate user111Note that time stamps or session identifiers are required to resist replay attacks. and not being tampered with. Otherwise, this message will be discarded because it is not authenticated successfully.

III Preliminaries and Detection Rules

In this section, we first introduce preliminaries on non-negative PAM design for message constellation in the massive SIMO system, and then present the 1-bit tag embedding design when the message constellation points are given.

III-A Preliminaries on Message Constellation Design

We now consider only a message signal mm\in\mathcal{M} is transmitted. The problem (5) has been solved in [8], which showed that the ML detection problem can be solved by a quantization operation. More specifically, the quantization operation is described as [8]

m^={m1,if𝐲2N<B1;mi,ifBi1𝐲2NBi,i=2,,Lm1;mLm,if𝐲2N>BLm1,\hat{m}=\begin{cases}m_{1},&{\rm if}\ \frac{||{\bf{y}}||^{2}}{N}<B_{1};\cr m_{i},&{\rm if}\ B_{i-1}\leq\frac{||{\bf{y}}||^{2}}{N}\leq B_{i},\ i=2,\cdots,L_{m}-1;\cr m_{{L_{m}}},&{\rm if}\ \frac{||{\bf{y}}||^{2}}{N}>B_{L_{m}-1},\end{cases} (7)

where BiB_{i} is the optimal decision threshold between mim_{i} and mi+1m_{i+1}. The threshold BiB_{i} can be represented by

Bi=AiAi+1lnAi+1AiAi+1Ai,i=1,,Lm1,B_{i}=\frac{A_{i}A_{i+1}\ln{\frac{A_{i+1}}{A_{i}}}}{A_{i+1}-A_{i}},\quad i=1,...,L_{m}-1, (8)

where Ai=|mi|2+σ2A_{i}=|m_{i}|^{2}+\sigma^{2}. Based on this optimal decision rule, the correct detection probability of ii-th symbol mim_{i}, denoted by Pc,iP_{c,i}, is determined by [8]

Pc,i={G(NBiAi),ifi=1;G(NBiAi)G(NBi1Ai),ifi=2,,Lm1;1G(NBLm1Ai),ifi=Lm,P_{c,i}=\begin{cases}G\left(\frac{NB_{i}}{A_{i}}\right),&{\rm if}\ i=1;\cr G\left(\frac{NB_{i}}{A_{i}}\right)-G\left(\frac{NB_{i-1}}{A_{i}}\right),&{\rm if}\ i=2,\cdots,L_{m}-1;\cr 1-G\left(\frac{NB_{L_{m}-1}}{A_{i}}\right),&{\rm if}\ i=L_{m},\end{cases} (9)

where G(z)G(z) is the cumulative distribution function (CDF) of a complex Chi-squared distribution variable ZZ, given by

G(z)=1ezL=0N1zLL!,z>0.G(z)=1-e^{-z}\sum_{L=0}^{N-1}\frac{z^{L}}{L!},\ \ z>0. (10)

When each message symbol is selected from \mathcal{M} with equal probability, the average message symbol error rate (SER), denoted by PeP_{e}, can be calculated as follows:

Pe=11Lmi=1LmPc,i.P_{e}=1-\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}}P_{c,i}. (11)

By minimizing PeP_{e} under the constraint that average message power is not greater than EmE_{m}, the asymptotically optimal non-negative PAM constellation design for massive SIMO systems can be represented as follows [8]:

{0,σ2(R1),σ2(R21),,σ2(RLm11)},\left\{0,\sigma^{2}({R}-1),\sigma^{2}({R}^{2}-1),\cdots,\sigma^{2}({R}^{L_{m}-1}-1)\right\}, (12)

where R{R} (R>1{R}>1) is obtained by solving the equation

j=0Lm1Rj=Lm(Emσ2+1).\sum\limits_{j=0}^{L_{m}-1}{R}^{j}=L_{m}\left(\frac{E_{m}}{\sigma^{2}}+1\right). (13)

The message signal-to-noise ratio (SNR), denoted by γm\gamma_{m}, is defined as γm=Emσ2{\gamma_{m}}=\frac{E_{m}}{\sigma^{2}}. The constellation points are described from the perspective of power since there is a specific correspondence between power and amplitude in non-negative PAM. Take Lm=4L_{m}=4 as an example, the message constellation points described with AiA_{i} and the corresponding decision thresholds BiB_{i} are shown in Fig. 2(a).

Refer to caption
(a) Message constellation design and decision thresholds
Refer to caption
(b) Tag Embedding design and updated decision thresholds.
Figure 2: Signal design and decision thresholds.

III-B Tag Embedding Design

We are now ready to elaborate the proposed tag embedding scheme and the corresponding detection rule. One-bit embedding is considered in this paper, i.e., Lt=2L_{t}=2. When the ii-th message symbol is transmitted, the power of the embedded symbol Ei,jE_{i,j} has two possible values according to two different tag bits,

Ei,j={|mi|2+|ti,1|2,ifj=1(tagbitis 0);|mi|2+|ti,2|2,ifj=2(tagbitis 1).E_{i,j}=\begin{cases}|m_{i}|^{2}+|{t_{i,1}}|^{2},&{\rm if}\ j=1\ ({\rm{tag\ bit\ is\ 0)}};\cr|m_{i}|^{2}+|{t_{i,2}}|^{2},&{\rm if}\ j=2\ ({\rm{tag\ bit\ is\ 1)}}.\end{cases} (14)

Note that the power of tag signal ti,1{t_{i,1}} and ti,2{t_{i,2}} are variables depending on message signal mim_{i}, which is the key idea of the proposed “Message-based Tag Modulation”. In existing methods that use uniform tag embedding, ti,1{t_{i,1}} and ti,2{t_{i,2}} are constants for different message signal mim_{i}. The reason we do not use uniform tag embedding is that the message constellation points in our method contain the relationship of geometric series as shown in Fig. 2(a). If ti,1{t_{i,1}} and ti,2{t_{i,2}} are high power tag signals, they may be suitable for signal points A3A_{3} and A4A_{4}, but will not work well for A1A_{1} and A2A_{2}, and vice versa. Due to the effect of the embedding tag, the message decision thresholds (8) need to be updated. We also take Lm=4L_{m}=4 as an example to show the tag embedding design and the corresponding decision thresholds in Fig. 2(b). Since the message constellation points that are close to each other are more error-prone, we use the nearest two constellation points to calculate the new message decision threshold BiB_{i}^{\prime} by (8),

Bi=Ai,2Ai+1,1lnAi+1,1Ai,2Ai+1,1Ai,2,i=1,,Lm1,B_{i}^{\prime}=\frac{A_{i,2}A_{i+1,1}\ln{\frac{A_{i+1,1}}{A_{i,2}}}}{A_{i+1,1}-A_{i,2}},\ i=1,\cdots,L_{m}-1, (15)

where Ai,j=Ei,j+σ2A_{i,j}=E_{i,j}+\sigma^{2}. Using (7) and (15), the message symbol can be estimated, which is the first step of the detection. Based on the result of estimated message symbol, tag symbol is detected subsequently with the following rule,

t^={ti,1(tagbitis 0),if𝐲2NCi;ti,2(tagbitis 1),if𝐲2N>Ci;\hat{t}=\begin{cases}t_{i,1}({\rm{tag\ bit\ is\ 0)}},&{\rm if}\ \frac{||{\bf{y}}||^{2}}{N}\leq C_{i};\cr t_{i,2}({\rm{tag\ bit\ is\ 1)}},&{\rm if}\ \frac{||{\bf{y}}||^{2}}{N}>C_{i};\end{cases} (16)

where CiC_{i} is the optimal decision threshold to decide which tag bit is embedded in message signal mim_{i}. Since (8) also follows the general form of non-coherent ML decision threshold, CiC_{i} can be expressed as

Ci=Ai,1Ai,2lnAi,2Ai,1Ai,2Ai,1,i=1,2,,Lm.C_{i}=\frac{A_{i,1}A_{i,2}\ln{\frac{A_{i,2}}{A_{i,1}}}}{A_{i,2}-A_{i,1}},\ i=1,2,\cdots,L_{m}. (17)

Note that the instantaneous CSI is not required in message detector (7) and tag detector (16). As such, successive interference cancellation (SIC) detection widely used in existing PLA methods is no longer applicable in this method. According to the constellation design results of Section III-A, the optimal power of first constellation point is zero. Therefore, we can set the power of the tag signal to zero when tag bit is 0, i.e., |ti,1|2=0|t_{i,1}|^{2}=0 (for i=1,,Lmi=1,\cdots,L_{m}).

IV Error Performance Analysis and Optimization

In this section, the message SER and tag SER are analyzed first as the performance metrics of the proposed PLA method. Then the optimization problem of signal design is formulated and solved according to the specific system requirements.

IV-A Error Performance Analysis

According to the assumptions of 𝐡\bf{h} and 𝐧\bf{n} in Section II, 𝐲\bf{y} is also a circularly symmetric complex Gaussian random vector. The mean vector of 𝐲\bf{y} is a zero vector, and its covariance matrix can be written as

𝔼[𝐲𝐲H]=𝔼[(𝐡|m|2+|t|2+𝐧)(𝐡|m|2+|t|2+𝐧)H]=(|m|2+|t|2+σ2)𝐈N.\begin{split}\mathbb{E}\left[{\bf{y}}{\bf{y}}^{H}\right]&=\mathbb{E}\left[\left({\bf{h}}\sqrt{|m|^{2}+|t|^{2}}+{\bf{n}}\right)\left({\bf{h}}\sqrt{|m|^{2}+|t|^{2}}+{\bf{n}}\right)^{H}\right]\\ &=\left(|m|^{2}+|t|^{2}+\sigma^{2}\right){\bf I}_{N}.\end{split} (18)

Define a new random variable ZZ^{\prime}

Z=𝐲2|m|2+|t|2+σ2,Z^{\prime}=\frac{||{\bf{y}}||^{2}}{|m|^{2}+|t|^{2}+\sigma^{2}}, (19)

which follows complex Chi-squared distribution. When m1m_{1} is transmitted with embedding tag t1,1t_{1,1}, according to (7) and (15), the message signal can be correctly detected if 𝐲2N<B1\frac{||{\bf{y}}||^{2}}{N}<B_{1}^{\prime}. This condition is equivalent to

𝐲2|m1|2+|t1,1|2+σ2<NB1|m1|2+|t1,1|2+σ2=NB1A1,1.\frac{||{\bf{y}}||^{2}}{|m_{1}|^{2}+|t_{1,1}|^{2}+\sigma^{2}}<\frac{NB_{1}^{\prime}}{|m_{1}|^{2}+|t_{1,1}|^{2}+\sigma^{2}}=\frac{NB_{1}^{\prime}}{A_{1,1}}. (20)

Let Pcm,iP_{cm,i} denote the average correct message detection probability of xix_{i}. Then Pcm,1P_{cm,1} can be derived as

Pcm,1=G(NB1A1,1).P_{cm,1}=G\left(\frac{NB_{1}^{\prime}}{A_{1,1}}\right). (21)

Similarly, Pcm,iP_{cm,i} can be given by

Pcm,i={12j=12G(NBiAi,j),ifi=1;12j=12[G(NBiAi,j)G(NBi1Ai,j)],ifi=2,,Lm1;12j=12[1G(NBLm1Ai,j)],ifi=Lm.P_{cm,i}=\begin{cases}\frac{1}{2}\!\sum\limits_{j=1}^{2}G\left(\frac{NB_{i}^{\prime}}{A_{i,j}}\right),&{\rm if}\ i\!=\!1;\cr\frac{1}{2}\!\sum\limits_{j=1}^{2}\left[G\left(\frac{NB_{i}^{\prime}}{A_{i,j}}\right)\!-\!G\left(\frac{NB_{i-1}^{\prime}}{A_{i,j}}\right)\right],&{\rm if}\ i\!=\!2,\cdots,L_{m}\!-1\!;\cr\frac{1}{2}\!\sum\limits_{j=1}^{2}\left[1\!-\!G\left(\frac{NB_{L_{m}-1}^{\prime}}{A_{i,j}}\right)\right],&{\rm if}\ i\!=\!L_{m}.\end{cases} (22)

The average message SER PemP_{em} can be calculated as

Pem=11Lmi=1LmPcm,i.P_{em}=1-\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}}P_{cm,i}. (23)

The assumption is made that the message symbols are selected from constellation points collection with equal probability. Due to the uniformity characteristic of hash functions, different tag bits can also be considered appearing with equal probability[15].

We now consider the error performance of the tag signal. Suitable hash functions exhibit “avalanche effect”, i.e., the output changes significantly if the input alters slightly[15]. The authentication fails when the message estimation has only one bit error, which indicates that the recalculated MAC will be meaningless if the message parts have errors. As a result, we consider the tag SER under the condition that the message symbol is detected correctly. It should be noted that the message SER can be controlled to be low enough (e.g. less than 10510^{-5}) during the embedding design process. Therefore, in this paper, the tag correct rate and error rate are calculated from the perspective of conditional probability. When the embedded symbol xix_{i} is transmitted, the tag correct detection rate under the condition that the message symbol mim_{i} is correctly obtained can be determined by (16), which is

Pct,i=12[G(NCiAi,1)+1G(NCiAi,2)].P_{ct,i}=\frac{1}{2}\left[G\left(\frac{NC_{i}}{A_{i,1}}\right)+1-G\left(\frac{NC_{i}}{A_{i,2}}\right)\right]. (24)

To simplify the expression, we define the proportional variables ri(i=1,,Lm)r_{i}(i=1,\cdots,L_{m})

ri=Ai,2Ai,1, 1<ri<R.r_{i}=\frac{A_{i,2}}{A_{i,1}},\ 1<r_{i}<R. (25)

Therefore, the average tag SER, denoted by PetP_{et}, can be represented by

Pet=1Lmi=1Lm(1Pct,i)=12Lmi=1Lm[1+G(Nu(ri))G(Nv(ri))],\begin{split}P_{et}&=\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}}\left(1-P_{ct,i}\right)\cr&=\frac{1}{2L_{m}}\sum\limits_{i=1}^{L_{m}}\left[1+G\left(Nu(r_{i})\right)-G\left(Nv(r_{i})\right)\right],\end{split} (26)

where u(ri)=lnriri1u(r_{i})=\frac{\ln r_{i}}{r_{i}-1} and v(ri)=rilnriri1v(r_{i})=\frac{r_{i}\ln r_{i}}{r_{i}-1}.

IV-B Trade-off Characterization

One primary purpose of this paper is to design an optimal embedding scheme to minimize the tag SER subject to the total average power constraint. Meanwhile, the system reliability should meet the certain requirement, i.e., Pem<δP_{em}<\delta, where δ\delta is the message SER requirement threshold. This optimization problem is formulated as follows

min{Ai,j}i=1,,Lmj=1,2Pet\displaystyle\min\limits_{\{A_{i,j}\}_{i=1,\cdots,L_{m}}^{j=1,2}}\quad P_{et} (27a)
s.t.Et+EmEtot,\displaystyle{\rm{s.t.}}\quad E_{t}+E_{m}\leq E_{tot}, (27b)
Pemδ.\displaystyle\ \ \ \ \ \ \ P_{em}\leq\delta. (27c)

This problem is non-trivial because of multiple optimization variables and the complex structure of constraint functions. To simplify this problem, we use two steps to solve it. First, we find the optimal tag embedding scheme when the message constellation is fixed (i.e., EmE_{m} is given). Second, we search for the optimal allocated power of message EmE_{m} that can minimize the tag SER.

Now we consider the first step. When EmE_{m} is fixed, the message SER PemP_{em} and the tag SER PetP_{et} are given by (23) and (26), respectively. Note that PemP_{em} is complicated since it contains multiple variables (Ai,jA_{i,j}, i=1,,Lm,j=1or 2i=1,\cdots,L_{m},\ j=1\ {\rm or}\ 2). To reduce the complexity of constraint (27c), an upper bound of message SER, PemuP_{em}^{u}, can be derived to replace PemP_{em} in (27c). The upper bound can be derived as follows

Pemu=1Lmi=1Lm1{1G[Ng(ri)]+G[Nh(ri)]},P_{em}^{u}=\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}-1}\left\{1-G\left[Ng(r_{i})\right]+G\left[Nh(r_{i})\right]\right\}, (28)

where g(ri)=RlnRriRrig(r_{i})=\frac{{R}\ln{\frac{{R}}{r_{i}}}}{{R}-r_{i}}, h(ri)=rilnRriRrih(r_{i})=\frac{r_{i}\ln{\frac{{R}}{r_{i}}}}{{R}-r_{i}}. The proof is provided in Appendix A.

Using variable substitution ri=eki(0<ki<lnR)r_{i}=e^{k_{i}}(0<k_{i}<\ln{R}) and the message SER upper bound in (28), the optimization problem (27) can be rewritten as

min{ki}i=1Lm12Lmi=1Lm{1+G[Nu(eki)]G[Nv(eki)]}\displaystyle\min\limits_{\{k_{i}\}_{i=1}^{L_{m}}}\quad\frac{1}{2L_{m}}\sum\limits_{i=1}^{L_{m}}\left\{1+G\left[Nu(e^{k_{i}})\right]-G\left[Nv(e^{k_{i}})\right]\right\} (29a)
s.t.12Lmi=1LmAi,1(eki1)EtotEm,\displaystyle{\rm{s.t.}}\quad\frac{1}{2L_{m}}\sum\limits_{i=1}^{L_{m}}A_{i,1}(e^{k_{i}}-1)\leq E_{tot}-E_{m}, (29b)
1Lmi=1Lm1{1G[Ng(eki)]+G[Nh(eki)]}δ.\displaystyle\ \ \ \ \ \ \ \frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}-1}\left\{1-G\left[Ng(e^{k_{i}})\right]+G\left[Nh(e^{k_{i}})\right]\right\}\leq\delta. (29c)

We can show that (36) is a convex optimization problem and the proof is provided in Appendix B. Therefore (36) can be efficiently solved by interior-point method and the optimal tag embedding scheme can be determined when EmE_{m} is given.

In the second step, we consider the situation when EmE_{m} is a variable, different EmE_{m} results in different values of PetP_{et}. In this case, the optimization result of (36) is a function of EmE_{m}, which is denoted by H(Em)H(E_{m}). Note that when H(Em)H(E_{m}) achieves its minimal value, the inequality (27b) will become a equality, i.e., Em+Et=EtotE_{m}+E_{t}=E_{tot}. The reason is that if EtotE_{tot} still has a surplus, PemP_{em} and PetP_{et} can be further reduced by increasing message and tag power at the same time. Therefore, this optimization problem can be narrated as finding the optimal power allocation between message signal and tag signal when the constraints are still satisfied. Define the power allocation factor α\alpha,

α=EmEtot,α0α1,\alpha=\frac{E_{m}}{E_{tot}},\ \alpha_{0}\leq\alpha\leq 1, (30)

where α0\alpha_{0} is the minimum factor that makes EmE_{m} satisfy the constraint PemuδP_{em}^{u}\leq\delta. The function H(Em)H(E_{m}) can be represented by H(α)H(\alpha), which indicates that different α\alpha corresponds to different minimized tag SER. Therefore, the new power allocation problem can be formulated as

minα0α1H(α)\displaystyle\min\limits_{\alpha_{0}\leq\alpha\leq 1}\quad H(\alpha) (31a)
s.t.Et(1α)Etot,\displaystyle{\rm{s.t.}}\quad E_{t}\leq(1-\alpha)E_{tot}, (31b)
Pe,muδ.\displaystyle\ \ \ \ \ \ \ P_{e,m}^{u}\leq\delta. (31c)

This is a problem of single variable with a limited range, which can be efficiently solved by one-dimensional search.

When we set different values of message SER requirement threshold δ\delta for the considered system, different minimized tag SER can be obtained by solving the optimization problem (27). Therefore, we can characterize the trade-off between the message and tag error performance through changing the value of the message SER requirement thresholds.

V Numerical Results

We carried out computer simulations to verify the theoretical results. In our simulations, we set N=128N=128 and σ2=1\sigma^{2}=1.

Firstly, to show the accuracy of the message and tag error performance analysis, the theoretical and simulation results of PemP_{em} and PetP_{et} are demonstrated in Fig. 3 and they match with each other.

Refer to caption

Figure 3: Comparison of SER of the proposed embedding scheme and uniform embedding scheme.

EtotE_{tot} is set to be large enough because optimization has not yet been considered. The “Message-based Tag Modulation” scheme is compared with the “Uniform Embedding” scheme that embeds same tag power levels for all message symbols. For a fair comparison, we control the tag power of two embedding schemes to make sure they have the same message SER performance (i.e., less than 10510^{-5}) when the message SNR is 1010dB. The results show that the tag SER of the proposed embedding scheme decreases as the message SNR increases. However, the tag SER of the “Uniform Embedding” scheme is always above 90%90\%. Therefore, “Uniform Embedding” scheme is not suitable for PLA in non-coherent massive SIMO communications.

Then we focus on the optimal performance by solving optimization problems in Section IV-B. The message SER upper bound threshold δ\delta is set to 10510^{-5}. The results of optimization problem (36) and the search results for power allocation are provided in Fig. 4. The tag SER decreases as the total system average power increases and the optimal power allocation factor can be found from the results.

Refer to caption

Figure 4: Optimization results of tag SER with different EtotE_{tot}.

Finally, to understand the entire system performance, the trade-off between PemP_{em} and PetP_{et} is depicted in Fig. 5. We can observe from the trade-off curves that the tag SER decreases as the message SER requirement threshold increases. The results in Fig. 5 also show that both tag SER and message SER can be reduced when the total system average power increases. The trade-off curve presents the optimal tag SER performance under different system requirements for message SER, which can provide useful insights for practical PLA system design.

VI Conclusions

In this paper, we proposed an active PLA mechanism for non-coherent massive SIMO-based IIoT systems. This paper is the first to show that active PLA can be achieved without the need of pilot signal and channel estimation. We designed the optimal tag embedding scheme when the message constellation is given. Then we solved the power allocation problem to obtain the optimal tag SER performance. The trade-off curve between tag SER and message SER was depicted to offer a comprehensive understanding of the system performance. From the simulation results, we can conclude that “Message-based Tag Modulation” is necessary for the considered non-coherent system. Moreover, the proposed authentication method can meet the specific power and error rate requirements of IIoT system. As an initial effort, the tag embedding design was limited to 1-bit tag per message symbol in this paper. We will extend our work to multiple bits tag per message symbol for future work.

Refer to caption

Figure 5: Trade-off curves of tag SER and message SER with different EtotE_{tot}.

Appendix A Proof of an Upper Bound of the Message SER

Notice that the average message SER of x1x_{1} is less than transmitting m12+t1,22\sqrt{{m_{1}}^{2}+{t_{1,2}}^{2}}, because close constellation points produce a large message SER. Let Pem,iP_{em,i} denote the average message SER when mim_{i} is transmitted. Pem,1P_{em,1} and its upper bound can be derived as follows

Pem,1\displaystyle P_{em,1} =12[P(m^=m2,,mLm|x1=m12+t1,12)\displaystyle=\frac{1}{2}\Bigg{[}{\rm P}\left(\hat{m}=m_{2},\cdots,m_{L_{m}}|x_{1}=\sqrt{{m_{1}}^{2}+{t_{1,1}}^{2}}\right) (32)
+P(m^=m2,,mLm|x1=m12+t1,22)]\displaystyle\ \ \ +{\rm P}\left(\hat{m}=m_{2},\cdots,m_{L_{m}}|x_{1}=\sqrt{{m_{1}}^{2}+{t_{1,2}}^{2}}\right)\Bigg{]}
<P(m^=m2,,mLm|x1=m12+t1,22)\displaystyle<{\rm P}\left(\hat{m}=m_{2},\cdots,m_{L_{m}}|x_{1}=\sqrt{{m_{1}}^{2}+{t_{1,2}}^{2}}\right)
=1G(NB1A1,2).\displaystyle=1-G\left(\frac{NB_{1}^{\prime}}{A_{1,2}}\right).

Similarly, the average message SER of xLmx_{L_{m}} is less than transmitting mLm2+tLm,12\sqrt{{m_{L_{m}}}^{2}+{t_{L_{m},1}}^{2}}, so the upper bound of Pem,LmP_{em,L_{m}} can be derived as follows

Pem,Lm\displaystyle P_{em,L_{m}} <P(m^=m1,,mLm1|xLm=mLm2+tLm,12)\displaystyle<{\rm P}\left(\hat{m}=m_{1},\cdots,m_{L_{m}-1}|x_{L_{m}}=\sqrt{{m_{L_{m}}}^{2}+{t_{L_{m},1}}^{2}}\right) (33)
=G(NBLm1ALm,1).\displaystyle=G\left(\frac{NB_{L_{m}-1}^{\prime}}{A_{Lm,1}}\right).

Further, the average message SER of xi(i=2,,Lm1)x_{i}(i=2,\cdots,L_{m}-1) also has an upper bound due to the same reason above,

Pem,i\displaystyle P_{em,i} <P(m^=m1,,mi1|xi=mi2+ti,12)\displaystyle<{\rm P}\left(\hat{m}=m_{1},\cdots,m_{i-1}|x_{i}=\sqrt{{m_{i}}^{2}+{t_{i,1}}^{2}}\right) (34)
+P(m^=mi+1,,mLm|xi=mi2+ti,22)\displaystyle\ \ \ +{\rm P}\left(\hat{m}=m_{i+1},\cdots,m_{L_{m}}|x_{i}=\sqrt{{m_{i}}^{2}+{t_{i,2}}^{2}}\right)
=1G(NBiAi,2)+G(NBi1Ai,1).\displaystyle=1-G\left(\frac{NB_{i}^{\prime}}{A_{i,2}}\right)+G\left(\frac{NB_{i-1}^{\prime}}{A_{i,1}}\right).

From the above, an upper bound of PemP_{em} can be derived as

Pem\displaystyle P_{em} =1Lmi=1LmPem,i\displaystyle=\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}}P_{em,i} (35)
<1Lmi=1Lm1[1G(NBiAi,2)+G(NBiAi+1,1)]\displaystyle<\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}-1}\left[1-G\left(\frac{NB_{i}^{\prime}}{A_{i,2}}\right)+G\left(\frac{NB_{i}^{\prime}}{A_{i+1,1}}\right)\right]
=1Lmi=1Lm1{1G[Ng(ri)]+G[Nh(ri)]},\displaystyle=\frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}-1}\left\{1-G\left[Ng(r_{i})\right]+G\left[Nh(r_{i})\right]\right\},

where g(ri)=RlnRriRrig(r_{i})=\frac{{R}\ln{\frac{{R}}{r_{i}}}}{{R}-r_{i}}, h(ri)=rilnRriRrih(r_{i})=\frac{r_{i}\ln{\frac{{R}}{r_{i}}}}{{R}-r_{i}}. This completes the proof of an upper bound of the message SER.

Appendix B Proof of the convex optimization problem

The considered optimization problem is rewritten as follows:

min{ki}i=1Lm12Lmi=1Lm{1+G[Nu(eki)]G[Nv(eki)]}\displaystyle\min\limits_{\{k_{i}\}_{i=1}^{L_{m}}}\quad\frac{1}{2L_{m}}\sum\limits_{i=1}^{L_{m}}\left\{1+G\left[Nu(e^{k_{i}})\right]-G\left[Nv(e^{k_{i}})\right]\right\} (36a)
s.t.12Lmi=1LmAi,1(eki1)EtotEm,\displaystyle{\rm{s.t.}}\quad\frac{1}{2L_{m}}\sum\limits_{i=1}^{L_{m}}A_{i,1}(e^{k_{i}}-1)\leq E_{tot}-E_{m}, (36b)
1Lmi=1Lm1{1G[Ng(eki)]+G[Nh(eki)]}δ.\displaystyle\ \ \ \ \ \ \ \frac{1}{L_{m}}\sum\limits_{i=1}^{L_{m}-1}\left\{1-G\left[Ng(e^{k_{i}})\right]+G\left[Nh(e^{k_{i}})\right]\right\}\leq\delta. (36c)

Let F(k)=1+G[Nu(ek)]G[Nv(ek)]F(k)=1+G\left[Nu(e^{k})\right]-G\left[Nv(e^{k})\right] and W(k)=1G[Ng(ek)]+G[Nh(ek)]W(k)=1-G\left[Ng(e^{k})\right]+G\left[Nh(e^{k})\right].

F(k)F(k) is a convex function for 0<k<lnR0<k<\ln{R} according to the lemma in [8]. The objective function in (36a) is a sum of LmL_{m} convex functions F(ki)(i=1,,Lm)F(k_{i})(i=1,\cdots,L_{m}) and its Hessian matrix is a diagonal matrix, thus the Hessian matrix is positive definite and the objective function in (36a) is a convex function. Note that ek1e^{k}-1 is a basic convex function. The left side of (36b) is a sum of LmL_{m} convex functions eki1(i=1,,Lm)e^{k_{i}}-1(i=1,\cdots,L_{m}) and its Hessian matrix is a diagonal matrix, so it is also a convex function. The left side of (36c) is a sum of Lm1L_{m}-1 functions W(ki)(i=1,,Lm1)W(k_{i})(i=1,\cdots,L_{m}-1) and its Hessian matrix is a diagonal matrix. Therefore, the optimization problem (36) is a convex problem if W(k)W(k) is a convex function for 0<k<lnR0<k<\ln{R}.

Let W1(k)=G[Ng(ek)]W_{1}(k)=G\left[Ng(e^{k})\right] and W2(k)=G[Nh(ek)]W_{2}(k)=G\left[Nh(e^{k})\right]. Then we have W(k)=W2(k)W1(k)W^{\prime}(k)=W^{\prime}_{2}(k)-W^{\prime}_{1}(k). The derivative of G(z)G(z) is fZ(z)=1(N1)!zN1ezf_{Z}(z)=\frac{1}{(N-1)!}z^{N-1}e^{-z}. Then we have

W1(k)\displaystyle W^{\prime}_{1}(k) =fZ[Ng(ek)]Ng(ek)\displaystyle=f_{Z}\left[Ng(e^{k})\right]Ng^{\prime}(e^{k}) (37)
=1(N1)![Ng(ek)]N1eNg(ek)Ng(ek).\displaystyle=\frac{1}{(N-1)!}\left[Ng(e^{k})\right]^{N-1}e^{-Ng(e^{k})}Ng^{\prime}(e^{k}).

Since h(ek)=g(ek)ekR=g(ek)+(klnR)h(e^{k})=g(e^{k})\frac{e^{k}}{R}=g(e^{k})+(k-\ln{R}), we can obtain that h(ek)=1Rek[g(ek)+g(ek)]h^{\prime}(e^{k})=\frac{1}{R}e^{k}\left[g(e^{k})+g^{\prime}(e^{k})\right]. Then we have

W2(k)\displaystyle W^{\prime}_{2}(k) =fZ[Nh(ek)]Nh(ek)\displaystyle=f_{Z}\left[Nh(e^{k})\right]Nh^{\prime}(e^{k}) (38)
=1(N1)![Nh(ek)]N1eNh(ek)Nh(ek)\displaystyle=\frac{1}{(N-1)!}\left[Nh(e^{k})\right]^{N-1}\cdot e^{-Nh(e^{k})}Nh^{\prime}(e^{k})
=1(N1)![Ng(ek)ekR]N1eN[g(ek)+(klnR)]\displaystyle=\frac{1}{(N-1)!}\left[Ng(e^{k})\frac{e^{k}}{R}\right]^{N-1}\cdot e^{-N\left[g(e^{k})+(k-\ln{R})\right]}
N{1Rek[g(ek)+g(ek)]}\displaystyle\ \ \ \cdot N\left\{\frac{1}{R}e^{k}\left[g(e^{k})+g^{\prime}(e^{k})\right]\right\}
=W1(k)+1(N1)!NNg(ek)NeNg(ek).\displaystyle=W^{\prime}_{1}(k)+\frac{1}{(N-1)!}N^{N}g(e^{k})^{N}e^{-Ng(e^{k})}.

Therefore, we can simplify the W(k)W^{\prime}(k) as follows

W(k)=1(N1)!NNg(ek)NeNg(ek).W^{\prime}(k)=\frac{1}{(N-1)!}N^{N}g(e^{k})^{N}e^{-Ng(e^{k})}. (39)

The second-order derivative of W(k)W(k) can be obtained by

W′′(k)=NN+1g(ek)N1eNg(ek)g(ek)[1g(ek)](N1)!,W^{\prime\prime}(k)=\frac{N^{N+1}g(e^{k})^{N-1}e^{-Ng(e^{k})}g^{\prime}(e^{k})\left[1-g(e^{k})\right]}{(N-1)!}, (40)

where

g(ek)\displaystyle g^{\prime}(e^{k}) =R[ekR+ek(lnRk)](Rek)2\displaystyle=\frac{R\left[e^{k}-R+e^{k}(\ln{R}-k)\right]}{(R-e^{k})^{2}} (41)
=r=ekRr(Rr)2(1+lnRrRr).\displaystyle\overset{r=e^{k}}{=}\frac{Rr}{(R-r)^{2}}(1+\ln{\frac{R}{r}}-\frac{R}{r}).

Since lnxx\ln{x}-x is a monotonically decreasing function for x>1x>1, then we have 1+lnRrRr<01+\ln{\frac{R}{r}}-\frac{R}{r}<0. Therefore, g(ek)<0g^{\prime}(e^{k})<0 for 0<k<lnR0<k<\ln{R}. Then we know that g(ek)g(e^{k}) is a decreasing function when 0<k<lnR0<k<\ln{R}. Moreover, limklnRg(ek)=1\lim_{k\to\ln{R}}g(e^{k})=1, then 1g(ek)<01-g(e^{k})<0 for 0<k<lnR0<k<\ln{R}. We can conclude that W′′(k)>0(0<k<lnR)W^{\prime\prime}(k)>0(0<k<\ln{R}), thus W(k)W(k) is a convex function for 0<k<lnR0<k<\ln{R}. Above all, the optimization problem (36) is a convex problem.

References

  • [1] M. Luvisotto, Z. Pang and D. Dzung, “Ultra High Performance Wireless Control for Critical Applications: Challenges and Directions,” IEEE Trans. Ind. Informat., vol. 13, no. 3, pp. 1448-1459, June 2017.
  • [2] H. Chen et al., “Ultra-Reliable Low Latency Cellular Networks: Use Cases, Challenges and Approaches,” IEEE Wireless Commun. Mag., vol. 56, no. 12, pp. 119-125, December 2018.
  • [3] T. Lennvall, M. Gidlund and J. Akerberg, “Challenges when bringing IoT into industrial automation,” in 2017 IEEE AFRICON, Cape Town, 2017, pp. 905-910.
  • [4] A. Goldsmith, Wireless communications, Cambridge university press, 2005.
  • [5] F. Pan, Z. Pang, M. Luvisotto, M. Xiao and H. Wen, “Physical-Layer Security for Industrial Wireless Control Systems: Basics and Future Directions,” IEEE Ind. Electron. Mag., vol. 12, no. 4, pp. 18-27, Dec. 2018.
  • [6] P. Popovski et al., “Wireless Access for Ultra-Reliable Low-Latency Communication: Principles and Building Blocks,” IEEE Network, vol. 32, no. 2, pp. 16-23, March-April 2018.
  • [7] H. Chen, Z. Dong and B. Vucetic, “Noncoherent and Non-orthogonal Massive SIMO for Critical Industrial IoT Communications,” in Proc. of IEEE ICPS 2019, Taipei, May 2019.
  • [8] X. Gao, J. Zhang, H. Chen, Z. Dong and B. Vucetic, “Energy-Efficient and Low-Latency Massive SIMO Using Noncoherent ML Detection for Industrial IoT Communications,” IEEE Internet of Things Journal, vol. 6, no. 4, pp. 6247-6261, Aug. 2019.
  • [9] Y. Zou, J. Zhu, X. Wang and L. Hanzo, “A Survey on Wireless Security: Technical Challenges, Recent Advances, and Future Trends,” in Proc. of the IEEE, vol. 104, no. 9, pp. 1727-1765, Sept. 2016.
  • [10] C. E. Shannon, “Communication theory of secrecy systems,” Bell System Tech. J., vol. 28, no. 4, pp. 656–715, Oct. 1949.
  • [11] A. D. Wyner, “The wire-tap channel,” Bell System Tech. J., vol. 54, no. 8, pp. 1355–1387, Oct. 1975
  • [12] H. Forssell, R. Thobaben, H. Al-Zubaidy and J. Gross, “Physical Layer Authentication in Mission-Critical MTC Networks: A Security and Delay Performance Analysis,” IEEE J. Select. Areas Commun., vol. 37, no. 4, pp. 795-808, April 2019.
  • [13] N. Xie and C. Chen, “Slope Authentication at the Physical Layer,” IEEE Trans. Inf. Forensics Security, vol. 13, no. 6, pp. 1579-1594, June 2018.
  • [14] W. Wang, Z. Sun, S. Piao, B. Zhu and K. Ren, “Wireless Physical-Layer Identification: Modeling and Validation,” IEEE Trans. Inf. Forensics Security, vol. 11, no. 9, pp. 2091-2106, Sept. 2016.
  • [15] W. Stallings, Cryptography and Network Security: Principles and Practice, Seventh Edition, Pearson, 2017.
  • [16] X. Tan, K. Borle, W. Du, and B. Chen, “Cryptographic link signatures for spectrum usage authentication in cognitive radio, ” in Proc. the fourth ACM Conf. WiSec’11, pp. 79-90, June 2011.
  • [17] P. L. Yu, J. S. Baras and B. M. Sadler, “Multicarrier authentication at the physical layer,” in Proc. 2008 Int. Symp. a World of Wireless, Mobile and Multimedia Networks, Newport Beach, CA, 2008, pp. 1-6.
  • [18] D. Shan, K. Zeng, W. Xiang, P. Richardson and Y. Dong, “PHY-CRAM: Physical Layer Challenge-Response Authentication Mechanism for Wireless Networks,” IEEE J. Select. Areas Commun., vol. 31, no. 9, pp. 1817-1827, September 2013.
  • [19] N. Xie and S. Zhang, “Blind Authentication at the Physical Layer Under Time-Varying Fading Channels,” IEEE J. Select. Areas Commun., vol. 36, no. 7, pp. 1465-1479, July 2018.
  • [20] M. Chowdhury, A. Manolakos and A. Goldsmith, “Scaling Laws for Noncoherent Energy-Based Communications in the SIMO MAC,” IEEE Trans. Inform. Theory, vol. 62, no. 4, pp. 1980-1992, April 2016.