Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems

TL;DR

This paper introduces a novel algebraic space-time coding protocol for wireless distributed storage systems, enhancing reliability and decoding feasibility over fading channels while balancing diversity-multiplexing tradeoffs.

Contribution

It proposes a new protocol based on algebraic space-time codes that improves system reliability and decoding complexity in wireless storage networks.

Findings

Outperforms simple TDMA protocol in reliability.

Balances DMT and decoding complexity.

Shows feasibility of sphere decoding with few antennas.

Abstract

In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was recently pointed out that such codes are in general too complex to decode when the number of helper nodes is bigger than the number of antennas at the newcomer or data collector. In this paper, a novel protocol for wireless storage transmissions based on algebraic space-time codes is presented in order to improve the system reliability while enabling feasible decoding. The diversity-multiplexing gain tradeoff (DMT) of the system together with sphere-decodability even with low number of antennas are used as the main design criteria, thus naturally establishing a DMT-complexity tradeoff. It is shown that the proposed protocol outperforms the simple time-division multiple access (TDMA) protocol, while still falling behind the optimal DMT.