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
关键词
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
相关论文
共 19 条
  • [1] Lowest-density MDS codes over extension alphabets
    Louidor, E
    Roth, RM
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 58 - 58
  • [2] Cyclic Lowest Density MDS Array Codes
    Cassuto, Yuval
    Bruck, Jehoshua
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (04) : 1721 - 1729
  • [3] T-Code: 3-Erasure Longest Lowest-Density MDS Codes
    Lin, Sheng
    Wang, Gang
    Stones, Douglas S.
    Liu, Xiaoguang
    Liu, Jing
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (02) : 289 - 296
  • [4] Lowest Density MDS Array Codes of Distance 3
    Huang, Zhijie
    Jiang, Hong
    Zhou, Ke
    Zhao, Yuhong
    Wang, Chong
    IEEE COMMUNICATIONS LETTERS, 2015, 19 (10) : 1670 - 1673
  • [5] Lowest Density MDS Array Codes on Incomplete Graphs
    Sandell, Magnus
    Tosato, Filippo
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 645 - 652
  • [6] On lowest density MDS codes
    Blaum, M
    Roth, RM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) : 46 - 59
  • [7] On lowest density MDS codes
    The IBM Research Div, San Jose, United States
    IEEE Trans Inf Theory, 1 (46-59):
  • [8] Efficient Lowest Density MDS Array Codes of Column Distance 4
    Huang, Zhijie
    Jiang, Hong
    Xiao, Nong
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 834 - 838
  • [9] On Cyclic Lowest Density MDS Array Codes Constructed Using Starters
    Li, Mingqiang
    Shu, Jiwu
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1315 - 1319
  • [10] Lowest density MDS codes over extension alphabets
    Louidor, Erez
    Roth, Ron M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (07) : 3186 - 3197