Design of Binary Erasure Code With Triple Simultaneous Objectives for Distributed Edge Caching in Industrial Internet of Things Networks

Abstract

For one moving Internet of Things (IoT) collector to download files from nearby industrial IoT devices, storing network coded files into multiple IoT devices can achieve good reliability performance if the following $(n, k)$ erasure property (EP) is fulfilled: $k$ source packets are encoded into $n$ packets, and $k$ packets chosen from these $n$ packets in an arbitrary manner can reconstruct all the source packets. Besides, low decoding complexity is desired for time-sensitive applications and energy-limited moving IoT collectors, and binary zigzag decoding (BZD) achieves significantly low decoding complexity. The objective of previous EP-BZD designs is unilateral, which limits its application scenarios. In this article, a novel EP-BZD code is designed, which achieves good tradeoff among largest storage room overhead (SRO), SRO variance, and wide range of $(n, k)$ . To implement such a code, the source packets are shifted by several bits, respectively, and then Xored together. The numbers of bits shifted are represented by a matrix, which is obtained from a specially constructed triangle by taking a certain maximal submatrix. The triangle is obtained by a series of steps, including the construction of base vector, parallelogram, trapezoid, etc. The proof that the proposed code possesses EP and BZD simultaneously is also provided. A series of comparisons verify that the proposed code achieves significantly better tradeoff among triple objectives than existing EP-BZD codes.