# Detection Performance of Packet Arrival under Downclocking for Mobile Edge Computing

Authors: Zhimin Wang; Qinglin Zhao; Fangxin Xu; Hongning Dai; Yujun Zhang
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

Mobile edge computing (MEC) enables battery-powered mobile nodes to acquire information technology services at the network edge. These nodes desire to enjoy their service under power saving. The sampling rate invariant detection (SRID) is the first downclocking WiFi technique that can achieve this objective. With SRID, a node detects one packet arrival at a downclocked rate. Upon a successful detection, the node reverts to a full-clocked rate to receive the packet immediately. To ensure that a node acquires its service immediately, the detection performance (namely, the miss-detection probability and the false-alarm probability) of SRID is of importance. This paper is the first one to theoretically study the crucial impact of SRID attributes (e.g., tolerance threshold, correlation threshold, and energy ratio threshold) on the packet detection performance. Extensive Monte Carlo experiments show that our theoretical model is very accurate. This study can help system developers set reasonable system parameters for WiFi downclocking.


---

## Body

## 1. Introduction

Mobile edge computing (MEC) [1] aims to provide computing resources and information technology services at the network edge. In MEC, various battery-powered mobile nodes (such as smartphone) will access these resources and services via MEC application servers such as LTE base station and wireless access point (AP). These battery-powered nodes desire to enjoy their service under power saving.In this paper, we assume that a number of battery-powered nodes access an AP (acting as an MEC application server) via a WiFi network. These devices adopt a novel algorithm called sampling rate invariant detection (SRID) [2] for power saving. SRID is the first downclocking mechanism (adopted in WiFi). With SRID, a node detects one packet arrival at a downclocked rate. Upon a successful detection, the node reverts to a full-clocked rate to receive the packet immediately. For each detection, there are two types of typical errors: miss-detection (i.e., the AP sends a packet but the node does not detect it) and false-alarm (i.e., the AP sends nothing but the node detects a packet mistakenly). To ensure that a node acquires its service immediately, the detection performance (namely, the miss-detection probability and the false-alarm probability) of SRID is of importance. This paper is concerned with the detection performance. Our contributions are summarized as follows:(i)
To the best of our knowledge, this paper is the first one to theoretically analyze the detection performance of WiFi downclocking. Our theoretical model characterizes the crucial impact of SRID attributes (e.g., tolerance threshold, correlation threshold, and energy ratio threshold) on the packet detection performance (i.e., the miss-detection probability and the false-alarm probability).(ii)
We run extensive Monte Carlo experiments to verify that our theoretical model is very accurate. We show that as the downclocked rate decreases, the false-alarm probability increases significantly, which will lead to a serious adverse impact on packet detection.This study can help system developers set reasonable system parameters for WiFi downclocking.So far, downclocking has received great attention [2–13]. Among the most relevant works, [2] is the first paper that brought downclocking to low-power WiFi networks and proposed the SRID algorithm, which was considered as one of the most classical amendments on power saving of 802.11 protocols [12, 13]. In WiFi, the dominant source of energy consumption is the idle listening operation [7, 8], where a node needs to frequently detect unpredictably arriving packets or assess a clear channel with high power. Therefore, SRID reduced the power consumption by allowing a WiFi node to downclock its sample rate in idle listening mode. SASD [3] was proposed to reduce the power consumption in SRID further by allowing nondestination nodes in idle listening to enter a doze state. AS-MAC [4] was proposed to avoid contention and reduce delay by asynchronously scheduling the wake-up time of neighboring nodes via a downclocking mechanism for wireless sensor networks. SloMo [5] was proposed to allow WiFi nodes to operate their radios at lower clock rates when receiving and transmitting at low bit rates. Sampleless [6] allowed energy-constrained devices to scale down their sampling rates regardless of channel conditions. The above works mainly focused on the hardware implementation of the downclocking mechanism or evaluated its performance via simulation. In contrast, this paper is the first one to model the impact of downclocking on the packet detection performance theoretically.The rest of this paper is organized as follows. Section2 gives an overview of SRID. Section 3 theoretically analyzes the detection performance of SRID. Section 4 presents Monte Carlo results that reveal the crucial impact of SRID attributes on the detection performance. Section 5 concludes this paper.


## 2. Overview of SRID

In the downclocking mechanism, one basic problem is how to detect unpredictably arriving packets at a downclocked rate, so that the node can revert to a full-clocked mode to receive the arriving packets.The SRID that adopts the downclocking mechanism is designed for WiFi networks. With the help of Figure1, we specify how SRID works. Assume a WiFi network consisting of one access point (AP) and a number of nodes. The AP is always in the active mode, while each node is in the downclocked mode by default. When the AP has a packet to transmit toward a node, the operations of the AP and the node are as follows.(i)
The AP first transmits an additional preamble calledM-preamble, and then a sequence of dummy bits, and finally a conventional 802.11 packet. Here, the M-preamble is used to notify the node of the arrival of an expected packet. The dummy bits are used to provide a guard interval that allows the node to revert to the full-clocked mode from the downclocked mode.(ii)
The node continuously detects itsM-preamble via self-correlation and then reverts to the full-clocked mode upon a successful detection.Figure 1
(a) AP’sM-preamble transmission and (b) node’s M-preamble detection in SRID.In the next two subsections, we detail the construction and the detection of anM-preamble.


### 2.1. Construction ofM-Preamble

In SRID, anM-preamble consists of C(C≥2) duplicated versions of a complex gold sequence (CGS), the length of each CGS sequence being TB+nDm. Figure 1(a) shows an example of M-preamble, where C=3. Thus the total length of M-preambleT can be expressed as(1)T=CTB+nDm,where TB represents the minimum length of the CGS (used for M-preamble). The integer nrepresents the address of the node in SRID, which is assigned by the AP. 1/Dm is the minimum downclocking factor of radio hardware. For example, assume that the full-clocked frequency is 20 MHz. Then the minimum downclocked frequency is 20∗(1/Dm) MHz.


### 2.2. Detection ofM-Preamble

In SRID, a node continuously performs self-correlation to detect itsM-preamble. Assume that a node operates with a downclocking factor of 1/D∈[1/Dm,1].Letzk denote the sampling value of the node at the sampling pointk.LetRk denote the self-correlation result of the node at the sampling point k. To detect its M-preamble, at each sampling point k, the node with address n performs the self-correlation between the latest T1 samples and the previous T1 samples (offset by δ). Therefore, Rk can be calculated by(2)Rk=∑i=kk+T1-1zizi-δ,where T1=TB/D is the size of the self-correlation window (in sampling points) and δ=(TB+nDm)/D is the number of sampling points of a CGS when the downclocking factor is 1/D. Note that T1 and δ are shown in Figure 2.Figure 2
Illustration ofC,δT1 and T2.LetEk denote the energy level at sampling point k, which can be calculated by(3)Ek=∑i=kk+T1-1zi2.We say that anM-preamble is successfully detected if the total number of successfully detected points, Ns, is greater than H1T2; namely, (4)Ns≥H1T2,H1∈0,1,where H1 is the tolerance threshold and T2=C-1δ is the total number of sampling points (from the 2nd CGS to the C-th CGS), as shown in Figure 2.We say that a sampling point is detected successfully if the following two conditions are satisfied.Condition 1.
At sampling pointk, the correlation result Rk normalized by Ek is between H and1/H; namely,(5)H<RkEk<H-1,H∈0,1,where H∈(0,1) is a predefined threshold.Condition 2.
At sampling pointk, the energy ratio (in dB) of Eak and Eak-Cδ exceeds a threshold Hs; namely,(6)10·log10EakEak-Cδ≥Hs,where Eak=T1-1E(k)+(1-T1-1)Ea(k-1) represents a moving average of energy level, with a window size equal to T1. The reason of introducing Condition 2 is to reduce the probability that Condition 1 is satisfied but no M-preambles are transmitted.


## 2.1. Construction ofM-Preamble

In SRID, anM-preamble consists of C(C≥2) duplicated versions of a complex gold sequence (CGS), the length of each CGS sequence being TB+nDm. Figure 1(a) shows an example of M-preamble, where C=3. Thus the total length of M-preambleT can be expressed as(1)T=CTB+nDm,where TB represents the minimum length of the CGS (used for M-preamble). The integer nrepresents the address of the node in SRID, which is assigned by the AP. 1/Dm is the minimum downclocking factor of radio hardware. For example, assume that the full-clocked frequency is 20 MHz. Then the minimum downclocked frequency is 20∗(1/Dm) MHz.


## 2.2. Detection ofM-Preamble

In SRID, a node continuously performs self-correlation to detect itsM-preamble. Assume that a node operates with a downclocking factor of 1/D∈[1/Dm,1].Letzk denote the sampling value of the node at the sampling pointk.LetRk denote the self-correlation result of the node at the sampling point k. To detect its M-preamble, at each sampling point k, the node with address n performs the self-correlation between the latest T1 samples and the previous T1 samples (offset by δ). Therefore, Rk can be calculated by(2)Rk=∑i=kk+T1-1zizi-δ,where T1=TB/D is the size of the self-correlation window (in sampling points) and δ=(TB+nDm)/D is the number of sampling points of a CGS when the downclocking factor is 1/D. Note that T1 and δ are shown in Figure 2.Figure 2
Illustration ofC,δT1 and T2.LetEk denote the energy level at sampling point k, which can be calculated by(3)Ek=∑i=kk+T1-1zi2.We say that anM-preamble is successfully detected if the total number of successfully detected points, Ns, is greater than H1T2; namely, (4)Ns≥H1T2,H1∈0,1,where H1 is the tolerance threshold and T2=C-1δ is the total number of sampling points (from the 2nd CGS to the C-th CGS), as shown in Figure 2.We say that a sampling point is detected successfully if the following two conditions are satisfied.Condition 1.
At sampling pointk, the correlation result Rk normalized by Ek is between H and1/H; namely,(5)H<RkEk<H-1,H∈0,1,where H∈(0,1) is a predefined threshold.Condition 2.
At sampling pointk, the energy ratio (in dB) of Eak and Eak-Cδ exceeds a threshold Hs; namely,(6)10·log10EakEak-Cδ≥Hs,where Eak=T1-1E(k)+(1-T1-1)Ea(k-1) represents a moving average of energy level, with a window size equal to T1. The reason of introducing Condition 2 is to reduce the probability that Condition 1 is satisfied but no M-preambles are transmitted.


## 3. Detection Performance Analysis

In this section, focusing on the downlink traffic from the AP to nodes, we theoretically analyze the crucial impact of SRID attributes (namely, tolerance thresholdH1, correlation threshold H, and energy ratio threshold Hs) on the detection performance.Due to the downclocked rate and the noise, each SRID detection result is associated with four mutually exclusive minievents: (a) successful detection: AP sends anM-preamble and the node detects it successfully, (b) miss-detection: AP sends an M-preamble but the node does not detect it, (c) false-alarm: AP does not send an M-preamble but the node detects it mistakenly, and (d) Null: AP does not send an M-preamble and the node detects nothing. To study the detection performance, we only need to calculate the successful detection probability Pd = Prob(successful detection) and the false-alarm probability Pfa = Prob(false-alarm), because Prob(miss-detection) = 1 − Prob(successful detection) and Prob(Null) = 1 − Prob(false-alarm).We note that each detection result is determined depending on whether the AP sends anM-preamble. Below, we introduce two competing hypotheses:(7)H0:zk=nk,k=0,1,…,CδH1:zk=hxk+nk,k=0,1,…,Cδ,where H0 is referred to as the null hypothesis (i.e., AP does not send an M-preamble to a node) and H1 as the alternative hypothesis (i.e., AP sends an M-preamble to a node). Under hypothesis H0, at the sampling point k, the node receives the noise, and therefore its sample value is zk=nk, where nk is the Gaussian white noise. Under hypothesis H1, at the sampling point k, the node receives the M-preamble signal and the noise, and therefore its sampling value is zk=hxk+nk, where xk represents the sampling value on the M-preamble and h represents the channel coefficient.


### 3.1. Expression ofPd

We now expressPd. According to (4), we have(8)Pd=PNs≥H1T2∣H1.The sampling process is a Bernoulli process, where a sampling point is marked success if Conditions 1 and 2 (specified in Section 2.2) are satisfied. Therefore, the number of successfully detected points in T2 trials, Ns, follows a binomial distribution. Thus Pd is expressed by (9)Pd=∑i=H1T2T2CT2iP1PER1i1-P1PER1T2-i,where P1 is the probability of Condition 1 being satisfied under H1 and PER1 is the probability of Condition 2 being satisfied under H1.Expression of P 1. According to (5), P1 can be written as (10)P1=PH1;H1=PH<RkEk<H-1∣H1.In (10), PHi;Hj represents the probability of deciding Hi when Hj is true. Let U1 denote the normalized correlation result at sampling point k under H1. Then U1 can be expressed as U1=∑i=kk+T1-1|(hxi+ni)(hxi-δ+ni-δ)|/∑i=kk+T1-1hxi+ni2. Thus P1 is expressed by (11)P1=PH<U1<H-1.Note thatU1 is complicated, because it is a function of 2T1 random variables (i.e., nk-δ,nk+1-δ,…,nk+T1-1-δ and nk,nk+1,…,nk+T1-1). In Section 3.3, we calculate P1 via the Monte Carlo method [14].Expression of P E R 1 .According to (6), PER1 can be written as(12)PER1=P10·log10⁡EakEak-Cδ≥Hs∣H1.UnderH1, Eak and Eak-Cδ are expressed as follows.(13)Eak=T1-1Ek+1-T1-1Eak-1=T1-1∑i=kk+T1-1hxi+ni2+1-T1-1Eak-1Eak-Cδ=T1-1Ek-Cδ+1-T1-1Eak-Cδ-1=T1-1∑i=kk+T1-1ni2+1-T1-1Eak-1.Note that Ek-Cδ=∑i=kk+T1-1ni2, because AP transmits one M-preamble (which consists of Cδ sampling points only) for each packet, and thereby the node only receives the noise before the M-preamble. Similar to P1, we can calculate PER1 via the Monte Carlo method.


### 3.2. Expression ofPfa

We now expressPfa. Similar to Pd, Pfa can be expressed as follows:(14)Pfa=PNs≥H1T2∣H0=∑i=H1T2T2CT2iP2PER2i1-P2PER2T2-i,where P2=PH1;H0=P{H<Rk/Ek<H-1∣H0} is the probability of Condition 1 being satisfied under H0 and PER2=P{10·log10⁡Eak/Eak-Cδ≥Hs∣H0} is the probability of Condition 2 being satisfied under H0.


### 3.3. Calculation ofPd and Pfavia Monte Carlo Method

In the previous two subsections, we give expressions ofPd and Pfa. However, they involve 2T1 random variables and therefore are hard to solve. Below we adopt the Monte Carlo method [14] to calculate them. Algorithm 1 lists the computation process in terms of Pd, which is given by (9). Similarly, we can calculate Pfa.Algorithm 1:Calculation of Pd based on the Monte Carlo method.
//Input:SNR,C,TB,nDm,H1,H,Hs,h,D,T,T2 //Output:Pd //We run the code below for 100000 times. ( 1 ) i⟵0 ( 2 ) while (i<100000) ( 3 )     Generate a CGS randomly ( 4 )     x(0,1,…,T)⟵ [CGS, CGS,…,CGS]1×C ( 5 )     y(0,1,…,T)←awgn(x(1,…,T),SNR, “measured”) ( 6 )     z0,1,…,Cδ← Sample y every D points ( 7 )     Calculate R0,1,…,Cδ and E0,1,…,Cδ ( 8 )     N1← the total number of sampling points that satisfy Condition 1. ( 9 )     P1i⟵N1Cδ ( 10 )  N2← the total number of sampling points that satisfy Condition 2. ( 11 )  PER1(i)⟵N2Cδ ( 12 )  i⟵i+1 ( 13 ) end //We first calculateavg(P1) and avg(PER1), then Pd. ( 14 ) Pd⟵∑i=H1T2T2CT2i[avg(P1)avg(PER1)]i1-avg(P1)avg(PER1)T2-iIn Algorithm1, we input the SRID parameters and output the value of Pd. In the algorithm, we run Monte Carlo experiment for 100000 times. We now detail each experiment.(i)
In lines(3) to (4), we generate an M-preamble of T samples points, which simulates the AP’s M-preamble transmission.(ii)
In line(5), we invoke the Matlab function, awgn(·), to simulate the additive white Gaussian noise (AWGN) channel and then the node’s received signal is the result that the AP’s M-preamble signal passes through the AWGN channel.(iii)
In line(6), we obtain the downclocked sampling sequence z(·) under the downclocking factor of 1/D.(iv)
In line(7), we calculate self-correlation result R(·) and the energy level E(·).(v)
In lines(8) to (9), we calculate P1 in this experiment.(vi)
In lines(10) to (11), we calculate PER1 in this experiment.Finally, after we finish 100000 runs, we first calculate the average ofP1, avg(P1), and the average of PER1, avg(PER1), and then calculate Pd, as shown in line (14).


## 3.1. Expression ofPd

We now expressPd. According to (4), we have(8)Pd=PNs≥H1T2∣H1.The sampling process is a Bernoulli process, where a sampling point is marked success if Conditions 1 and 2 (specified in Section 2.2) are satisfied. Therefore, the number of successfully detected points in T2 trials, Ns, follows a binomial distribution. Thus Pd is expressed by (9)Pd=∑i=H1T2T2CT2iP1PER1i1-P1PER1T2-i,where P1 is the probability of Condition 1 being satisfied under H1 and PER1 is the probability of Condition 2 being satisfied under H1.Expression of P 1. According to (5), P1 can be written as (10)P1=PH1;H1=PH<RkEk<H-1∣H1.In (10), PHi;Hj represents the probability of deciding Hi when Hj is true. Let U1 denote the normalized correlation result at sampling point k under H1. Then U1 can be expressed as U1=∑i=kk+T1-1|(hxi+ni)(hxi-δ+ni-δ)|/∑i=kk+T1-1hxi+ni2. Thus P1 is expressed by (11)P1=PH<U1<H-1.Note thatU1 is complicated, because it is a function of 2T1 random variables (i.e., nk-δ,nk+1-δ,…,nk+T1-1-δ and nk,nk+1,…,nk+T1-1). In Section 3.3, we calculate P1 via the Monte Carlo method [14].Expression of P E R 1 .According to (6), PER1 can be written as(12)PER1=P10·log10⁡EakEak-Cδ≥Hs∣H1.UnderH1, Eak and Eak-Cδ are expressed as follows.(13)Eak=T1-1Ek+1-T1-1Eak-1=T1-1∑i=kk+T1-1hxi+ni2+1-T1-1Eak-1Eak-Cδ=T1-1Ek-Cδ+1-T1-1Eak-Cδ-1=T1-1∑i=kk+T1-1ni2+1-T1-1Eak-1.Note that Ek-Cδ=∑i=kk+T1-1ni2, because AP transmits one M-preamble (which consists of Cδ sampling points only) for each packet, and thereby the node only receives the noise before the M-preamble. Similar to P1, we can calculate PER1 via the Monte Carlo method.


## 3.2. Expression ofPfa

We now expressPfa. Similar to Pd, Pfa can be expressed as follows:(14)Pfa=PNs≥H1T2∣H0=∑i=H1T2T2CT2iP2PER2i1-P2PER2T2-i,where P2=PH1;H0=P{H<Rk/Ek<H-1∣H0} is the probability of Condition 1 being satisfied under H0 and PER2=P{10·log10⁡Eak/Eak-Cδ≥Hs∣H0} is the probability of Condition 2 being satisfied under H0.


## 3.3. Calculation ofPd and Pfavia Monte Carlo Method

In the previous two subsections, we give expressions ofPd and Pfa. However, they involve 2T1 random variables and therefore are hard to solve. Below we adopt the Monte Carlo method [14] to calculate them. Algorithm 1 lists the computation process in terms of Pd, which is given by (9). Similarly, we can calculate Pfa.Algorithm 1:Calculation of Pd based on the Monte Carlo method.
//Input:SNR,C,TB,nDm,H1,H,Hs,h,D,T,T2 //Output:Pd //We run the code below for 100000 times. ( 1 ) i⟵0 ( 2 ) while (i<100000) ( 3 )     Generate a CGS randomly ( 4 )     x(0,1,…,T)⟵ [CGS, CGS,…,CGS]1×C ( 5 )     y(0,1,…,T)←awgn(x(1,…,T),SNR, “measured”) ( 6 )     z0,1,…,Cδ← Sample y every D points ( 7 )     Calculate R0,1,…,Cδ and E0,1,…,Cδ ( 8 )     N1← the total number of sampling points that satisfy Condition 1. ( 9 )     P1i⟵N1Cδ ( 10 )  N2← the total number of sampling points that satisfy Condition 2. ( 11 )  PER1(i)⟵N2Cδ ( 12 )  i⟵i+1 ( 13 ) end //We first calculateavg(P1) and avg(PER1), then Pd. ( 14 ) Pd⟵∑i=H1T2T2CT2i[avg(P1)avg(PER1)]i1-avg(P1)avg(PER1)T2-iIn Algorithm1, we input the SRID parameters and output the value of Pd. In the algorithm, we run Monte Carlo experiment for 100000 times. We now detail each experiment.(i)
In lines(3) to (4), we generate an M-preamble of T samples points, which simulates the AP’s M-preamble transmission.(ii)
In line(5), we invoke the Matlab function, awgn(·), to simulate the additive white Gaussian noise (AWGN) channel and then the node’s received signal is the result that the AP’s M-preamble signal passes through the AWGN channel.(iii)
In line(6), we obtain the downclocked sampling sequence z(·) under the downclocking factor of 1/D.(iv)
In line(7), we calculate self-correlation result R(·) and the energy level E(·).(v)
In lines(8) to (9), we calculate P1 in this experiment.(vi)
In lines(10) to (11), we calculate PER1 in this experiment.Finally, after we finish 100000 runs, we first calculate the average ofP1, avg(P1), and the average of PER1, avg(PER1), and then calculate Pd, as shown in line (14).


## 4. Model Verification

In this section, we present the Monte Carlo results to illustrate the crucial impact of SRID attributes and SNR on the detection performance (namely, the successful detection probabilityPd and the false-alarm probability Pfa). The default parameter settings are set by [2] and are shown in Table 1. In Figures 3 and 4, each Monte Carlo result is on average over 100000 runs. In addition, we use “SRID(1/D)” to denote the SRID detection with the downclocking factor of 1/D. In all figures, the labels “ana” and “sim”, respectively, denote the theoretical and simulation results.Table 1
Parameter settings in simulation.
Parameters Description Values C Number of CGS 3 T B Basic length 64 sampling points n D m Additional length 64 sampling points H 1 Tolerance threshold 0.6 H Correlation threshold 0.9 H s Energy ratio threshold 4 dB SNR Signal-to-noise ratio 9 dB h Channel coefficient 1Figure 3
(a)Pd and (b) Pfa vary when the SNR varies.
(a) (b)Figure 4
(a)Pd and (b) Pfa vary when H1 varies.
(a) (b)Figures3(a) and 3(b), respectively, plot Pd and Pfa as the SNR varies, when 1/D=1/2,1/4,1/8,1/16. From Figure 3, we have the following observations.(i)
Given1/D, Pd increases and Pfa decreases gradually as the SNR increases.(ii)
Given SNR, as1/D decreases, Pd decreases slightly while Pfa increases significantly. For example, for SNR = 5 dB, when 1/D decreases from 1/2 to 1/16, Pfa grows from 0.0098 to 0.0301 significantly, while Pd just drops from 0.9997 to 0.9754 slightly. This will lead to a serious adverse impact on packet detection.(iii)
The detection performance is almost perfect (i.e.,Pd=1 and Pfa=0) when SNR = 10 dB, which is easy to achieve in real environments [15].Figures4(a) and 4(b), respectively, plot Pd and Pfa as H1 varies, when 1/D=1/2,1/4,1/8,1/16. From Figure 4, we have the following observations.(i)
Given1/D, as H1 increases, Pd always decreases, but Pfa first decreases to 0 and then remains unchanged. The reason is as follows: increasing H1 will decrease the successful detection probability from (9) as well as the false-alarm probability from (14).(ii)
GiveH1, as 1/D decreases, Pd decreases significantly, while Pfa decreases gradually.Finally, from these figures, the close match between the theoretical and simulation curves manifests that our performance model is very accurate.


## 5. Conclusion

In mobile edge computing, various battery-powered mobile nodes desire to acquire information technology services at the network edge under power saving. WiFi downclocking is such a promising technique. In this paper, we investigate a novel WiFi downclocking technique called SRID and first theoretically study the impact of SRID attributes (namely, tolerance threshold, correlation threshold, and energy ratio threshold) on the detection performance of packet arrival. This study is helpful in designing better WiFi downclocking protocols.



---

*Source: 9641712-2018-02-28.xml*