Application Layer Coding for IoT: Benefits, Limitations, and Implementation Aspects

One of the key technologies for future Internet of things (IoT)/machine-to-machine systems is low-power wide area networks, which are designed to support a massive number of low-end devices, often in the unlicensed shared spectrum using random access protocols. However, these usually operate without centralized control and since automatic repeat-request and acknowledgment mechanisms are not very effective due to the strict duty cycles limits and high interference in the shared bands, many packets are lost from collisions. In this paper, we analyze a recently proposed application layer coding scheme introduced in [1], which aims to recover lost packets by introducing redundancy in the form of a fountain code. We show how latency and decoding complexity is affected by the packet loss rate but also prove that there is a limit to what can be achieved by introducing more redundancy. The analysis is backed up by simulation results.

[1]  Mahesh Sooriyabandara,et al.  Does Bidirectional Traffic Do More Harm Than Good in LoRaWAN Based LPWA Networks? , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[2]  Thomas Watteyne,et al.  Understanding the Limits of LoRaWAN , 2016, IEEE Communications Magazine.

[3]  Orestis Georgiou,et al.  Low Power Wide Area Network Analysis: Can LoRa Scale? , 2016, IEEE Wireless Communications Letters.

[4]  Marek Neruda,et al.  The issue of LPWAN technology coexistence in IoT environment , 2016, 2016 17th International Conference on Mechatronics - Mechatronika (ME).

[5]  Evgeny Khorov,et al.  On the Limits of LoRaWAN Channel Access , 2016, 2016 International Conference on Engineering and Telecommunication (EnT).

[6]  Ian F. Blake,et al.  Windowed Erasure Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[7]  Jianfei Cai,et al.  LT-W: Improving LT Decoding With Wiedemann Solver , 2013, IEEE Transactions on Information Theory.

[8]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[9]  Douglas H. Wiedemann Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[10]  Andrey Bogdanov,et al.  A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2) , 2006, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[11]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[12]  P. J. Marcelis,et al.  DaRe: Data Recovery through Application Layer Coding for LoRaWAN , 2017, 2017 IEEE/ACM Second International Conference on Internet-of-Things Design and Implementation (IoTDI).