# Taxonomy and Evaluations of Low-Power Listening Protocols for Machine-to-Machine Networks

Authors: Kwang-il Hwang; Sung-Hyun Yoon
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Even though a lot of research has made significant contributions to advances in sensor networks, sensor network protocols, which have different characteristics according to the target application, might confuse machine-to-machine (M2M) network designers when they choose the protocol most suitable for their specific applications. Therefore, this paper provides a well-defined taxonomy of low-power listening protocols by examining in detail the existing low-power sensor network protocols and evaluation results. It will also be very useful for helping M2M designers understand specific features of low-power media access control protocols as they design new M2M networks.


---

## Body

## 1. Introduction

Machine-to-machine (M2M) networks enable creation of the Internet of Things, which interconnects via the Internet physical things equipped with various sensors and actuators. Mitsui et al. [1] presented various M2M applications based on sensor network technologies. A typical M2M architecture is basically composed of three domains: the server, the Internet, and the sensors. In particular, the sensor domain is the most important, aggregating data from physical sensors and accessing the Internet via 3G or 4G M2M gateways. Like a sensor network, an M2M sensor domain requires well-structured and energy-efficient network protocols among distributed sensors using short range communications. Much research has already been conducted on sensor network protocols [2], making significant contributions towards advances in automated sensor networks [3–5]. However, having too many sensor network protocols causes confusion for M2M designers as they choose the protocol most suitable for their specific applications. Furthermore, most of the literature on sensor network protocols is too theoretical, requires a lot of specific assumptions, and is not easy to apply to practical M2M sensor domains.Sensor media access control (MAC) protocols can be categorized into random-based, slot (schedule-) based, time division multiple access- (TDMA-) based, random/TDMA hybrids, and low-power listening (LPL) methods. In particular, LPL-based MAC protocols can be considered the most suitable type for M2M sensor domains, because they provide a low duty cycle and low implementation complexity. Therefore, there has been substantial research on LPL protocols. Each one shows different characteristics and operations, as described in Table1. Therefore, this paper aims to provide a well-defined taxonomy of low-power listening protocols by examining in detail the existing low-power sensor network protocols, introducing an M2M communication model and then evaluating performance with respect to data aggregation time and energy consumption in terms of an M2M communication model.Table 1
LPL MAC protocols.
Protocol
Features
B-MAC [6]
(i) Berkeley MAC(ii) LPL with check time, back-off window size, and power-down policy in the application level (iii) Advanced clear channel assessment (CCA) for dealing with random noise
Wise-MAC [7]
(i) Improved LPL, remembering neighbors’ polling schedules(ii) Sends short preamble when the receiver wakes up
X-MAC [8]
(i) Upgraded B-MAC protocol(ii) Divides long preamble into two parts (micropreamble/receiver address) to solve overhearing
SpeckMAC [9]
(i) Consists of SpeckMAC-B, SpeckMAC-D(ii) Consecutive data frame, wake-up packet (iii) Sender accesses receiver with 3 bytes preamble in the packet frame
RI-MAC [10]
(i) Receiver-initiated MAC protocol(ii) Receiver sends periodic beacon frame and sender sends data frame if beacon frame is received
BoX-MAC [11]
(i) Cross-layer MAC protocol using PHY, link layer(ii) Consists of two parts (BoX-MAC-1/BoX-MAC-2)  (iii) Goes into sleep state in back-off time (iv) Less wake-up time than X-MAC
MX-MAC [12]
(i) An LPL variant of CSMA-MPS(ii) Compatible with X-MAC and SpeckMAC (iii) Consecutive packet transmission instead of short preamble strobe in X-MAC (iv) Sends ACK when packet is received to solve X-MAC’s early ACK problem
A-MAC [13]
(i) Receiver-initiated MAC protocol(ii) Using hardware-generated acknowledgment (HACK) for more efficient energy consumption (iii) Saves neighbors’ LPL schedules (iv) Deals with hidden terminal problemThe remainder of this paper is organized as follows. A taxonomy of LPL protocols is presented in Section2. Section 3 analyzes each LPL protocol in terms of an M2M communications model. Section 4 summarizes numerical results and Section 5 provides concluding remarks.


## 2. A Taxonomy of Low-Power Listening Protocols

### 2.1. Trigger Source (Preamble versus Packet)

The main idea of LPL is to asynchronously trigger a receiver that is alternating between wake-up and sleep states to detect a wake-up signal from a sender. Therefore, receivers can save much more energy by removing idle listening periods. Some protocols, such as B-MAC, WISE-MAC, and X-MAC, use a preamble as a trigger source. On the other hand, SpeckMAC, RI-MAC, BoX-MAC, MX-MAC, and A-MAC trigger receivers by transmitting a consecutive packet. More specifically, RI-MAC, MX-MAC, A-MAC, and SPEC-MAC-D utilize a data packet for the trigger, and SpeckMAC-B, BoX-MAC-1, and BoX-MAC-2 utilize short wake-up packets before data transmission.


### 2.2. Initiation Method (Receiver-Initiated versus Source-Initiated)

LPL protocols can also be categorized into source-initiated and receiver-initiated methods, according to which one begins the transmission request. RI-MAC and A-MAC are receiver-initiated protocols but the rest of the protocols are source-initiated protocols.


### 2.3. Adaptivity (Adaptive versus Deterministic)

B-MAC, SpeckMAC, RI-MAC, A-MAC, and BoX-MAC-1 always transmit triggering signals for predetermined fixed duration, but some protocols, such as WISE-MAC, X-MAC, MX-MAC, and BoX-MAC-2, transmit variable triggering signals depending on when a receiver is triggered.


### 2.4. Schedule (Schedule versus Nonschedule)

To reduce data pending time more, some protocols, such as WISE-MAC and MX-MAC, use schedule-based triggering by exchanging wake-up time information among neighbors.


## 2.1. Trigger Source (Preamble versus Packet)

The main idea of LPL is to asynchronously trigger a receiver that is alternating between wake-up and sleep states to detect a wake-up signal from a sender. Therefore, receivers can save much more energy by removing idle listening periods. Some protocols, such as B-MAC, WISE-MAC, and X-MAC, use a preamble as a trigger source. On the other hand, SpeckMAC, RI-MAC, BoX-MAC, MX-MAC, and A-MAC trigger receivers by transmitting a consecutive packet. More specifically, RI-MAC, MX-MAC, A-MAC, and SPEC-MAC-D utilize a data packet for the trigger, and SpeckMAC-B, BoX-MAC-1, and BoX-MAC-2 utilize short wake-up packets before data transmission.


## 2.2. Initiation Method (Receiver-Initiated versus Source-Initiated)

LPL protocols can also be categorized into source-initiated and receiver-initiated methods, according to which one begins the transmission request. RI-MAC and A-MAC are receiver-initiated protocols but the rest of the protocols are source-initiated protocols.


## 2.3. Adaptivity (Adaptive versus Deterministic)

B-MAC, SpeckMAC, RI-MAC, A-MAC, and BoX-MAC-1 always transmit triggering signals for predetermined fixed duration, but some protocols, such as WISE-MAC, X-MAC, MX-MAC, and BoX-MAC-2, transmit variable triggering signals depending on when a receiver is triggered.


## 2.4. Schedule (Schedule versus Nonschedule)

To reduce data pending time more, some protocols, such as WISE-MAC and MX-MAC, use schedule-based triggering by exchanging wake-up time information among neighbors.


## 3. M2M Communication Model

In this section, an M2M communication model is presented, and then each LPL protocol is analyzed in terms of the M2M model.


### 3.1. System Model

Generally, M2M is composed of a concentrator, which is a centralized device to connect the M2M sensor domain to the Internet, and M2M devices, which are equipped with various sensors or actuators. In an M2M sensor domain, devices form either a star or a peer-to-peer topology for multihop communications. Data from each device are aggregated in the concentrator and transmitted to a corresponding server via the Internet. To consider a practical M2M system, each protocol and algorithm should be able to execute their tasks with off-the-shelf radio frequency (RF) modems (TI CC430, CC2420, RadioPulse MG2400, etc.) and MCUs.


### 3.2. Data Model

The most popular data models for M2M are theperiodic report model and therequest-oriented model. In the periodic report model, each device transmits data to a concentrator periodically, and the model is generally used for unidirectional data aggregation. By contrast, the request-oriented model allows bidirectional communication between the concentrator and devices. In the data model, a server (user) can request a concentrator to aggregate real-time sensor data in the sensor domain. The concentrator also triggers and transmits server requests to the devices. Each device replies to the concentrator, and the responses from devices are aggregated in the concentrator and transmitted to the server.


### 3.3. Energy Model

For M2 M networks, energy conservation is one of the most critical challenges, as it is in sensor networks. It is important to note that in order to save energy, each device should remain active only for required duration, and the rest of the time should go to sleep. Therefore, when calculating the energy consumption of each device, we need to know the total active duration,T
tot-active (i) and the total sleep duration, T
tot-sleep (ii) in a request interval, T
interval. By using (i) and (ii), the energy consumption for each device can be expressed as follows:


## 3.1. System Model

Generally, M2M is composed of a concentrator, which is a centralized device to connect the M2M sensor domain to the Internet, and M2M devices, which are equipped with various sensors or actuators. In an M2M sensor domain, devices form either a star or a peer-to-peer topology for multihop communications. Data from each device are aggregated in the concentrator and transmitted to a corresponding server via the Internet. To consider a practical M2M system, each protocol and algorithm should be able to execute their tasks with off-the-shelf radio frequency (RF) modems (TI CC430, CC2420, RadioPulse MG2400, etc.) and MCUs.


## 3.2. Data Model

The most popular data models for M2M are theperiodic report model and therequest-oriented model. In the periodic report model, each device transmits data to a concentrator periodically, and the model is generally used for unidirectional data aggregation. By contrast, the request-oriented model allows bidirectional communication between the concentrator and devices. In the data model, a server (user) can request a concentrator to aggregate real-time sensor data in the sensor domain. The concentrator also triggers and transmits server requests to the devices. Each device replies to the concentrator, and the responses from devices are aggregated in the concentrator and transmitted to the server.


## 3.3. Energy Model

For M2 M networks, energy conservation is one of the most critical challenges, as it is in sensor networks. It is important to note that in order to save energy, each device should remain active only for required duration, and the rest of the time should go to sleep. Therefore, when calculating the energy consumption of each device, we need to know the total active duration,T
tot-active (i) and the total sleep duration, T
tot-sleep (ii) in a request interval, T
interval. By using (i) and (ii), the energy consumption for each device can be expressed as follows:


## 4. Numerical Analysis

Now, we numerically analyze each LPL protocol in terms of M2M communication models. In particular, we focus on data aggregation time, which is the total time required to aggregate data from all devices with respect to a request. Table2 presents notations used for our numerical analysis.Table 2
Notations.
Notation
Description
Value
T
PS
Preamble sensing time
15.6 milliseconds
T
WS
Wake-up sensing time
183 milliseconds
T
FS
Frame sensing time
183 milliseconds
T
BS
Beacon sending time
90 milliseconds
T
S
Sleep duration
Variable milliseconds
T
P
Preamble transmission  time for device trigger
(i)Long preamble (B-MAC) (ii) Short preamble (X-MAC)  (iii) Variable (Wise-MAC)
T
WP
Wake-up packet time for trigger
90 milliseconds
T
DP
Data packet time for trigger
150 milliseconds
T
BL
Beacon listen time
Random
T
B
Back-off period
1 milliseconds
T
L
Listen period
Variable
T
DT
Data transmission time
200 milliseconds
T
ACK
ACK transmission time
90 milliseconds
T
DPT
Data pending time
Random
T
DC
Duty-cycle time
=
T
PS
+
T
S (preamble-based)
=
T
WS
+
T
S (wake-up packet-based)
=
T
FS
+
T
S (packet-based) = beacon interval (receiver-initiated)
T
tot-active
Total active duration
T
A
-PPS
+
T
A
-aggre (i)
T
tot-sleep
Total sleep duration
T
interval
-
T
tot-active (ii)
T
interval
Request interval
1 hour (=3600 seconds = 3600000 milliseconds)
I
A
Current consumption in active state
0.0061944 mA
I
S
Current consumption in active state
0.0000083 mA
T
A
-aggre
Active duration during data aggregation time
T
A
-PPS
Active duration in a duty cycle
T
AW
Acknowledgement waiting period
100 milliseconds
V
Supply voltage
3.5 V


### 4.1. B-MAC

B-MAC is a representative LPL protocol utilizing a preamble for the receiver trigger. As shown in Figure1, each device repeats a short time wake-up for T
PS to detect the preamble transmission and then sleeps for T
s, per T
DC. A sender that wants to send data first transmits a long preamble for T
P to trigger the receiver that is performing periodic preamble sensing (PPS) before data transmission. Each preamble transmission can be detected by all devices within communication range of a sender, and all nodes that detect the preamble transmission, as well as the intended receiver, have to remain active for T
L, until the preamble transmission ends.Figure 1
B-MAC.


#### 4.1.1. Periodic Report

Since each device should send its data to the concentrator on the predetermined schedule, the report time of each device is as follows:(1)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(2)
T
B-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


#### 4.1.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(3)
T
req
=
T
B
+
T
P
+
T
DT
.
In particular, since B-MAC is capable of triggering all nodes with a single preamble transmission, all the devices can listen to the request message following the preamble. Therefore, the total aggregation time of n nodes per request is
(4)
T
B-MAC
(
R
)
=
T
req
+
n
*
T
resp
=
T
B
+
T
P
+
T
DT
+
n
*
(
T
B
+
T
DC
+
T
DT
+
T
ACK
)
.


### 4.2. WISE-MAC

Unlike B-MAC, which transmits a long preamble, WISE-MAC aims to save more energy by transmitting a shorter preamble. To achieve this, each sender manages a schedule table in which all its neighbors’ PPS schedules are stored. Therefore, if a sender does not know the PPS schedule of a receiver, the sender must transmit a long preamble, as in B-MAC, but otherwise, the sender can transmit a minimum preamble forT
MP to trigger the receiver, as shown in Figure 2.Figure 2
WISE-MAC.


#### 4.2.1. Periodic Report

The report time of a WISE-MAC device is calculated as follows:(5)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(6)
T
WISE-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


#### 4.2.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is as follows:(7)
T
req
=
T
B
+
T
P
+
T
DT
.
And, like B-MAC, the WISE-MAC sender can trigger all devices with a single long preamble, so the total aggregation time of n nodes per request is
(8)
T
WISE-MAC
(
R
)
=

T
req
+
n
*
T
resp
=

T
B
+
T
P
+
T
DT
+
n
*

(

T
B
+
T
DC
+
T
DT
+
T
ACK

)
.


### 4.3. X-MAC

As shown in Figure3, X-MAC utilizes an early acknowledgment (ACK) and short preamble to reduce energy waste from transmitting a long preamble, as in B-MAC and WISE-MAC in the worst case scenario. In addition, the short preamble represents a destination ID, and a gap, T
AW, between short preambles is used to receive the ACK of the receiver.Figure 3
X-MAC.


#### 4.3.1. Periodic Report

The report time of an X-MAC device is as follows:(9)
T
resp
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(10)
T
X-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


#### 4.3.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(11)
T
req
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
.
And, unlike B-MAC and WISE-MAC, X-MAC cannot trigger all devices with a single preamble transmission. Therefore, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(12)
T
X-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


### 4.4. SpeckMAC-B

Instead of a preamble transmission, SpeckMAC-B transmits consecutive wake-up packets to trigger devices performing periodic wake-up-signal sensing (PWS), as shown in Figure4. A wake-up packet contains a destination ID and a time stamp, which represents data packet transmission time information. Therefore, a device that listens to a wake-up packet during PWS goes to sleep until the beginning of data transmission wakes up and then receives data from the sender. Devices that listen to a wake-up packet but that are not the intended receiver go to sleep and continue to perform PWS.Figure 4
SpeckMAC-B.


#### 4.4.1. Periodic Report

The report time of a SpeckMAC-B device is as follows:(13)
T
resp
=
T
B
+
m
*
T
WP
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(14)
T
SPECK-MAC-B
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


#### 4.4.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(15)
T
req
=
T
B
+
m
*
T
WP
+
T
DT
.
And, like B-MAC or WISE-MAC, a single request packet can trigger all devices, so the total aggregation time of n nodes per request is
(16)
T
SPECK-MAC-B
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


### 4.5. SpeckMAC-D

Instead of the wake-up packet transmission used in SpeckMAC-B, SpeckMAC-D enables fast data reception by utilizing consecutive data packets. Each SpeckMAC-D device performs periodic frame sensing (PFS) forT
FS to receive a data frame, as shown in Figure 5.Figure 5
SpeckMAC-D.


#### 4.5.1. Periodic Report

The report time of a SpeckMAC-D device is as follows:(17)
T
resp
=
T
B
+
T
DP
*
m
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(18)
T
SPECK-MAC-D
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
DP
*
m
)
.


#### 4.5.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(19)
T
req
=
T
B
+
T
DP
*
m
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(20)
T
SPECK-MAC-D
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
T
DP
*
m
)
.


### 4.6. RI-MAC

RI-MAC is a representative receiver-initiated LPL protocol. Each RI-MAC device basically performs periodic beacon sending (PBS). A sender first switches to reception (RX) mode and waits to receive the beacon of a corresponding receiver. As soon as a corresponding beacon is received, the sender transmits data and then goes back to PBS. The receiver of the data acknowledges a beacon, as shown in Figure6.Figure 6
RI-MAC.


#### 4.6.1. Periodic Report

The report time of an RI-MAC device is as follows:(21)
T
resp
=
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(22)
T
RI-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
DT
+
2
*
T
BS
)
.


#### 4.6.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(23)
T
req
=
T
DT
+
2
*
T
BS
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(24)
T
RI-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
DT
+
2
*
T
BS
)
.


### 4.7. BoX-MAC-1

As shown in Figure7, BoX-MAC-1 is one of the packet-based LPL protocols, and T
AW (to wait for ACK of the receiver) is followed by consecutive wake-up packets. Then, on reception of the ACK, the data are transmitted.Figure 7
BoX-MAC-1.


#### 4.7.1. Periodic Report

The report time of a BoX-MAC-1 device is as follows:(25)
T
resp
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(26)
T
BOX-MAC-1
(
P
)

=

n
*
T
resp
=

n
*

(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT

)

.


#### 4.7.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(27)
T
req
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
.
And since data transmission is started only when an ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is as follows:
(28)
T
BOX-MAC-1
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
)
.


### 4.8. BoX-MAC-2

BoX-MAC-2 is one of the wake-up, packet-based LPL protocols. However, unlike BoX-MAC-1 or SpeckMAC-B utilizing consecutive wake-packet transmissions, a sender waits for ACK from the receiver forT
AW, per wake-up transmission, as shown in Figure 8. Therefore, a sender repeats wake-up packet transmission and RX for ACK until receiving the ACK.Figure 8
BOX-MAC-2.


#### 4.8.1. Periodic Report

The report time of a BoX-MAC-2 device is as follows:(29)
T
resp
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(30)
T
BOX-MAC-2
(
P
)
=
n
*
T
resp
=
n
*

(
T
B
+
m
*

(
T
WP
+
T
AW
)

+
T
DT
+
2
*
T
ACK
)
.


#### 4.8.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(31)
T
req
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
.
And as in BoX-MAC-1, since data transmission is started only when ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(32)
T
BOX-MAC-2
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
ACK
+
T
DT
)
.


### 4.9. MX-MAC

MX-MAC is one of the packet-based LPL protocols and aims to reduce additional handshakes to trigger the receiver. Each MX-MAC device performs PFS, and a sender transmits data after waiting forT
DP and then switches to RX to listen for ACK for T
AW, as shown in Figure 9.Figure 9
MX-MAC.


#### 4.9.1. Periodic Report

The report time of an MX-MAC device is as follows:(33)
T
resp
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(34)
T
MX-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


#### 4.9.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(35)
T
req
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(36)
T
MX-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


### 4.10. A-MAC

A-MAC is one of the receiver-initiated LPL protocols, like RI-MAC. However, it enhances data reliability by adding early ACK transmission before data transmission. A sender goes into RX to wait and listen for a beacon from the receiver. Upon reception of the corresponding beacon, the sender transmits an early ACK to notify the receiver that data transmission follows, as shown in Figure10.Figure 10
A-MAC.


#### 4.10.1. Periodic Report

The report time of an MX-MAC device is as follows:(37)
T
resp
=
T
ACK
+
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(38)
T
A-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


#### 4.10.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(39)
T
req
=
T
ACK
+
T
DT
+
2
*
T
BS
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(40)
T
A-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


## 4.1. B-MAC

B-MAC is a representative LPL protocol utilizing a preamble for the receiver trigger. As shown in Figure1, each device repeats a short time wake-up for T
PS to detect the preamble transmission and then sleeps for T
s, per T
DC. A sender that wants to send data first transmits a long preamble for T
P to trigger the receiver that is performing periodic preamble sensing (PPS) before data transmission. Each preamble transmission can be detected by all devices within communication range of a sender, and all nodes that detect the preamble transmission, as well as the intended receiver, have to remain active for T
L, until the preamble transmission ends.Figure 1
B-MAC.


### 4.1.1. Periodic Report

Since each device should send its data to the concentrator on the predetermined schedule, the report time of each device is as follows:(1)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(2)
T
B-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


### 4.1.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(3)
T
req
=
T
B
+
T
P
+
T
DT
.
In particular, since B-MAC is capable of triggering all nodes with a single preamble transmission, all the devices can listen to the request message following the preamble. Therefore, the total aggregation time of n nodes per request is
(4)
T
B-MAC
(
R
)
=
T
req
+
n
*
T
resp
=
T
B
+
T
P
+
T
DT
+
n
*
(
T
B
+
T
DC
+
T
DT
+
T
ACK
)
.


## 4.1.1. Periodic Report

Since each device should send its data to the concentrator on the predetermined schedule, the report time of each device is as follows:(1)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(2)
T
B-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


## 4.1.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(3)
T
req
=
T
B
+
T
P
+
T
DT
.
In particular, since B-MAC is capable of triggering all nodes with a single preamble transmission, all the devices can listen to the request message following the preamble. Therefore, the total aggregation time of n nodes per request is
(4)
T
B-MAC
(
R
)
=
T
req
+
n
*
T
resp
=
T
B
+
T
P
+
T
DT
+
n
*
(
T
B
+
T
DC
+
T
DT
+
T
ACK
)
.


## 4.2. WISE-MAC

Unlike B-MAC, which transmits a long preamble, WISE-MAC aims to save more energy by transmitting a shorter preamble. To achieve this, each sender manages a schedule table in which all its neighbors’ PPS schedules are stored. Therefore, if a sender does not know the PPS schedule of a receiver, the sender must transmit a long preamble, as in B-MAC, but otherwise, the sender can transmit a minimum preamble forT
MP to trigger the receiver, as shown in Figure 2.Figure 2
WISE-MAC.


### 4.2.1. Periodic Report

The report time of a WISE-MAC device is calculated as follows:(5)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(6)
T
WISE-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


### 4.2.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is as follows:(7)
T
req
=
T
B
+
T
P
+
T
DT
.
And, like B-MAC, the WISE-MAC sender can trigger all devices with a single long preamble, so the total aggregation time of n nodes per request is
(8)
T
WISE-MAC
(
R
)
=

T
req
+
n
*
T
resp
=

T
B
+
T
P
+
T
DT
+
n
*

(

T
B
+
T
DC
+
T
DT
+
T
ACK

)
.


## 4.2.1. Periodic Report

The report time of a WISE-MAC device is calculated as follows:(5)
T
resp
=
T
B
+
T
P
+
T
DT
+
T
ACK
.
Therefore, the total report time of n nodes is
(6)
T
WISE-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
P
+
T
DT
+
T
ACK
)
.


## 4.2.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is as follows:(7)
T
req
=
T
B
+
T
P
+
T
DT
.
And, like B-MAC, the WISE-MAC sender can trigger all devices with a single long preamble, so the total aggregation time of n nodes per request is
(8)
T
WISE-MAC
(
R
)
=

T
req
+
n
*
T
resp
=

T
B
+
T
P
+
T
DT
+
n
*

(

T
B
+
T
DC
+
T
DT
+
T
ACK

)
.


## 4.3. X-MAC

As shown in Figure3, X-MAC utilizes an early acknowledgment (ACK) and short preamble to reduce energy waste from transmitting a long preamble, as in B-MAC and WISE-MAC in the worst case scenario. In addition, the short preamble represents a destination ID, and a gap, T
AW, between short preambles is used to receive the ACK of the receiver.Figure 3
X-MAC.


### 4.3.1. Periodic Report

The report time of an X-MAC device is as follows:(9)
T
resp
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(10)
T
X-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


### 4.3.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(11)
T
req
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
.
And, unlike B-MAC and WISE-MAC, X-MAC cannot trigger all devices with a single preamble transmission. Therefore, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(12)
T
X-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


## 4.3.1. Periodic Report

The report time of an X-MAC device is as follows:(9)
T
resp
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(10)
T
X-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


## 4.3.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(11)
T
req
=
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
.
And, unlike B-MAC and WISE-MAC, X-MAC cannot trigger all devices with a single preamble transmission. Therefore, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(12)
T
X-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
MP
+
T
AW
)
+
T
DT
+
T
ACK
)
.


## 4.4. SpeckMAC-B

Instead of a preamble transmission, SpeckMAC-B transmits consecutive wake-up packets to trigger devices performing periodic wake-up-signal sensing (PWS), as shown in Figure4. A wake-up packet contains a destination ID and a time stamp, which represents data packet transmission time information. Therefore, a device that listens to a wake-up packet during PWS goes to sleep until the beginning of data transmission wakes up and then receives data from the sender. Devices that listen to a wake-up packet but that are not the intended receiver go to sleep and continue to perform PWS.Figure 4
SpeckMAC-B.


### 4.4.1. Periodic Report

The report time of a SpeckMAC-B device is as follows:(13)
T
resp
=
T
B
+
m
*
T
WP
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(14)
T
SPECK-MAC-B
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


### 4.4.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(15)
T
req
=
T
B
+
m
*
T
WP
+
T
DT
.
And, like B-MAC or WISE-MAC, a single request packet can trigger all devices, so the total aggregation time of n nodes per request is
(16)
T
SPECK-MAC-B
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


## 4.4.1. Periodic Report

The report time of a SpeckMAC-B device is as follows:(13)
T
resp
=
T
B
+
m
*
T
WP
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(14)
T
SPECK-MAC-B
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


## 4.4.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(15)
T
req
=
T
B
+
m
*
T
WP
+
T
DT
.
And, like B-MAC or WISE-MAC, a single request packet can trigger all devices, so the total aggregation time of n nodes per request is
(16)
T
SPECK-MAC-B
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
m
*
T
WP
+
T
DT
)
.


## 4.5. SpeckMAC-D

Instead of the wake-up packet transmission used in SpeckMAC-B, SpeckMAC-D enables fast data reception by utilizing consecutive data packets. Each SpeckMAC-D device performs periodic frame sensing (PFS) forT
FS to receive a data frame, as shown in Figure 5.Figure 5
SpeckMAC-D.


### 4.5.1. Periodic Report

The report time of a SpeckMAC-D device is as follows:(17)
T
resp
=
T
B
+
T
DP
*
m
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(18)
T
SPECK-MAC-D
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
DP
*
m
)
.


### 4.5.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(19)
T
req
=
T
B
+
T
DP
*
m
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(20)
T
SPECK-MAC-D
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
T
DP
*
m
)
.


## 4.5.1. Periodic Report

The report time of a SpeckMAC-D device is as follows:(17)
T
resp
=
T
B
+
T
DP
*
m
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(18)
T
SPECK-MAC-D
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
T
DP
*
m
)
.


## 4.5.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(19)
T
req
=
T
B
+
T
DP
*
m
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(20)
T
SPECK-MAC-D
(
R
)
=
T
req
+
n
*
T
resp
=
(
n
+
1
)
*
T
req
=
(
n
+
1
)
*
(
T
B
+
T
DP
*
m
)
.


## 4.6. RI-MAC

RI-MAC is a representative receiver-initiated LPL protocol. Each RI-MAC device basically performs periodic beacon sending (PBS). A sender first switches to reception (RX) mode and waits to receive the beacon of a corresponding receiver. As soon as a corresponding beacon is received, the sender transmits data and then goes back to PBS. The receiver of the data acknowledges a beacon, as shown in Figure6.Figure 6
RI-MAC.


### 4.6.1. Periodic Report

The report time of an RI-MAC device is as follows:(21)
T
resp
=
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(22)
T
RI-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
DT
+
2
*
T
BS
)
.


### 4.6.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(23)
T
req
=
T
DT
+
2
*
T
BS
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(24)
T
RI-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
DT
+
2
*
T
BS
)
.


## 4.6.1. Periodic Report

The report time of an RI-MAC device is as follows:(21)
T
resp
=
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(22)
T
RI-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
DT
+
2
*
T
BS
)
.


## 4.6.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(23)
T
req
=
T
DT
+
2
*
T
BS
.
And T
req is equal to T
resp. So the total aggregation time of n nodes per request is
(24)
T
RI-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
DT
+
2
*
T
BS
)
.


## 4.7. BoX-MAC-1

As shown in Figure7, BoX-MAC-1 is one of the packet-based LPL protocols, and T
AW (to wait for ACK of the receiver) is followed by consecutive wake-up packets. Then, on reception of the ACK, the data are transmitted.Figure 7
BoX-MAC-1.


### 4.7.1. Periodic Report

The report time of a BoX-MAC-1 device is as follows:(25)
T
resp
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(26)
T
BOX-MAC-1
(
P
)

=

n
*
T
resp
=

n
*

(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT

)

.


### 4.7.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(27)
T
req
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
.
And since data transmission is started only when an ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is as follows:
(28)
T
BOX-MAC-1
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
)
.


## 4.7.1. Periodic Report

The report time of a BoX-MAC-1 device is as follows:(25)
T
resp
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(26)
T
BOX-MAC-1
(
P
)

=

n
*
T
resp
=

n
*

(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT

)

.


## 4.7.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(27)
T
req
=
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
.
And since data transmission is started only when an ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is as follows:
(28)
T
BOX-MAC-1
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
T
WP
+
T
ACK
+
T
DT
)
.


## 4.8. BoX-MAC-2

BoX-MAC-2 is one of the wake-up, packet-based LPL protocols. However, unlike BoX-MAC-1 or SpeckMAC-B utilizing consecutive wake-packet transmissions, a sender waits for ACK from the receiver forT
AW, per wake-up transmission, as shown in Figure 8. Therefore, a sender repeats wake-up packet transmission and RX for ACK until receiving the ACK.Figure 8
BOX-MAC-2.


### 4.8.1. Periodic Report

The report time of a BoX-MAC-2 device is as follows:(29)
T
resp
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(30)
T
BOX-MAC-2
(
P
)
=
n
*
T
resp
=
n
*

(
T
B
+
m
*

(
T
WP
+
T
AW
)

+
T
DT
+
2
*
T
ACK
)
.


### 4.8.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(31)
T
req
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
.
And as in BoX-MAC-1, since data transmission is started only when ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(32)
T
BOX-MAC-2
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
ACK
+
T
DT
)
.


## 4.8.1. Periodic Report

The report time of a BoX-MAC-2 device is as follows:(29)
T
resp
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(30)
T
BOX-MAC-2
(
P
)
=
n
*
T
resp
=
n
*

(
T
B
+
m
*

(
T
WP
+
T
AW
)

+
T
DT
+
2
*
T
ACK
)
.


## 4.8.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(31)
T
req
=
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
DT
+
2
*
T
ACK
.
And as in BoX-MAC-1, since data transmission is started only when ACK is received, the request of the concentrator must be transmitted as many times as the number of devices. So the total aggregation time of n nodes per request is
(32)
T
BOX-MAC-2
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
WP
+
T
AW
)
+
T
ACK
+
T
DT
)
.


## 4.9. MX-MAC

MX-MAC is one of the packet-based LPL protocols and aims to reduce additional handshakes to trigger the receiver. Each MX-MAC device performs PFS, and a sender transmits data after waiting forT
DP and then switches to RX to listen for ACK for T
AW, as shown in Figure 9.Figure 9
MX-MAC.


### 4.9.1. Periodic Report

The report time of an MX-MAC device is as follows:(33)
T
resp
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(34)
T
MX-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


### 4.9.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(35)
T
req
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(36)
T
MX-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


## 4.9.1. Periodic Report

The report time of an MX-MAC device is as follows:(33)
T
resp
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
,
where m is a maximum time to trigger the receiver and m
≤
T
DC.Therefore, the total report time ofn nodes is
(34)
T
MX-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


## 4.9.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(35)
T
req
=
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(36)
T
MX-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
B
+
m
*
(
T
DP
+
T
AW
)
+
T
ACK
)
.


## 4.10. A-MAC

A-MAC is one of the receiver-initiated LPL protocols, like RI-MAC. However, it enhances data reliability by adding early ACK transmission before data transmission. A sender goes into RX to wait and listen for a beacon from the receiver. Upon reception of the corresponding beacon, the sender transmits an early ACK to notify the receiver that data transmission follows, as shown in Figure10.Figure 10
A-MAC.


### 4.10.1. Periodic Report

The report time of an MX-MAC device is as follows:(37)
T
resp
=
T
ACK
+
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(38)
T
A-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


### 4.10.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(39)
T
req
=
T
ACK
+
T
DT
+
2
*
T
BS
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(40)
T
A-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


## 4.10.1. Periodic Report

The report time of an MX-MAC device is as follows:(37)
T
resp
=
T
ACK
+
T
DT
+
2
*
T
BS
.
Therefore, the total report time of n nodes is
(38)
T
A-MAC
(
P
)
=
n
*
T
resp
=
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


## 4.10.2. Request-Oriented

The required time for a concentrator to transmit its request to devices is(39)
T
req
=
T
ACK
+
T
DT
+
2
*
T
BS
.
T
req is equal to T
resp, and each request is paired with each response. So the total aggregation time of n nodes per request is
(40)
T
A-MAC
(
R
)
=
n
*
(
T
req
+
T
resp
)
=
2
*
n
*
T
req
=
2
*
n
*
(
T
ACK
+
T
DT
+
2
*
T
BS
)
.


## 5. Summary and Concluding Remarks

Based on the taxonomy presented in Section2 and the numerical analysis presented in Section 4, Table 3 presents a summary of the taxonomy and evaluation results regarding data aggregation time and energy consumption in terms of M2M communication models. In addition, protocol complexity is evaluated in terms of time synchronization requirements, memory usage, and ability to be implemented with an off-the-shelf RF modem and MCU.Table 3
Summary of taxonomy and evaluations.
Protocol
Wake-up
Initiation
Adaptivity
Schedule
Data aggregation time
Energy consumption
Protocol complexity
Preamble
Packet
Receiver
Source
Adaptive
Deterministic
Scheduled
Nonschedule
Periodic report
Request-oriented
Concentrator
Device
Network
B-MAC
√
√
√
√
○
○
●
●
●
○
WISE-MAC
√
√
√
√
◐
●
●
●
●
◐
X-MAC
√
√
√
√
◐
◑
●
●
●
●
SPECK-MAC(B)
√
√
√
√
○
◑
◑
◑
◑
◐
SPECK-MAC(D)
√
√
√
√
◑
◐
○
◑
○
○
RI-MAC
√
√
√
√
◐
○
◐
◐
◐
○
BOX-MAC(1)
√
√
√
√
○
◑
○
○
○
○
BOX-MAC(2)
√
√
√
√
◑
○
○
○
○
◑
MX-MAC
√
√
√
√
●
◐
◑
○
○
◐
A-MAC
√
√
√
√
◑
○
◐
◐
◐
○
●: A◐: B◑: C○: D.First, in terms of data aggregation time, without regarding wake-up source type, while adaptive and schedule-based protocols such as WISE-MAC and MX-MAC show fast data aggregation time, preamble-based or receiver-initiated protocols like B-MAC, RI-MAC, and A-MAC present long aggregation times. This is because adaptive LPL protocols are capable of coping with a receiver’s reaction through feedback during wake-up duration, compared with deterministic protocols utilizing fixed-size wake-up duration without regard to the receiver’s reaction.In terms of energy efficiency, while preamble-based protocols, such as B-MAC, WISE-MAC, and X-MAC present superior energy efficiency, data packet-based LPL protocols like BoX-MAC and MX-MAC present high energy consumption. Since preamble detection duration is considerably shorter than the data reception duration, the preamble-based protocols can operate with a very short duty cycle.In terms of protocol complexity, deterministic or receiver-initiated protocols have relatively low complexity, whereas adaptive and schedule-based protocols, such as WISE-MAC, SpeckMAC-B, and MX-MAC, have high complexity because they require tight time synchronization and management for neighbors’ PPS times. In addition, X-MAC (which transmits a short preamble in which ID information is contained) is not possible to implement with an off-the-shelf RF modem.Lastly, we expect the summarized taxonomy will provide a useful guideline for understanding the specific features of LPL protocols and for designing a new M2M network.



---

*Source: 138571-2014-07-08.xml*