We consider a distributed storage system where data storage nodes are equipped with energy harvesting transmitters. In particular, $F$ files are stored over $n$ storage nodes using regenerating codes. The main operations of the distributed storage system are serving the file requests of data collectors and repairing the content of storage nodes that fail or leave the system. Each operation has an associated energy expenditure. Under the intermittent energy arrival profile, we study the problem of maximizing the number of retrieved files given a deadline. Additionally, we consider the problem of minimizing the repair time of a failed node. Both optimization problems turn out to be equivalent to binary programs, for which we provide a tractable solution in two steps. First, we determine necessary and sufficient conditions on the harvested energy that ascertain the feasibility of retrieving (repairing) $M$ files in $T$ time slots. Using these conditions, we develop two algorithms that reduce the formulated optimization problems to a single feasibility problem. Then, we solve the feasibility problem using forward and backward algorithms. Additionally, we study the online setup where only causal knowledge of energy arrivals is available at the network nodes. We present numerical results on the short and long term performance of the system operations under the proposed algorithms.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering