data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is split and distributed across the network. The graph-based connectivity model assuming independent erasures is given, and the capacity of such graph is computed. It is shown by an information-theoretic argument that multi-agent systems with unreliable connectivity can increase overall data storage reliability through cooperation.
distributed coding partition encoding erasure graph