# Energy Efficient Downlink Transmission in Wireless LANs by Using Low-Power Wake-Up Radio

Authors: Suhua Tang; Sadao Obana
Journal: Wireless Communications and Mobile Computing
 (2017)

---

## Abstract

In the downlink of a wireless LAN, power-save mode is a typical method to reduce power consumption. However, it usually causes large delay. Recently, remote wake-up control via a low-power wake-up radio (WuR) has been introduced to activate a node to instantly receive packets from an access point (AP). But link quality is not taken into account and protocol overhead of wake-up per node is relatively large. To solve these problems, in this paper, a broadcast-based wake-up control framework is proposed, and a low-power WuR is used to receive traffic indication map from an AP, monitor link quality, and perform carrier sense. Among the nodes which have packets buffered at the AP, only those whose SNR is above a threshold will be activated, contending via a proper contention window to receive packets from the AP. Optimal SNR threshold, deduced by theoretical analysis, helps to reduce transmission collisions and false wake-ups (caused by wake-up latency) and improve transmission rate. Extensive simulations confirm that the proposed method (i) effectively reduces power consumption of nodes compared with other methods, (ii) has less delay than power-save mode in times of light traffic, and (iii) achieves higher throughput than other methods in the saturation state.


---

## Body

## 1. Introduction

Wireless local area network (WLAN) [1] is playing a more and more important role in offloading the ever-increasing mobile traffic from cellular networks. Downlink traffic is the majority in WLANs, and its transmission usually faces two problems. (i) First one is the energy waste due to idle waiting. Because the arrival timing of a packet is not known in advance, the WLAN module of each node has to stay awake so as to receive any packet instantly. This constant awake mode leads to much energy waste. Power-save mode [1] (and adaptive PSM [2]) is a typical method to reduce power consumption. In this method, WLAN modules of nodes periodically wake up to receive from the AP (Access Point) beacons with traffic indication, and if any packets have arrived, they stay awake to receive those packets. However, in this duty-cycling mode [3], saving more power requires a longer period, which usually leads to larger delay. (ii) Second one is the low transmission rate or even packet loss due to multipath fading. This is because an AP has no channel state information (CSI) about its nodes.As for (i), there has been much research on remote wake-up control [4, 5]. The basic idea is to equip each node with a low-power wake-up radio (WuR), which is always active to accept wake-up request [6–8]. Then, power-hungry parts of a node are put into sleep and remotely activated on demand. This was first studied for sensor networks [9–11]. Because there is little traffic in sensor networks, most existing work adopted a loose integration of the WuR and the sensor module.Recently, the idea of wake-up control is also applied to WLAN. In the simple downlink wake-up control [12], an AP transmits a wake-up message (WuM) to a specific node. A WuR receiving a WuM matching its own address activates its colocated WLAN module on demand. However, this unicast wake-up per node generates much overhead, and transmissions may be conducted at a low rate or even packet loss occurs in the presence of multipath fading.As for (ii), many efforts have been devoted to applying multiuser scheduling to improve transmission rate, and there is still active research in this field [13, 14]. In the multiple access uplink, many nodes contend to access the shared channel to transmit to the AP. The performance depends on two important factors: (i) collision probability and (ii) transmission rate. Because each node experiences fading independently, by limiting the contention to nodes with high link quality, average transmission rate can be improved and collision probability can be reduced. There have been some methods suggested for slotted ALOHA [15, 16] and CSMA networks [17]. This is also applied to the downlink transmission by letting each node contend to initiate the receiving from the AP, based on their link quality [18]. But a WLAN module is kept awake to monitor the channel continuously to obtain fresh CSI, which leads to much energy waste.Compared with previous works that separately solve the above issues, in this work, we try to jointly solve these issues, applying multiuser scheduling to improve transmission rate, meanwhile reducing both the protocol overhead of wake-up control and the energy overhead of monitoring the channel, all by using the low-power WuR. To this end, we propose a new framework, broadcast-based wake-up control. In this framework, an AP periodically broadcasts by its WLAN module a WuM carrying a traffic indication map (TIM) [1], which is modulated by OOK (On-Off-Keying) on the envelope of an OFDM signal [19]. This WuM is received by envelope detection at a low-power WuR equipped at each node. A WuR is used to monitor link quality, performs carrier sense, and activates its colocated WLAN module via the distributed contention.The broadcast-based wake-up control brings new issues. When more than two nodes contend, there will be transmission collisions and false wake-ups. A WLAN module cannot transmit immediately after it receives wake-up instruction from its WuR in the presence of the wake-up latency. During the wake-up period of a node, other WuRs sense the channel as idle and falsely activate their WLAN modules, which lead to false wake-up [20] and power waste. The false wake-up problem occurs because the initial values of backoff counters of two or more WuRs have a difference less than the length of the wake-up period. This problem is addressed in [20] by adjusting the contention window, which uses larger contention window at the cost of more idle slots. In this work, this issue is solved by setting the SNR (signal to noise ratio) threshold and applying the distributed scheduling of wake-up control and transmission. This reduces transmission collisions as well.Main contributions of this paper are threefold as follows:(1)
A new framework of broadcast-based wake-up control enables distributed wake-up scheduling.(2)
Broadcast-based wake-up control reduces protocol overhead and improves channel efficiency compared with wake-up per node.(3)
The three problems, multipath fading, transmission collisions, and false wake-ups, are solved simultaneously, by setting a proper SNR threshold.Optimal SNR threshold is deduced by theoretical analysis. Extensive simulations verify that the proposed method (i) effectively reduces power consumption of nodes compared with the other methods, (ii) has less delay than power-save mode in times of light traffic, and (iii) achieves higher throughput than the other methods in the saturation state.The rest of this paper is organized as follows: Section2 presents the proposed framework, Section 3 gives the optimal parameter by theoretical analysis, Section 4 shows the results of simulation evaluation, and finally Section 5 concludes this paper.


## 2. Proposed Method

The framework of the proposed method is shown in Figure1. In this framework, a low-power WuR is added to each node for activating its colocated WLAN module. To suppress power consumption, a WuR instead of a power-hungry WLAN module is used to monitor the channel and perform carrier sense. To this end, a WuR shares the same channel with WLAN modules and a WuM is transmitted from the WLAN module of an AP to a WuR.Figure 1
Framework for remote wake-up control of a mobile node. An AP transmits a wake-up message with a traffic indication map by applying the OOK modulation on the envelope of an OFDM signal. A node is equipped with a low-power WuR, which conducts envelope detection to receive a wake-up message, detects SNR, and performs carrier sense.


### 2.1. Wake-Up Model

Different methods can be used to convey a WuM from a WLAN module (of an AP) to a non-WLAN WuR as follows. (i) Frame length of WLAN signals can be modulated to deliver wake-up message from a WLAN module (transmitter) to a WuR [21–23]. (ii) A WLAN module, at a low clock rate, can work as a WuR to detect a WuM embedded in the preamble of a WLAN signal [24]. (iii) OOK modulation can be emulated to transmit a WuM by modulating the envelope of an OFDM signal [19]. In this work, we adopt (iii) because a WuR with envelope detection can work with low-power consumption, and OOK modulation is more efficient than frame length modulation.A WuM carried in the envelope of a WLAN signal is detected by a WuR using envelope detection. It should be noted that emulating the OOK modulation has its own cost. For example, at the rate of 100 kbps, transmitting a WuM with 40 bits will require 0.4 ms, which causes much overhead for wake-up per node. To reduce protocol overhead, a broadcast wake-up policy is adopted in this work, instead of letting an AP separately activate each node to receive packets. To this end, each WuM carries a TIM, which simultaneously notifies packet availability to multiple nodes. Then, it is nodes, instead of the AP, that contend to initiate the data receiving [25] by transmitting a CTS (clear to send) frame to the AP. This CTS tells the AP that the transmitting node has changed from the sleep mode to the active mode.Each WuM initiates the transmission of all packets indicated by a WuM. The frame control field in each data frame carries a More Data flag [1], by which the AP notifies a node whether any data remain for that node to receive (to ensure fair scheduling, an AP can clear the More Data flag to a node when the allocated time for that node has run out, although actually there are still packets waiting for transmission to that node). A node without any more data will go to sleep, after notifying the AP.A WuM has the same preamble as a WLAN signal. Therefore, a WuR can estimate SNR/RSSI of a WuM and on this basis performs carrier sense, contending to activate its colocated WLAN module. If multiple nodes wake up simultaneously, their contention may cause collisions. To reduce collisions, only WuRs with high SNR above the threshold and packets ready will participate in this contention. Due to the wake-up latency, the channel is continuously idle in the wake-up period of a node that has just won the channel contention. As a result, other WuRs sense the channel as idle and may falsely activate their colocated WLAN modules [20]. Setting a SNR threshold helps to reduce false wake-up as well. It is desired that by proper control exactly one node with high SNR is activated so as to avoid false wake-up and collision and improve transmission rate.Here, normalized SNR [18] instead of absolute SNR is used, and it is defined as the ratio of instantaneous SNR of a node to its average. Using normalized SNR helps to ensure proportional fair scheduling among nodes with different link qualities in a long term. But using a fixed SNR threshold may prevent a node in deep fading from accessing the channel in a short term. To alleviate this problem, the SNR threshold is adapted to the number of contending nodes.The number of contending nodes with packets ready to be received changes with time, so does the SNR threshold. The AP continues transmitting all packets to the same node in a burst mode, where frames are spaced by SIFS (Short Interframe Space). The switch between nodes is indicated by a space of DIFS (DCF Interframe Space, longer than SIFS). By checking this DIFS, the number of contending nodes can be updated. Later, in Section3, optimal SNR threshold is obtained from the latest number of contending nodes. In this way, the SNR threshold decreases with the number of contending nodes, which helps to alleviate the short-term fairness problem.As link quality changes dynamically, the backoff counter is not resumed after each contention, but initialized per contention round using a fixed contention window (CW).


### 2.2. Main Procedure

The main procedure of the proposed method is described as follows:(1)
An AP periodically broadcasts a WuM by applying OOK modulation on the envelope of WLAN signals, carrying a TIM indicating the availability of packets.(2)
A WuR measures RSSI/SNR on receiving a WuM, gets TIM from this WuM, and finds the number of contending nodes. Then, based on the number of contending nodes, each WuR determines its SNR threshold (based on a table).(3)
If there is a packet ready and its normalized SNR is greater than the threshold, a WuR initiates its backoff counter by a random value drawn from a CW and decreases its backoff counter per idle slot. A WuR immediately wakes up its WLAN module when its backoff counter reaches 0.(4)
An activated WLAN module performs carrier sense again. If the channel remains idle, a WLAN module transmits a CTS to initiate its receiving from the AP. Otherwise, the channel is already busy, and this is a false wake-up, and the WLAN module goes to sleep again.(5)
On receiving a CTS frame from a node, the AP transmits all packets to the node in a burst, with a SIFS between adjacent frames, and notifies the end of this burst by clearing the More Data flag.(6)
When the transmission to a node finishes, there will be a space of DIFS, after which other nodes will contend to initiate their receiving from the AP. A space of DIFS or longer indicates the decrease by 1 in the number of contending nodes, and the SNR threshold is updated. Then, the procedures from step(3) are repeated.Occasionally, SNR of all remaining nodes (that have not received their packets yet) happen to be below the specified threshold. After DIFS, no nodes transmit and the channel remains idle, until the AP rebroadcasts a new WuM, which recovers the contention among the nodes.A collision occurs when multiple nodes simultaneously transmit CTS. In this case, the AP, failing to receive an expected CTS, transmits a new WuM to resynchronize all the nodes.A simple example is shown in Figure2, where a WLAN consists of an AP and 3 nodes. At first the AP sends a WuM, indicating that there are packets ready for A, B, and C. In the first contention round, normalized SNR of B and C is above the threshold, and WuRs B and C start to compete for the channel. WuR B happens to initiate its backoff counter with a small value of 3 and wins the contention. Its WLAN module is activated to send a CTS frame to initiate the receiving of PB1 and PB2 from the AP. Meanwhile, in the wake-up period (with a length of TWU) of B, the channel is idle, and WuR C decreases its backoff counter. It happens that WLAN module of C is also activated, which is a false wake-up. To reduce power consumption, a falsely activated node is put into the sleep mode again, and the probability of false wake-up will be controlled by adjusting the SNR threshold. A DIFS space indicates that the previous node (B) has finished its receiving, and the number of nodes is reduced by one. Then, channel access is repeated, based on the latest SNR threshold corresponding to the number of remaining nodes that have not received their packets yet.Figure 2
Wake-up control for the downlink transmission scheduling in a WLAN with an AP and 3 nodes. The AP broadcasts a WuM, which carries a TIM. The WuR of each node, on receiving a TIM and detecting its normalized SNR above the threshold, performs carrier sense, contending to activate its WLAN module. An activated WLAN module initiates the receiving from the AP. Packets to the same nodes are spaced by SIFS, and packets to different nodes are spaced by DIFS and random backoff (TWU=5 slots).


## 2.1. Wake-Up Model

Different methods can be used to convey a WuM from a WLAN module (of an AP) to a non-WLAN WuR as follows. (i) Frame length of WLAN signals can be modulated to deliver wake-up message from a WLAN module (transmitter) to a WuR [21–23]. (ii) A WLAN module, at a low clock rate, can work as a WuR to detect a WuM embedded in the preamble of a WLAN signal [24]. (iii) OOK modulation can be emulated to transmit a WuM by modulating the envelope of an OFDM signal [19]. In this work, we adopt (iii) because a WuR with envelope detection can work with low-power consumption, and OOK modulation is more efficient than frame length modulation.A WuM carried in the envelope of a WLAN signal is detected by a WuR using envelope detection. It should be noted that emulating the OOK modulation has its own cost. For example, at the rate of 100 kbps, transmitting a WuM with 40 bits will require 0.4 ms, which causes much overhead for wake-up per node. To reduce protocol overhead, a broadcast wake-up policy is adopted in this work, instead of letting an AP separately activate each node to receive packets. To this end, each WuM carries a TIM, which simultaneously notifies packet availability to multiple nodes. Then, it is nodes, instead of the AP, that contend to initiate the data receiving [25] by transmitting a CTS (clear to send) frame to the AP. This CTS tells the AP that the transmitting node has changed from the sleep mode to the active mode.Each WuM initiates the transmission of all packets indicated by a WuM. The frame control field in each data frame carries a More Data flag [1], by which the AP notifies a node whether any data remain for that node to receive (to ensure fair scheduling, an AP can clear the More Data flag to a node when the allocated time for that node has run out, although actually there are still packets waiting for transmission to that node). A node without any more data will go to sleep, after notifying the AP.A WuM has the same preamble as a WLAN signal. Therefore, a WuR can estimate SNR/RSSI of a WuM and on this basis performs carrier sense, contending to activate its colocated WLAN module. If multiple nodes wake up simultaneously, their contention may cause collisions. To reduce collisions, only WuRs with high SNR above the threshold and packets ready will participate in this contention. Due to the wake-up latency, the channel is continuously idle in the wake-up period of a node that has just won the channel contention. As a result, other WuRs sense the channel as idle and may falsely activate their colocated WLAN modules [20]. Setting a SNR threshold helps to reduce false wake-up as well. It is desired that by proper control exactly one node with high SNR is activated so as to avoid false wake-up and collision and improve transmission rate.Here, normalized SNR [18] instead of absolute SNR is used, and it is defined as the ratio of instantaneous SNR of a node to its average. Using normalized SNR helps to ensure proportional fair scheduling among nodes with different link qualities in a long term. But using a fixed SNR threshold may prevent a node in deep fading from accessing the channel in a short term. To alleviate this problem, the SNR threshold is adapted to the number of contending nodes.The number of contending nodes with packets ready to be received changes with time, so does the SNR threshold. The AP continues transmitting all packets to the same node in a burst mode, where frames are spaced by SIFS (Short Interframe Space). The switch between nodes is indicated by a space of DIFS (DCF Interframe Space, longer than SIFS). By checking this DIFS, the number of contending nodes can be updated. Later, in Section3, optimal SNR threshold is obtained from the latest number of contending nodes. In this way, the SNR threshold decreases with the number of contending nodes, which helps to alleviate the short-term fairness problem.As link quality changes dynamically, the backoff counter is not resumed after each contention, but initialized per contention round using a fixed contention window (CW).


## 2.2. Main Procedure

The main procedure of the proposed method is described as follows:(1)
An AP periodically broadcasts a WuM by applying OOK modulation on the envelope of WLAN signals, carrying a TIM indicating the availability of packets.(2)
A WuR measures RSSI/SNR on receiving a WuM, gets TIM from this WuM, and finds the number of contending nodes. Then, based on the number of contending nodes, each WuR determines its SNR threshold (based on a table).(3)
If there is a packet ready and its normalized SNR is greater than the threshold, a WuR initiates its backoff counter by a random value drawn from a CW and decreases its backoff counter per idle slot. A WuR immediately wakes up its WLAN module when its backoff counter reaches 0.(4)
An activated WLAN module performs carrier sense again. If the channel remains idle, a WLAN module transmits a CTS to initiate its receiving from the AP. Otherwise, the channel is already busy, and this is a false wake-up, and the WLAN module goes to sleep again.(5)
On receiving a CTS frame from a node, the AP transmits all packets to the node in a burst, with a SIFS between adjacent frames, and notifies the end of this burst by clearing the More Data flag.(6)
When the transmission to a node finishes, there will be a space of DIFS, after which other nodes will contend to initiate their receiving from the AP. A space of DIFS or longer indicates the decrease by 1 in the number of contending nodes, and the SNR threshold is updated. Then, the procedures from step(3) are repeated.Occasionally, SNR of all remaining nodes (that have not received their packets yet) happen to be below the specified threshold. After DIFS, no nodes transmit and the channel remains idle, until the AP rebroadcasts a new WuM, which recovers the contention among the nodes.A collision occurs when multiple nodes simultaneously transmit CTS. In this case, the AP, failing to receive an expected CTS, transmits a new WuM to resynchronize all the nodes.A simple example is shown in Figure2, where a WLAN consists of an AP and 3 nodes. At first the AP sends a WuM, indicating that there are packets ready for A, B, and C. In the first contention round, normalized SNR of B and C is above the threshold, and WuRs B and C start to compete for the channel. WuR B happens to initiate its backoff counter with a small value of 3 and wins the contention. Its WLAN module is activated to send a CTS frame to initiate the receiving of PB1 and PB2 from the AP. Meanwhile, in the wake-up period (with a length of TWU) of B, the channel is idle, and WuR C decreases its backoff counter. It happens that WLAN module of C is also activated, which is a false wake-up. To reduce power consumption, a falsely activated node is put into the sleep mode again, and the probability of false wake-up will be controlled by adjusting the SNR threshold. A DIFS space indicates that the previous node (B) has finished its receiving, and the number of nodes is reduced by one. Then, channel access is repeated, based on the latest SNR threshold corresponding to the number of remaining nodes that have not received their packets yet.Figure 2
Wake-up control for the downlink transmission scheduling in a WLAN with an AP and 3 nodes. The AP broadcasts a WuM, which carries a TIM. The WuR of each node, on receiving a TIM and detecting its normalized SNR above the threshold, performs carrier sense, contending to activate its WLAN module. An activated WLAN module initiates the receiving from the AP. Packets to the same nodes are spaced by SIFS, and packets to different nodes are spaced by DIFS and random backoff (TWU=5 slots).


## 3. Performance Analysis

Here, we analyze the performance of the proposed method to deduce the optimal parameter. In the analysis, we use the following notations:N is the CW value, γ is normalized SNR with a PDF (probability density function) f(γ) and a CDF (cumulative distribution function) F(γ), and γ0 is SNR threshold. In the case of Rayleigh fading, if instantaneous absolute SNR of a node (i=1,2,…,M) is γi′ and its average value is γ-i′, itsnormalized SNR, γi, is defined as γi=γi′/γ-i′, and f(γ)=exp⁡(-γ) and F(γ)=1-exp⁡(-γ) are the same for all nodes.The length of wake-up period,TWU, varies with devices and mainly depends on the performance of high frequency oscillator. According to [24], it takes 139 μs to switch from 1/4 clock rate to full clock rate and takes about 200 μs to generate a stable carrier frequency within 50 kHz of the desired value in MAX7032 (https://www.maximintegrated.com/en/products/comms/wireless-rf/MAX7032.html/). In the analysis, the wake-up latency is assumed to be TWU=200μs, approximately NWU=22 slots with TS=9μs. Table 1 lists the main notations.Table 1
Main notations for the analysis.
t
D
I
F
S
Time length of a DIFS
t
S
I
F
S
Time length of an SIFS
t
E
I
F
S
Time length of an EIFS
t
W
u
M
Time length of a wake-up message
t
C
T
S
Time length of a CTS frame
t
D
a
t
a
Time length of a DATA frame
t
A
C
K
Time length of an ACK frame
E
T
Power consumption at transmission state (1 watt)
E
R
Power consumption at receiving state (1 watt)
E
I
Power consumption at idle state (1 watt)
E
W
R
Power consumption of WuR (1 mill-watt)
T
S
Time length of a contention slot
N
Amount of slots in a contention window
N
W
U
Amount of slots corresponding to wake-up period
N
S
L
Amount of slots corresponding to sleep period
m
Number of nodes participating in the contention
M
Number of nodes with packets ready
C
m
M
Number of combinations choosingm out of M elements


### 3.1. Basic Analysis of Slotted Contention

Among all nodes, there areM nodes with packets ready (M changes with time). Out of these M nodes, with a probability(1)Pm∣γ0=CmM·Fγ0M-m·1-Fγ0m,the normalized SNR of m nodes is above the threshold γ0.Consider thejth slot of the contention window, where multiple WLAN modules may be simultaneously activated because their backoff counters are first decreased to 0 at that slot. It should be noted that any WuR, whose backoff counter reaches 0 in the NWU slots immediately after the jth slot, also falsely activates its WLAN module, because no node transmits in this wake-up period. Falsely activated nodes are put into sleep again.There are three possible cases after each channel contention.(i) All nodes have a normalized SNR belowγ0 and no node transmits at all (Figure 3(b), denoted as E), which has a probability (2)PE∣γ0=P0∣γ0,and the channel is idle for a time (3)tE∣N=tWuM+tDIFS+N·TS+tDIFS,tE∣γ0,N=tE∣N·PE∣γ0.Then, the AP rebroadcasts a WuM to start the next contention period.Figure 3
Different cases of a transmission. (a) A contention window withN slots. (b) No node transmits, and the channel remains idle during the whole contention window. (c) Exactly one node transmits without a collision. (d) A collision occurs because multiple nodes simultaneously transmit.(ii) One node transmits without any collision (Figure3(c), denoted as S). This happens if exactly one node chooses the least timer value j, which has a probability (4)PS∣j,m,N=1N,1≤j≤N,m=1,C1m·N-jm-1Nm,1≤j≤N-1,m≥2,and the overall success probability is(5)PS∣γ0,N=∑m=1M∑j=1NPS∣j,m,NPm∣γ0.Each successful transmission consumes the time (6)tS∣j,m,N=tWuM+tDIFS+j·TS+TWU+tCTS+tSIFS+tData+tSIFS+tACK+tDIFS,and its average is equal to(7)tS∣γ0,N=∑m=1M∑j=1NtS∣j,m,NPS∣j,m,NPm∣γ0.And the number of successful transmissions per contention round is equal to(8)LS∣γ0,N=1·PS∣γ0,N1-PE∣γ0.Of the otherm-1 nodes whose backoff counters reach 0 in the remaining N-j slots, the ones that reach 0 in the subsequent NWU slots will experience false wake-up. This is equivalent to a binomial distribution [26] with p=NWU/N-j in the m-1 trials. Therefore, the average number of nodes that will experience false wake-ups is equal to(9)LFS∣j,m,N=m-1NWUN-j,1≤j≤N-NWU,m≥2,m-1,N-NWU<j≤N-1,m≥2.The number of false wake-ups under a successful transmission is equal to(10)LFS∣γ0,N=∑m=1MLFS∣m,NPm∣γ01-PE∣γ0,LFS∣m,N=∑j=1NPS∣j,m,N·LFS∣j,m,N.(iii) Two or more nodes transmit simultaneously, which leads to a collision (Figure3(d), denoted as C). A collision happens when k≥2 nodes choose the same least timer value j, which has a probability (11)PC∣k,j,m,N=Ckm·N-jm-kNm,1≤j≤N-1,m≥2,1Nm,k=m,j=N,m≥2.A collision leads to the channel waste for a time(12)tC∣k,j,m,N=tWuM+tDIFS+j·TS+TWU+tCTS+tEIFS,and its average is equal to(13)tC∣γ0,N=∑m=2M∑j=1N∑k=2mtC∣k,j,m,NPC∣k,j,m,NPm∣γ0.The number of nodes simultaneously transmitting in a collision is equal to(14)LC∣k,j,m,N=k,1≤j≤N-1,m≥2,m,j=N,m≥2,and its average is equal to(15)LC∣γ0,N=∑m=2MLC∣m,NPm∣γ01-PE∣γ0,LC∣m,N=∑j=1N∑k=2mPC∣k,j,m,N·LC∣k,j,m,N.Of the otherm-k nodes whose backoff counters reach 0 in the remaining N-j slots, the ones that reach 0 in the subsequent NWU slots will experience false wake-up. This is equivalent to a binomial distribution with p=NWU/N-j in the m-k trials. Therefore, the average number of nodes that will experience false wake-ups is equal to(16)LFC∣k,j,m,N=m-k·NWUN-j,1≤j≤N-NWU,m≥2,m-k,N-NWU<j<N,m≥2.The average number of false wake-ups under a collision is equal to(17)LFC∣γ0,N=∑m=2MLFC∣m,NPm∣γ01-PE∣γ0,LFC∣m,N=∑j=1N∑k=2mPC∣k,j,m,N·LFC∣k,j,m,N.


### 3.2. Optimal Parameter

The average time for each round is the weighted sum of three parts (idle waiting, successful transmission, and collision) as follows:(18)tγ0,N=tE∣γ0,N+tS∣γ0,N+tC∣γ0,N.The average transmission rate is an average over all nodes. The transmission rate (ri for the ith node) is estimated from the absolute SNR (γ·γ¯i′), based on the Shannon capacity, and the operator E(·) represents the computation of expectation. (19)Er∣γ≥γ0=1M∑i=1MEri∣γi≥γ0,Eri∣γi≥γ0=∫γ0∞log21+γ·γ¯i′·fγiγdγ∫γ0∞fγiγdγ.The average energy per round ε(γ0,N) is a sum of three parts: εS(γ0,N) for successful transmission, εC(γ0,N) for collisions, and εF(γ0,N) for false wake-ups as follows:(20)εγ0,N=εSγ0,N+εCγ0,N+εFγ0,N,εSγ0,N=TWU+TSL+2·tSIFS·EI·LS∣γ0,N+tCTS+tACK·ET+tData·ER·LS∣γ0,N,εCγ0,N=TWU+TSL+tEIFS·EI+tCTS·ET·LC∣γ0,N,εFγ0,N=TWU+TSL·EI·LFS∣γ0,N+LFC∣γ0,N,where εS(γ0,N) is computed from L(S∣γ0,N), the average number of successful transmissions, εC(γ0,N) is computed from L(C∣γ0,N), the average number of nodes involved in a collision, and εF(γ0,N) is computed from LF(S∣γ0,N)+LF(C∣γ0,N), the average number of nodes experiencing false wake-up.First, energy efficiency, defined as the ratio of the number of overall bits to the product of average transmission time and average energy, is considered as follows:(21)η′γ0,N=Er∣γ≥γ0·tData·PS∣γ0,Ntγ0,N·εγ0,N.Figure 4(a) shows the result, which plots energy efficiency with respect to normalized SNR threshold (γ0). Energy efficiency, under different contention window sizes (N), has almost the same peak value, which indicates that the maximal energy efficiency is not very sensitive to contention window size. A small contention window usually cannot well remove the false wake-up, in that case a large SNR threshold needs to be used, and the SNR range is narrow. In contrast, using a relatively large CW helps to remove collisions and false wake-ups in part, and a smaller SNR threshold can be used instead.Figure 4
Different definitions of energy efficiency (average absolute SNR is equal to 20 dB).
(a)
Energy efficiencyη′(γ0,N)
(b)
Energy efficiencyη(γ0,N)A problem is that average transmission rateE(r∣γ≥γ0) depends on the absolute SNR per link, which is difficult to obtain in the distributed environment. We notice that SNR threshold helps to both improve transmission rate and remove false wake-up. By separately considering the two items E(r∣γ≥γ0) and ε(γ0,N) in (21), that is, keeping one and removing the other, we find that reducing false wake-up usually requires higher SNR threshold.Therefore, we choose to removeE(r∣γ≥γ0) from (21) and use the following definition of energy efficiency:(22)ηγ0,N=tData·PS∣γ0,Ntγ0,N·εγ0,N.Figure 4(b) shows the energy efficiency η(γ0,N), which has a similar trend as that in Figure 4(a). As will be explained later, a high SNR threshold may increase the probability that no nodes have SNR above the threshold due to limit of channel coherence time. Therefore, a low SNR threshold is preferred, and a relatively large value is chosen for contention window, which is fixed to N=50 when there are no less than 5 nodes. Then, (22) is used to compute the optimal SNR threshold.


## 3.1. Basic Analysis of Slotted Contention

Among all nodes, there areM nodes with packets ready (M changes with time). Out of these M nodes, with a probability(1)Pm∣γ0=CmM·Fγ0M-m·1-Fγ0m,the normalized SNR of m nodes is above the threshold γ0.Consider thejth slot of the contention window, where multiple WLAN modules may be simultaneously activated because their backoff counters are first decreased to 0 at that slot. It should be noted that any WuR, whose backoff counter reaches 0 in the NWU slots immediately after the jth slot, also falsely activates its WLAN module, because no node transmits in this wake-up period. Falsely activated nodes are put into sleep again.There are three possible cases after each channel contention.(i) All nodes have a normalized SNR belowγ0 and no node transmits at all (Figure 3(b), denoted as E), which has a probability (2)PE∣γ0=P0∣γ0,and the channel is idle for a time (3)tE∣N=tWuM+tDIFS+N·TS+tDIFS,tE∣γ0,N=tE∣N·PE∣γ0.Then, the AP rebroadcasts a WuM to start the next contention period.Figure 3
Different cases of a transmission. (a) A contention window withN slots. (b) No node transmits, and the channel remains idle during the whole contention window. (c) Exactly one node transmits without a collision. (d) A collision occurs because multiple nodes simultaneously transmit.(ii) One node transmits without any collision (Figure3(c), denoted as S). This happens if exactly one node chooses the least timer value j, which has a probability (4)PS∣j,m,N=1N,1≤j≤N,m=1,C1m·N-jm-1Nm,1≤j≤N-1,m≥2,and the overall success probability is(5)PS∣γ0,N=∑m=1M∑j=1NPS∣j,m,NPm∣γ0.Each successful transmission consumes the time (6)tS∣j,m,N=tWuM+tDIFS+j·TS+TWU+tCTS+tSIFS+tData+tSIFS+tACK+tDIFS,and its average is equal to(7)tS∣γ0,N=∑m=1M∑j=1NtS∣j,m,NPS∣j,m,NPm∣γ0.And the number of successful transmissions per contention round is equal to(8)LS∣γ0,N=1·PS∣γ0,N1-PE∣γ0.Of the otherm-1 nodes whose backoff counters reach 0 in the remaining N-j slots, the ones that reach 0 in the subsequent NWU slots will experience false wake-up. This is equivalent to a binomial distribution [26] with p=NWU/N-j in the m-1 trials. Therefore, the average number of nodes that will experience false wake-ups is equal to(9)LFS∣j,m,N=m-1NWUN-j,1≤j≤N-NWU,m≥2,m-1,N-NWU<j≤N-1,m≥2.The number of false wake-ups under a successful transmission is equal to(10)LFS∣γ0,N=∑m=1MLFS∣m,NPm∣γ01-PE∣γ0,LFS∣m,N=∑j=1NPS∣j,m,N·LFS∣j,m,N.(iii) Two or more nodes transmit simultaneously, which leads to a collision (Figure3(d), denoted as C). A collision happens when k≥2 nodes choose the same least timer value j, which has a probability (11)PC∣k,j,m,N=Ckm·N-jm-kNm,1≤j≤N-1,m≥2,1Nm,k=m,j=N,m≥2.A collision leads to the channel waste for a time(12)tC∣k,j,m,N=tWuM+tDIFS+j·TS+TWU+tCTS+tEIFS,and its average is equal to(13)tC∣γ0,N=∑m=2M∑j=1N∑k=2mtC∣k,j,m,NPC∣k,j,m,NPm∣γ0.The number of nodes simultaneously transmitting in a collision is equal to(14)LC∣k,j,m,N=k,1≤j≤N-1,m≥2,m,j=N,m≥2,and its average is equal to(15)LC∣γ0,N=∑m=2MLC∣m,NPm∣γ01-PE∣γ0,LC∣m,N=∑j=1N∑k=2mPC∣k,j,m,N·LC∣k,j,m,N.Of the otherm-k nodes whose backoff counters reach 0 in the remaining N-j slots, the ones that reach 0 in the subsequent NWU slots will experience false wake-up. This is equivalent to a binomial distribution with p=NWU/N-j in the m-k trials. Therefore, the average number of nodes that will experience false wake-ups is equal to(16)LFC∣k,j,m,N=m-k·NWUN-j,1≤j≤N-NWU,m≥2,m-k,N-NWU<j<N,m≥2.The average number of false wake-ups under a collision is equal to(17)LFC∣γ0,N=∑m=2MLFC∣m,NPm∣γ01-PE∣γ0,LFC∣m,N=∑j=1N∑k=2mPC∣k,j,m,N·LFC∣k,j,m,N.


## 3.2. Optimal Parameter

The average time for each round is the weighted sum of three parts (idle waiting, successful transmission, and collision) as follows:(18)tγ0,N=tE∣γ0,N+tS∣γ0,N+tC∣γ0,N.The average transmission rate is an average over all nodes. The transmission rate (ri for the ith node) is estimated from the absolute SNR (γ·γ¯i′), based on the Shannon capacity, and the operator E(·) represents the computation of expectation. (19)Er∣γ≥γ0=1M∑i=1MEri∣γi≥γ0,Eri∣γi≥γ0=∫γ0∞log21+γ·γ¯i′·fγiγdγ∫γ0∞fγiγdγ.The average energy per round ε(γ0,N) is a sum of three parts: εS(γ0,N) for successful transmission, εC(γ0,N) for collisions, and εF(γ0,N) for false wake-ups as follows:(20)εγ0,N=εSγ0,N+εCγ0,N+εFγ0,N,εSγ0,N=TWU+TSL+2·tSIFS·EI·LS∣γ0,N+tCTS+tACK·ET+tData·ER·LS∣γ0,N,εCγ0,N=TWU+TSL+tEIFS·EI+tCTS·ET·LC∣γ0,N,εFγ0,N=TWU+TSL·EI·LFS∣γ0,N+LFC∣γ0,N,where εS(γ0,N) is computed from L(S∣γ0,N), the average number of successful transmissions, εC(γ0,N) is computed from L(C∣γ0,N), the average number of nodes involved in a collision, and εF(γ0,N) is computed from LF(S∣γ0,N)+LF(C∣γ0,N), the average number of nodes experiencing false wake-up.First, energy efficiency, defined as the ratio of the number of overall bits to the product of average transmission time and average energy, is considered as follows:(21)η′γ0,N=Er∣γ≥γ0·tData·PS∣γ0,Ntγ0,N·εγ0,N.Figure 4(a) shows the result, which plots energy efficiency with respect to normalized SNR threshold (γ0). Energy efficiency, under different contention window sizes (N), has almost the same peak value, which indicates that the maximal energy efficiency is not very sensitive to contention window size. A small contention window usually cannot well remove the false wake-up, in that case a large SNR threshold needs to be used, and the SNR range is narrow. In contrast, using a relatively large CW helps to remove collisions and false wake-ups in part, and a smaller SNR threshold can be used instead.Figure 4
Different definitions of energy efficiency (average absolute SNR is equal to 20 dB).
(a)
Energy efficiencyη′(γ0,N)
(b)
Energy efficiencyη(γ0,N)A problem is that average transmission rateE(r∣γ≥γ0) depends on the absolute SNR per link, which is difficult to obtain in the distributed environment. We notice that SNR threshold helps to both improve transmission rate and remove false wake-up. By separately considering the two items E(r∣γ≥γ0) and ε(γ0,N) in (21), that is, keeping one and removing the other, we find that reducing false wake-up usually requires higher SNR threshold.Therefore, we choose to removeE(r∣γ≥γ0) from (21) and use the following definition of energy efficiency:(22)ηγ0,N=tData·PS∣γ0,Ntγ0,N·εγ0,N.Figure 4(b) shows the energy efficiency η(γ0,N), which has a similar trend as that in Figure 4(a). As will be explained later, a high SNR threshold may increase the probability that no nodes have SNR above the threshold due to limit of channel coherence time. Therefore, a low SNR threshold is preferred, and a relatively large value is chosen for contention window, which is fixed to N=50 when there are no less than 5 nodes. Then, (22) is used to compute the optimal SNR threshold.


## 4. Performance Evaluation

In the simulation evaluation, we compare the following 4 methods.(1) First is the PSM mode [1] without using WuR. A WLAN module periodically wakes up to receive TIM, and if there are any packets buffered at the AP, it stays awake in the whole beacon period. Later simulation results will show that in this method a WLAN module will consume much more power than in other methods due to the idle waiting. (2) Second is the adaptive PSM mode (PSMAdapt) [2] without WuR. This is built on top of the PSM mode, but a node that has received all packets buffered at the AP will enter the sleep mode immediately. This helps to reduce most of the idle waiting in the PSM mode, although it causes large delay because packets which arrive after the node sleeps will not be received until the next TIM timing. (3) Third is the wake-up per node (WuR). The AP activates each node separately, without referring to their link quality. (4) Fourth is the wake-up with multiuser scheduling (WuRMUS), the proposed method.We built a packet-level simulator in the MATLAB environment. We consider a WLAN with an AP and a variable number of nodes (average absolute SNR is equal to 20 dB) and evaluate its performance with different traffic settings. Packet arrival follows the Poisson process. In the evaluation, we will consider four metrics: delay, channel utilization (the percentage of time that the channel is busy, including SIFS, DIFS, and backoff slots), power consumption per node, and throughput. The results are the average of 50 runs with different seeds. The transmission rate is decided by SNR [27]. IEEE 802.11a is adopted and packet length is 1000 bytes. Main parameters are shown in Table 2. In all methods, opportunistic packet aggregation [28] is used, so that multiple packets that arrived before the transmission timing are transmitted together if they can be aggregated (with the constraint that the transmission time will not be larger than the one for transmitting a packet at the lowest rate).Table 2
Main parameters for simulation.
PHY
IEEE 802.11a, propagation: free-space & two-ray
MAC
CSMA,TSLOT=9μs, TSIFS=16μs, TDIFS=34μs
Period
Beacon: 100 ms, TIM: 200 ms, WuM: 10 ms
WuM
0.4 ms in WuRMUS, 0.1 ms in WuR.
Packet
L
=
1,000 byte
Traffic
Packet arrival time follows Poisson process
Bit rate
Decided by SNR
CW
50 slots
Latency
Wake-up latency:22×TSLOT, sleep: 2×TSLOT
Power
WLAN: receiving/idle 1 W, transmission 1 W; WuR: 1 mW


### 4.1. Effect of WuM Period

In the proposed method, the WuM period plays an important role. Here we evaluate the performance of the proposed method under different WuM periods, and the results are shown in Figure5. Unsurprisingly, the delay per packet increases with the WuM period (Figure 5(a)). Figure 5(b) shows that channel utilization decreases as WuM period increases. This is because a large WuM period increases the opportunity of packet aggregation and improves channel efficiency. This will reduce the time that a node stays awake to receive its packets buffered at the AP. As a result, power consumption per node decreases as WuM period increases, as shown in Figure 5(c). Because a very small WuM period will increase the overhead and energy consumption while a very large WuM period will increase the delay, in the following, the WuM period is chosen to be 10 ms.Figure 5
Performance of WuRMUS under different WuM periods (traffic rate: 50 packets/s per node).
(a)
Delay per packet (ms)
(b)
Channel utilization
(c)
Power consumption (mW)


### 4.2. Under Different Numbers of Nodes

Here we evaluate the performance of different methods with respect to the number of nodes in a WLAN. In this evaluation, the overall traffic is fixed to 500 packet/s and the amount of traffic per node decreases as the number of nodes increases. Because packets to different nodes arrive at different timing, the number of nodes that have packets buffered at the AP changes with time.Figure6(a) shows the delay per packet in different methods. WuRMUS lies between PSM and WuR, and PSMAdapt has the largest delay. In PSM, each node wakes up per TIM timing (period = 200 ms) and shifts to the sleep state if no packet is available. Any packets arriving immediately after a node sleeps will have a large delay. As for PSMAdapt, a node shifts to the sleep mode more aggressively, which leads to larger delay. In WuRMUS, the delay per packet increases with the number of nodes. As the number of nodes increases, more nodes have buffered packets and will participate in the transmission scheduling. Then, a higher SNR threshold will be selected. But the channel does not change much within a short time (channel coherence time), and the probability that no nodes have SNR above the specified SNR threshold increases, which increases the delay in WuRMUS. The delay per packet in WuR is almost always nearly 0, at the cost of more overhead and power consumption.Figure 6
Performance of different methods under different numbers of nodes (overall traffic rate: 500 packet/s).
(a)
Delay per packet (ms)
(b)
Channel utilization
(c)
Power consumption (mW)Figure6(b) shows channel utilization in different methods. Channel utilization is the highest in WuR due to its transmission of WuM per node. PSMAdapt has lower channel utilization compared with PSM, because with more aggressive sleep policy, more packets are buffered at the TIM timing, which enables more chance of packet aggregation and reduces overhead. In WuRMUS, channel utilization decreases as the number of nodes increases, due to two reasons. (i) The SNR threshold increases with the number of nodes, which, at the cost of delay, increases the chance of packet aggregation. But WuRMUS has much smaller delay than PSM by using a smaller WuM period. (ii) With more nodes, the effect of multiuser diversity becomes more obvious and the transmission rate is improved.Figure6(c) shows power consumption per node. Unsurprisingly, power consumption is the highest in PSM, because each node, once detecting that there is a packet ready to be received according to the TIM included in a beacon, will wait until the next beacon announces that no packet remains. Using a more aggressive power-save mode in PSMAdapt effectively reduces the power consumption compared with PSM, but power consumption is still nearly constant, because some nodes that failed to capture the channel first have to stay awake, waiting for other nodes to finish receiving. In WuR and WuRMUS, power consumption decreases as the number of nodes increases, this is because (i) the WLAN module of a node is active only when receiving a packet, and (ii) the overall traffic is fixed and the amount of traffic per node decreases, so does the active time per node. WuRMUS further decreases power consumption per node compared with WuR, and its gain ranges from 40% to 43%. This is achieved by (i) improving transmission rate by setting an SNR threshold and (ii) increasing the opportunities of packet aggregation by periodically transmitting WuMs.


### 4.3. Under Different Traffic Volume

Next we fix the number of nodes to 20 and adjust the overall traffic to investigate the changes in delay, power consumption, and system throughput.Figure7(a) shows the delay per packet. As the amount of overall traffic increases, on average, the delay decreases in PSM. But the delay in WuRMUS has a different trend. Although the number of overall nodes is fixed, with more traffic, the number of nodes with buffered packets increases, so does the SNR threshold. Then, the probability that no nodes have SNR above the specified SNR threshold increases, which increases the delay in WuRMUS. But the delay in WuRMUS is still less than that in PSM.Figure 7
Performance of different methods under different volumes of traffic (number of nodes = 20).
(a)
Delay per packet (ms)
(b)
Power consumption (mW)
(c)
System throughput (Mbps)Figure7(b) shows that power consumption per node increases with the amount of traffic as well. Anyway, power consumption is always the lowest in WuRMUS. When there is little traffic (≤300 packet/s), the superiority of WuRMUS over WuR is not very obvious. But with more traffic, WuRMUS reduces power consumption per node, by 35% to 55%, compared with WuR.Figure7(c) shows that throughput increases with the amount of overall traffic and finally approaches constant values in all methods when the network saturates. Although WuR and WuRMUS have relatively large overhead in times of light traffic, in the saturation state, many packets are aggregated and the overhead of wake-up control is not very obvious. Therefore, in the saturation state, the throughput of WuR is only a little lower than that of PSM and PSMAdapt. WuRMUS achieves higher throughput than other methods because it exploits multiuser scheduling to improve transmission rates. It should be noted that WuRMUS does not realize throughput fairness among nodes. Instead, it ensures a proportional fairness, and interested readers may refer to [18] for more details.In summary, WuRMUS reduces power consumption compared with other methods. In times of light traffic, WuRMUS also reduces delay compared with PSM and PSMAdapt and reduces channel utilization compared with WuR. In times of medium traffic or many nodes, the number of nodes that have buffered packets increases, which increases the SNR threshold. But the channel does not change completely randomly due to the limit of channel coherence time. Therefore, in WuRMUS, the probability that no nodes have SNR greater than specified SNR increases, which leads to large delay. How to solve this problem is left as a future work. In times of heavy traffic, the overhead of wake-up control in WuRMUS is not obvious after packet aggregation. Instead, applying multiuser scheduling helps to improve system throughput.


## 4.1. Effect of WuM Period

In the proposed method, the WuM period plays an important role. Here we evaluate the performance of the proposed method under different WuM periods, and the results are shown in Figure5. Unsurprisingly, the delay per packet increases with the WuM period (Figure 5(a)). Figure 5(b) shows that channel utilization decreases as WuM period increases. This is because a large WuM period increases the opportunity of packet aggregation and improves channel efficiency. This will reduce the time that a node stays awake to receive its packets buffered at the AP. As a result, power consumption per node decreases as WuM period increases, as shown in Figure 5(c). Because a very small WuM period will increase the overhead and energy consumption while a very large WuM period will increase the delay, in the following, the WuM period is chosen to be 10 ms.Figure 5
Performance of WuRMUS under different WuM periods (traffic rate: 50 packets/s per node).
(a)
Delay per packet (ms)
(b)
Channel utilization
(c)
Power consumption (mW)


## 4.2. Under Different Numbers of Nodes

Here we evaluate the performance of different methods with respect to the number of nodes in a WLAN. In this evaluation, the overall traffic is fixed to 500 packet/s and the amount of traffic per node decreases as the number of nodes increases. Because packets to different nodes arrive at different timing, the number of nodes that have packets buffered at the AP changes with time.Figure6(a) shows the delay per packet in different methods. WuRMUS lies between PSM and WuR, and PSMAdapt has the largest delay. In PSM, each node wakes up per TIM timing (period = 200 ms) and shifts to the sleep state if no packet is available. Any packets arriving immediately after a node sleeps will have a large delay. As for PSMAdapt, a node shifts to the sleep mode more aggressively, which leads to larger delay. In WuRMUS, the delay per packet increases with the number of nodes. As the number of nodes increases, more nodes have buffered packets and will participate in the transmission scheduling. Then, a higher SNR threshold will be selected. But the channel does not change much within a short time (channel coherence time), and the probability that no nodes have SNR above the specified SNR threshold increases, which increases the delay in WuRMUS. The delay per packet in WuR is almost always nearly 0, at the cost of more overhead and power consumption.Figure 6
Performance of different methods under different numbers of nodes (overall traffic rate: 500 packet/s).
(a)
Delay per packet (ms)
(b)
Channel utilization
(c)
Power consumption (mW)Figure6(b) shows channel utilization in different methods. Channel utilization is the highest in WuR due to its transmission of WuM per node. PSMAdapt has lower channel utilization compared with PSM, because with more aggressive sleep policy, more packets are buffered at the TIM timing, which enables more chance of packet aggregation and reduces overhead. In WuRMUS, channel utilization decreases as the number of nodes increases, due to two reasons. (i) The SNR threshold increases with the number of nodes, which, at the cost of delay, increases the chance of packet aggregation. But WuRMUS has much smaller delay than PSM by using a smaller WuM period. (ii) With more nodes, the effect of multiuser diversity becomes more obvious and the transmission rate is improved.Figure6(c) shows power consumption per node. Unsurprisingly, power consumption is the highest in PSM, because each node, once detecting that there is a packet ready to be received according to the TIM included in a beacon, will wait until the next beacon announces that no packet remains. Using a more aggressive power-save mode in PSMAdapt effectively reduces the power consumption compared with PSM, but power consumption is still nearly constant, because some nodes that failed to capture the channel first have to stay awake, waiting for other nodes to finish receiving. In WuR and WuRMUS, power consumption decreases as the number of nodes increases, this is because (i) the WLAN module of a node is active only when receiving a packet, and (ii) the overall traffic is fixed and the amount of traffic per node decreases, so does the active time per node. WuRMUS further decreases power consumption per node compared with WuR, and its gain ranges from 40% to 43%. This is achieved by (i) improving transmission rate by setting an SNR threshold and (ii) increasing the opportunities of packet aggregation by periodically transmitting WuMs.


## 4.3. Under Different Traffic Volume

Next we fix the number of nodes to 20 and adjust the overall traffic to investigate the changes in delay, power consumption, and system throughput.Figure7(a) shows the delay per packet. As the amount of overall traffic increases, on average, the delay decreases in PSM. But the delay in WuRMUS has a different trend. Although the number of overall nodes is fixed, with more traffic, the number of nodes with buffered packets increases, so does the SNR threshold. Then, the probability that no nodes have SNR above the specified SNR threshold increases, which increases the delay in WuRMUS. But the delay in WuRMUS is still less than that in PSM.Figure 7
Performance of different methods under different volumes of traffic (number of nodes = 20).
(a)
Delay per packet (ms)
(b)
Power consumption (mW)
(c)
System throughput (Mbps)Figure7(b) shows that power consumption per node increases with the amount of traffic as well. Anyway, power consumption is always the lowest in WuRMUS. When there is little traffic (≤300 packet/s), the superiority of WuRMUS over WuR is not very obvious. But with more traffic, WuRMUS reduces power consumption per node, by 35% to 55%, compared with WuR.Figure7(c) shows that throughput increases with the amount of overall traffic and finally approaches constant values in all methods when the network saturates. Although WuR and WuRMUS have relatively large overhead in times of light traffic, in the saturation state, many packets are aggregated and the overhead of wake-up control is not very obvious. Therefore, in the saturation state, the throughput of WuR is only a little lower than that of PSM and PSMAdapt. WuRMUS achieves higher throughput than other methods because it exploits multiuser scheduling to improve transmission rates. It should be noted that WuRMUS does not realize throughput fairness among nodes. Instead, it ensures a proportional fairness, and interested readers may refer to [18] for more details.In summary, WuRMUS reduces power consumption compared with other methods. In times of light traffic, WuRMUS also reduces delay compared with PSM and PSMAdapt and reduces channel utilization compared with WuR. In times of medium traffic or many nodes, the number of nodes that have buffered packets increases, which increases the SNR threshold. But the channel does not change completely randomly due to the limit of channel coherence time. Therefore, in WuRMUS, the probability that no nodes have SNR greater than specified SNR increases, which leads to large delay. How to solve this problem is left as a future work. In times of heavy traffic, the overhead of wake-up control in WuRMUS is not obvious after packet aggregation. Instead, applying multiuser scheduling helps to improve system throughput.


## 5. Conclusion

This paper studies the transmission scheduling in the downlink of a WLAN by using a wake-up radio to remotely activate a WLAN module to receive packets on demand. Instead of wake-up per node, we proposed a broadcast-based wake-up control framework to reduce the overhead and improve the transmission rate. This brings new issues like transmission collisions and false wake-up. These problems are solved by setting a SNR threshold. In this way, the proposed method reduces transmission collisions and false wake-ups and improves transmission rate. Simulation evaluations verify that the proposed method (i) effectively reduces power consumption of nodes compared with state-of-the-art methods, (ii) reduces delay compared with power-save mode in times of light traffic, and (iii) improves system throughput compared with other methods in the saturation state. In the future, we will also study how to further reduce the delay in the proposed method.



---

*Source: 2405381-2017-12-24.xml*