Distributed storage algorithm with high performance for the UWSN

To solve the data storage reliability problem of the unattended wireless sensor network consisting of n sensor nodes, this paper proposes a new distributed storage algorithm based on parallel directional random walk with length cn. The proposed algorithm disseminates each of k source data packets in the network according to a given probability and formes a stored data packet in every node. Simulation results show that, after the storage process based on the proposed algorithm is completed, even if some stored data packets are missing, the data collector node can successfully recover the k source data packets from any survival k+ε, ε≥11 stored data packets. Compared with the LT codes based algorithm, the proposed algorithm reduces Sink node's query cost from k+100 to k+11 and reduces the network's communication cost from 3nlnn to 3n.