Lowest-density MDS array codes for reliable Smart Meter networks

被引:1
作者
Sandell, Magnus [1 ]
Tosato, Filippo [1 ]
机构
[1] Telecommun Res Lab Toshiba Res Europe, Bristol BS1 4ND, Avon, England
来源
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES | 2015年 / 26卷 / 11期
关键词
D O I
10.1002/ett.2925
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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 (c) 2015 John Wiley & Sons, Ltd.
引用
收藏
页码:1251 / 1264
页数:14
相关论文
共 22 条
[1]   Electricity Smart Meters Interfacing the Households [J].
Benzi, Francesco ;
Anglani, Norma ;
Bassi, Ezio ;
Frosini, Lucia .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2011, 58 (10) :4487-4494
[2]   EVENODD - AN EFFICIENT SCHEME FOR TOLERATING DOUBLE-DISK FAILURES IN RAID ARCHITECTURES [J].
BLAUM, M ;
BRADY, J ;
BRUCK, J ;
MENON, J .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (02) :192-202
[3]   On lowest density MDS codes [J].
Blaum, M ;
Roth, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) :46-59
[4]   MDS array codes with independent parity symbols [J].
Blaum, M ;
Bruck, J ;
Vardy, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :529-542
[5]   Cyclic Lowest Density MDS Array Codes [J].
Cassuto, Yuval ;
Bruck, Jehoshua .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (04) :1721-1729
[6]  
Jin C, 2011, P IEEE INT C NETW AR, P102
[7]  
Jin C, 2009, ICS'09: PROCEEDINGS OF THE 2009 ACM SIGARCH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, P360
[8]   T-Code: 3-Erasure Longest Lowest-Density MDS Codes [J].
Lin, Sheng ;
Wang, Gang ;
Stones, Douglas S. ;
Liu, Xiaoguang ;
Liu, Jing .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (02) :289-296
[9]   Lowest density MDS codes over extension alphabets [J].
Louidor, Erez ;
Roth, Ron M. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (07) :3186-3197
[10]  
MacWilliams F., 2006, THEORY ERROR CORRECT