Lowest-density MDS array codes for reliable Smart Meter networks

In this paper, we introduce a lowest-density maximum-distance separable MDS array code, which is applied to a Smart Meter network to introduce reliability. By treating the network as distributed storage with multiple sources, information can be exchanged between the nodes in the network allowing each node to store parity symbols relating to data from other nodes. A lowest-density MDS array code is then applied to make the network robust against outages, ensuring low overhead and data transfers. We show the minimum amount of overhead required to be able to recover from r node erasures in an n node network and explicitly design an optimal array code with lowest density. In contrast to existing codes, this one has no restrictions on the number of nodes or erasures it can correct. Furthermore, we consider incomplete networks where all nodes are not connected to each other. This limits the exchange of data for purposes of redundancy, and we derive conditions on the minimum node degree that allow lowest-density MDS codes to exist. We also present an explicit code design for incomplete networks that is capable of correcting two node failures. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  Jehoshua Bruck,et al.  Cyclic Lowest Density MDS Array Codes , 2009, IEEE Transactions on Information Theory.

[2]  Ronald Mao,et al.  Wireless Broadband Architecture Supporting Advanced Metering Infrastructure , 2011, 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring).

[3]  Mario Blaum,et al.  On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.

[4]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.

[5]  Francesco Benzi,et al.  Electricity Smart Meters Interfacing the Households , 2011, IEEE Transactions on Industrial Electronics.

[6]  Chentao Wu,et al.  H-Code: A Hybrid MDS Array Code to Optimize Partial Stripe Writes in RAID-6 , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[7]  Jehoshua Bruck,et al.  Low density MDS codes and factors of complete graphs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8]  Gang Wang,et al.  T-Code: 3-Erasure Longest Lowest-Density MDS Codes , 2010, IEEE Journal on Selected Areas in Communications.

[9]  Chentao Wu,et al.  HDP code: A Horizontal-Diagonal Parity Code to Optimize I/O load balancing in RAID-6 , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN).

[10]  Filippo Tosato,et al.  Irregular MDS Array Codes , 2014, IEEE Transactions on Information Theory.

[11]  Hong Jiang,et al.  P-Code: a new RAID-6 code with optimal properties , 2009, ICS '09.

[12]  Hong Jiang,et al.  A Comprehensive Study on RAID-6 Codes: Horizontal vs. Vertical , 2011, 2011 IEEE Sixth International Conference on Networking, Architecture, and Storage.

[13]  J. Magnus,et al.  The Commutation Matrix: Some Properties and Applications , 1979 .

[14]  Filippo Tosato,et al.  Lowest density MDS array codes on incomplete graphs , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[16]  Ron M. Roth,et al.  On generator matrices of MDS codes , 1985, IEEE Trans. Inf. Theory.

[17]  James S. Plank The RAID-6 Liberation Codes , 2008, FAST.

[18]  Alexander Vardy,et al.  MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[19]  Ron M. Roth,et al.  Lowest density MDS codes over extension alphabets , 2003, IEEE Transactions on Information Theory.

[20]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.