Boost Your CotS IEEE 802.15.4 Network with Inter-Slot Interference Cancellation for Industrial IoT

by   H. Murat Gürsu, et al.

The current cellular standardization for 5G is working towards wireless advances to enable further productivity for industrial automation. However, this development will take several years. Meanwhile, the capabilities of the currently available standards should be pushed to their limits. To this end, in this work, we present results from the first inter-slot successive interference cancellation testbed using commercial off the shelf IEEE 802.15.4 sensors. Through our implementation, we have measured a throughput of 0.72 packets per slot which doubles the currently used contention-based access, Slotted ALOHA, with a limit of 0.36 packets per slot. The hardware effects of the boards, which degrade the successive interference cancellation performance from the theoretical limit of 1 packet per slot, are modeled and validated through measurements. We also propose a model that can be used to calculate the expected successive interference cancellation throughput with the specific hardware available in a factory. Furthermore, our proposed model should replace the perfect physical layer assumptions for researchers to design new MAC algorithms taking practical limitations into account.


page 1

page 2

page 3

page 4


Online Estimation and Adaptation for Random Access with Successive Interference Cancellation

This paper proposes an adaptive transmission algorithm for slotted rando...

Random NOMA With Cross-Slot Successive Interference Cancellation Packet Recovery

Conventional power-domain non-orthogonal multiple access (NOMA) relies o...

Exploiting In-Slot Micro-Synchronism for S-ALOHA

Proliferation of the urban Internet-of-Things (IoTs) for smart cities ha...

Polar-Slotted ALOHA over Slot Erasure Channels

In this paper, we design a new polar slotted ALOHA (PSA) protocol over t...

Breaking the Unit Throughput Barrier in Distributed Systems

A multi-level random power transmit strategy that is used in conjunction...

On d-ary tree algorithms with successive interference cancellation

In this paper, we outline the approach for the derivation of the length ...

Tree-Algorithms with Multi-Packet Reception and Successive Interference Cancellation

In this paper, we perform a thorough analysis of tree-algorithms with mu...

I Introduction

The integration of automation in factories is gaining momentum and is limited by the capabilities of the currently deployed wireless networks. This defines the Industrial Internet of Things (IIoT) challenge. 3GPP is addressing this challenge in the release 16 of 5G [3gpp_iiot]. The standardization introduced by 5G will cover use-cases that extend at least to the next 10 years. However, the products supporting the release 16 can reach the market earliest in late 2020, as the current functional freeze of standardization is scheduled for March of 2020 [3gpp_release]. Another challenge is the unknown price of these devices and the required time to market to reach a reasonable price for all business sizes.

This motivates us to investigate a solution improving the currently deployed networks for IIoT. IEEE 802.15.4 [TSCH] is one of the frequently available standards in factories thanks to its energy efficiency. The PHY layer is fixed in most of the devices as this is embedded in the radio chip but the MAC layer behavior is controlled through a protocol. Thus, a lot of work in IEEE 802.15.4 [wang2010dynamic] [6987334] is focusing on optimizing the MAC protocol that can be updated easily for the deployed sensors. A large group of researchers focus on the coordination of the periodical monitoring of sensors to optimize the use of the wireless medium. However, periodic monitoring is not fit for IIoT, as those devices are reacting to sporadic events. Random access, investigated as grant-free in 5G networks [R1-1808304], is a flexible solution for this problem. Random access may have varying resource efficiency. However, it has been shown that successive interference cancellation based random access algorithms can achieve a throughput matching that of the scheduled access without giving up the flexibility of random access [6325214]. Previous works on random access that consider low-latency and reliability constraints [murat_acdc] [polling_abbas] [stefanovic2017frameless] assume a perfect physical layer performance that does not represent the practical limitations.

I-a Related Work

The hardware effect should be considered to obtain practical limits, and this is investigated in terms of radio irregularity. In [zhou2006models], the main causes of radio irregularity are summarized as irregularities with antenna angle and battery power. A recent work [trenkamp2011wireless] demonstrates that sensors cannot reach the documented maximum transmission powers in their data-sheets. In another work [zamalloa2007analysis]

, the authors analyze hardware performance variance and calculate the packet reception rate without interference cancellation. These works neglected the impact of other hardware effects such as that of the oscillator on the SNR.

Successive interference cancellation (SIC) has attracted interest in terms of intra-slot interference cancellation (IaS-IC). An implementation of a receiver employing SIC for IEEE 802.15.4 for IaS-IC is introduced in [halperin2008taking]. The packet of the strongest user, in terms of signal power, in a collision is decoded and canceled from the same time-slot. Authors in [lv2011scheduling] implemented the IaS-IC for scheduling multiple packets to the same time-slot in IEEE 802.15.4. There have been many implementations of SIC that modify the physical layer such as [zigzag] and [mzig]. Such modifications are out of scope for us, as we intend for the improvement to work with standard-compliant IEEE 802.15.4 PHY layer.

Combining the hardware effects and the SIC is also investigated in the state of the art. A Signal to Interference plus Noise Ratio (SINR) model, based on residual interference power for imperfect SIC, is introduced in [andrews]

. The authors provide bounds on the transmission capacity for imperfect successive interference cancellation wherein a fraction of the interference power is left behind after cancellation. In our work, we decompose this model into specific errors related to channel estimation and phase estimation to provide insights on the limitation of the CoTS hardware, validated through measurements.

I-B Contribution

In our work, we deploy an inter-slot successive interference cancellation (IeS-IC) algorithm, that fulfills low-latency and reliability constraints with an IEEE 802.15.4 network. We measure the practical performance in terms of throughput in packets per slot and show that our implementation doubles the throughput of the commonly deployed Slotted ALOHA based network i.e., from to . We provide an analytical throughput model, using a detailed SINR evaluation, to extend our measurements to any scenario with different hardware characteristics. We validate our model with the measurements and discuss performance with different hardware. Consequently, our model provides insights for not only the state of the current devices but also any future hardware that is foreseen to use SIC.

I-C Organization

The rest of the work is organized as follows: Section II introduces the SINR model and extends it with the hardware effects. Section III introduces the MAC algorithm and the throughput model. The measurement setup is described and the results are evaluated in Sec. IV. Finally the contributions are summarized and future directions are described in Sec. V.

Ii PHY Model

In this section we introduce how the successive interference cancellation is implemented.

Ii-a Scenario

In this work a cell-based star topology using a time-division multiple access system is considered. The time is divided into time-slots and only a single frequency channel is used. Multiple users are attached to a central station. The users are not transmitting regularly. They are only reacting to events. The users can receive the broadcast downlink channel, but have to contend for the resources in the uplink channel. Thus, the uplink resources are allocated in a distributed manner, using a random access algorithm, guided by the downlink feedback of the central station. The throughput of the uplink resource usage is defined as number of packets transmitted per time-slot, abbreviated as packets per slot.

Considering a typical random access algorithm like Slotted ALOHA, as the load increases, the throughput decreases quickly. Thus Slotted ALOHA is unsuitable for traffic bursts. Therefore, our implementation uses successive interference cancellation, where users transmit multiple replicas of their packets in different time-slots. If multiple users transmit in the same time-slot then this is called a collision. If a replica of a packet involved in the collision is available in a different time-slot without interference, then the interference free packet is used to reduce the interference in the collision slot. However, the channel effects have to be recreated to properly cancel it from the collision slot. For this purpose, the distortions to the signal due to the channel as well as the hardware have to be estimated.

Ii-B Proposed SSINR Model

Mobility is not considered and the channel is assumed to be time-invariant and static. The wireless channel attenuates the signal with respect to objects and the distance. Multipath propagation is assumed to exist where the copies of the signal travelling in different paths interfere at the receiver causing inter-symbol interference (ISI).

Other than wireless effects we also investigate hardware effects such as phase noise by introducing a new parameter, .

Let us assume the interference-free received signal is


where, is the modulated signal, is the coefficient representing the effect of uncertainty coming from the transmitter hardware noise, is the channel gain and is the Additive White Gaussian Noise in the channel.

The channel estimation includes constant phase drift stemming from the hardware effects111The phase noise is considered separately and not included in the channel. However, the channel estimation depends on the hardware and is much worse when estimated in a collision slot. This error is defined as the mean channel estimation error and is represented as a constant , as introduced in [cheon2002effect].

For the sake of simplicity let us consider an example for user . The channel of the user is estimated to be but the realization is , with an error ,


Hence, the residual signal, when the re-created signal with the estimated channel is removed from the received signal, is,


The SINR in a collision slot is the signal power divided by the residual power caused by hardware noise that is , the residual power caused by channel estimation error and the noise power


For the case with multiple rounds of successive interference cancellation, the SIC-SINR (SSNIR) of the packet for the user when packets are cancelled is given by,


where is the set of all packets transmitted at the same time and represents the set of canceled packets including .

Ii-C Measurements for SSINR model

The model parameters are obtained by performing dedicated measurements for each Zolertia Z1 mote transmitting to a USRP B200-mini receiver. Channel gain is estimated at the receiver. The statistics of noise, , are collected from the portion of the received signal where no data packets are transmitted. The statistics of signal affected by the transmitter hardware noise, channel gain and channel AWGN, , for different users are obtained from the slots where the users’ packets do not face any interference. Since the noise is additive, knowing its mean and variance, the statistics of

are calculated treating them as the combination of 2 independent random variables with different means and variances. The signal

has a unit envelope. Therefore, removing the effect of the constant channel gain , the statistics of are obtained.

In our work, we adopt most of the PHY receiver chain of [halperin2008taking] and adapt it for inter-slot interference cancellation adding cross slot channel estimation with phase drift estimation. The phase drift of a packet at a particular time-slot can be determined by calculating the mean of the difference in phase between the ideal signal and the received signal over the length of the packet. The ideal signal is known from the interference-free replica of the packet.

Fig. 1: SIC-SINR model versus measurements showing validity of the selected parameters.

The validity of the SIC-SINR model and the selected parameters is illustrated in Fig. 1 where measurements are given with 95confidence intervals and compared to Eq. (3). The parameter is obtained for each device through dedicated measurements as mentioned in Section II-C. The typical values for the mean and variance of the parameter as observed in the measurements for a Zolertia Z1 mote are around 1 and 0.01, respectively. The value is set as representing the channel estimation error when and set as when .

Ii-D SNR to BER mapping

A channel model that represents the measurement setup [zheng2011link] exists in reality. We will use the Rician SNR to BER mapping function for QPSK as given in [simon1998unified],


We set

, fitting the measurements, representing the relative strength of line of sight signal compared to non line of sight signal. The function outputs the bit error rate that can be converted to packet error rate or the decoding probability

using the packet length in bits,


Iii MAC Model

Iii-a Query Tree Algorithm with SIC (SICQTA)

For the MAC algorithm, we focus on an instant-feedback based random access algorithm that is the successive interference cancellation query tree algorithm (SICQTA) [gursu2019hard]. This algorithm is one of two algorithms that have deterministic latency bounds along with the access codes introduced in [boyd2018interference].

In SICQTA, every device has a unique id composed of bits. This limits the total number of devices attached to the central station to . Users transmit packets after they are queried. Queries include a part of the address bits. The initial query is an empty query and all active users answer to the query. A single bit is appended to the query after each collision, starting from the left-most bit. As each device has a unique id, this guarantees that with collisions a query is the unique address of a device.


for tree=circle,draw,minimum size=0.5cm,l=1cm,s sep=1cm [A,B,C,D [A,B,edge label=node[midway,left,font=] [A,B,edge label=node[midway,left,font=] [A,edge label=node[midway,left,font=]] [B,dotted,edge label=node[midway,left,font=]] ] [,dotted,edge label=node[midway,left,font=] ] ] [C,D,dotted,edge label=node[midway,left,font=] [C,D,edge label=node[midway,left,font=] [C,edge label=node[midway,left,font=]] [D,dotted,edge label=node[midway,left,font=]] ] [,dotted,edge label=node[midway,left,font=] ] ]] ;

Fig. 2: SICQTA worst case with

A detailed example for the SICQTA is given in Fig. 2 for and , users A,B,C,D have addresses respectively. In the first slot, all the devices are queried and it is a collision. On the second and third slot, and are queried, respectively. Both are collisions. In the following slot, is queried and it is a success. is not queried, as the central station recovered the packet B from slot and . and are not queried and skipped. Thus, is queried, that results in a collision. Consequently, is queried and is a success. The gateway recovered D from slot and . Finally, the algorithm is terminated.

Iii-B User Activity Analysis

We are interested in the practical throughput performance of the complete system. Some of the throughput loss is caused by the MAC algorithm. Thus, we first introduce the MAC throughput analysis without the PHY considerations.

In our setting, the users have a bit address. Hence, there are users.

(a) Worst-case
(b) Best-case
Fig. 3: Possible tree structures for active user and maximum depth of the tree.

Consider the scenario that users have collided with the first query. Two possible ways in which this tree could split after this stage is as shown in Fig. 3. If a collision of two users happens multiple times, as in Fig. 2(a), two slots are wasted. The users are selecting slots uniformly. The probability of occurrence of the worst-case configuration given is , as two users have done the same selection twice and is for the best-case. The throughput is calculated as the number of slots used versus number of packets received, e.g, for the worst-case and for the best-case scenario. In this way the throughput of all scenarios can be calculated. Thus, not all loss comes from the physical layer but also due to lack of coordination in MAC.

The average MAC throughput is calculated by the formula,

where is the probability of occurrence of the scenario and is the throughput of that scenario. A scenario is the way a tree is formed as illustrated in Fig. 2 and Fig. 3.

Iii-C Scenario Resolution Probability

In this subsection we take PHY imperfections into consideration, i.e., we take decoding errors into account. The probability of resolution taking decoding errors into account for scenario , is a new parameter . The throughput can be calculated as,


The resolution probability is assumed 1 for MAC throughput.

The probability of resolution can be calculated as the joint probability distribution for successfully decoding all slots as in,


where is the list of all users that transmitted in slot for scenario . Slots in the frame can be depicted as where is the number of slots in a frame and is defined as an empty set.

is a user, whose packet can be decoded from set given that packets of all users in set are cancelled from . The depicts the SINR for packet of user in slot after the set is cancelled. And example of how sets are defined can be seen in Figures 2 and 3. In both examples contains only A, while contains A and B. The slots are ordered following the tree structure.

Idle slots are left out of the list as they have no effect on the resolution. However, if two sets are equal, it means that the same packets are transmitted on two different slots. Thus, a success is the decoding of either one of these slots. The probability of that can be calculated by checking the failure of either of the values. For instance, given a scenario where the initial slot is repeated times, Eq. (7) can be re-organized as,

Fig. 4: Experimental setup

The hidden assumption here is, the realization on two different time-slots is not exactly the same in terms of noise and if cancellation is not possible with one, it may be possible with the other slot. This modification demonstrates that repetitions for successive interference cancellation increase the reliability exponentially. This will be further evaluated in the results section.

Iv Measurements

Iv-a Experimental setup

A testbed of 5 Zolertia Z1 nodes and a USRP B200-mini receiver is set up as shown in Figure 4.

Four Z1 nodes, depicted in blue, act as the transmitters and each has a direct line of sight path to a fifth Z1 node, depicted in green, acting as the network coordinator and central station. All of the Z1 used are 5 years old representing a mid-life of an industrial sensor. The USRP, depicted in red, is set up to act as a sniffer. It has a direct line of sight path to the transmitters and receives all the packets. All nodes in the network communicate on the IEEE 802.15.4 channel 26 which is centered at 2480 MHz. A single slot is of duration ms and the firmware of the sensors is implemented with OpenWSN.

We are measuring a SICQTA scenario of active users with address size of as most inter-slot SIC algorithms result in scenarios where up to 4 users are cancelled. The users are set to transmit byte packets. We repeated this scenario for consecutive frames. The sniffed data222The measurement data and scripts are available at captured with the SDR is processed in MATLAB.

Iv-B Processing measurements

The raw data file sampled at 4 MHz is read into MATLAB and the beginning of a frame is detected by comparing the signal strength to a threshold by manually observing the interference and noise signal levels at the receiver.

Firstly, all time-slots with a single packet are decoded. The location of the replicas can be traced back thanks to the tree structure. Then the replicas are canceled from time-slots with collisions. After each SIC iteration, a canceled slot is decoded and the decoded packets are again canceled from other slots. A scenario is considered successful if all packets involved in the scenario are canceled. Following this, the measurement success probability is calculated.

Iv-C Evaluations

Scenario Measured Model
4 users 0.875 0.5837 0.6026
3 users 0.8344 0.6926 0.6465
2 users 0.7917 0.7273 0.7495
TABLE I: Comparison of theoretical and Practical throughputs
Scenario Meas. Model
2221 1 0.9997
221 0.98 0.9954
21 0.9 0.9324
3321 0.9 0.8757
3221 0.82 0.7498
321 0.74 0.7024
3311 0.98 0.9391
3121 0.9 0.9324
311 0.87 0.7532
Scenario Meas. Model
44211 0.84 0.8643
4321 0.59 0.5125
4311 0.56 0.5496
422121 0.88 0.9282
42121 0.81 0.8695
42211 0.7 0.7263
4211 0.64 0.6804
4111 0.66 0.7297
TABLE II: Resolution probability for the different scenarios of 2, 3 and 4 user collisions

The practical throughput for different number of active users in packets per slot are summarized in Tab. I through measurements and the model given with Eq. 7. In Tab. II we have detailed the throughput results in packets per slot for each scenario.

Firstly, the measurement results confirm that IeS-IC can be used to improve throughput for contention based access using the CotS IEEE 802.15.4 hardware with throughput reaching at least and up to . This doubles the maximum throughput of the commonly deployed Slotted Aloha scheme which is 0.368 [kleinrock1975packet]. In terms of latency, when the radio latency is at maximum ms representing 3 frames and on average ms. In terms of data-rate, using contention based access and a single channel, this translates to a reliable kbit/s. In case all 16 channels are used, this can be further boosted approximately to a reliable Mbit/s. The results are promising for industrial scenarios with sporadic activity and a delay constraint of ms.

Taking a deeper look at the results, the throughput is packets per slot, that is lower than the maximum MAC throughput of 1 packet per slot. The measurements, where is replaced with measured values, demonstrate that there is a further throughput loss due to PHY problems with 2 users. The results demonstrate that the MAC algorithm can be further optimized before PHY layer issues are resolved when users are considered.

As SICQTA performs better with more users e.g., , the throughput is lower than the maximum of 1 packet per slot. As demonstrated with the measurements, packets per slot is lost due to PHY failure. Higher throughput is only possible with excessive use of SIC. Thus, we see that the higher throughput we expect, the importance of PHY effects increases. The SSINR model becomes significantly important when we want to reach maximum throughput of 1 packet per slot.

Furthermore, the model shows a good match overall. Interference cancellation up to 4 users is quite common in most of the inter-slot SIC algorithms such as IRSA or Frameless ALOHA. The tree algorithms, due to their structure, enforce a higher order of cancellation. For all these algorithms, the perfect PHY assumption can be replaced with the model we provide here for realistic evaluations. Another approach is clearly the use of better hardware that can decrease the worst-case latency if no re-transmissions are needed.

Encouraged by the match of the model and the measurements we do a sweep analysis with the model. In Fig. 5 we have plotted MAC throughput varying the hardware noise variance. The results show that even with a really high channel gain and no estimation error, after , having outputs the same throughput as the collisions with more users have a increased decoding error probability. The results show that hardware effects pose a big limitation to implement inter-slot IC. In case new IEEE 802.15.4 hardware will be bought for SIC, the hardware noise variance can be evaluated to decide if it lies before the switch point as depicted in Fig. 5. In case the hardware noise variance of the device lies on the right hand side of the switch point, that hardware cannot benefit fully from SIC.

Fig. 5: Sweep analysis for the hardware noise variance vs throughout as calculated with Eq. 6.Two different set of system parameters, are evaluated as ideal and measured variables.

The effect of the channel gain is illustrated in Fig. 6 with a similar sweep analysis. The measured parameters reflect that after a channel gain of , the throughput does not increase due to estimation error and hardware noise. With ideal parameters the channel gain required to reach the MAC limit is around . This evaluation reflects the required transmission power, antenna selection and placement of the sensor to reach the required MAC throughput for a given hardware setting.

Fig. 6: Sweep analysis for channel gain vs throughput as calculated with Eq. 6.

V Conclusion

In this work, we have demonstrated a wireless communication solution for supporting industrial internet of things paradigm. To this extend, we have shown that CotS IEEE 802.15.4 chips, in a contention based access, can achieve a similar throughput compared to scheduled access, solving the problem of event-based access of sensors. This is achieved through using a successive interference cancellation MAC algorithm in the receiver that does inter-slot interference cancellation. To the best of our knowledge, it is the first experimental evaluation of inter-slot IC for IEEE 802.15.4, which is particularly challenging due to signal variations from slot to slot due to cheap hardware.

We introduced a practical SIC-SINR model that we have validated through experimental results in our testbed. This model can be used to design MAC algorithms that are aware of these limitations or to evaluate other SIC-MAC algorithms.

Finally, we have once more demonstrated through measurements that the hardware effects are limiting the high throughput promised by MAC algorithms. Further measurements should be extended to better hardware to conclude what the maximum achievable performance with SIC for CoTS IEEE 802.15.4 sensors is and how MAC algorithms can deal with this limitation.