Reliable IoT Storage: Minimizing Bandwidth Use in Storage Without Newcomer Nodes
Xiaobo Zhao, Daniel E. Lucani, Xiaohong Shen, Haiyan Wang

TL;DR
This paper develops optimal policies for bandwidth and storage in IoT distributed storage systems where nodes cannot be replaced, demonstrating significant savings in bandwidth and storage compared to suboptimal methods.
Contribution
It introduces an information flow model for IoT storage, deriving optimal policies that minimize bandwidth and storage without relying on newcomer nodes.
Findings
Up to 10.3% bandwidth savings in a 10-node system.
Up to 44% storage savings compared to suboptimal approaches.
Provides a framework for efficient IoT data storage without node replacement.
Abstract
This letter characterizes the optimal policies for bandwidth use and storage for the problem of distributed storage in Internet of Things (IoT) scenarios, where lost nodes cannot be replaced by new nodes as is typically assumed in Data Center and Cloud scenarios. We develop an information flow model that captures the overall process of data transmission between IoT devices, from the initial preparation stage (generating redundancy from the original data) to the different repair stages with fewer and fewer devices. Our numerical results show that in a system with 10 nodes, the proposed optimal scheme can save as much as 10.3% of bandwidth use, and as much as 44% storage use with respect to the closest suboptimal approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT and Edge/Fog Computing · Optimization and Search Problems · Cloud Computing and Resource Management
