摘要

To solve the data storage reliability problem of unattended wireless sensor networks (UWSN) which is made of n unreliable nodes (k of them are data nodes used to produce source data packets), a new kind of distributed storage algorithm based on random walk was proposed. According to the proposed algorithm, k source data packets were transmitted to every node in the network based on random walk, and every node received a number of source data packets with the given probability and stored the XOR result of them as a stored data packet. The simulation results show that after the storage process is completed, even with some stored data packets missing, the data collector node can successfully recover the k source data packets from any survival k+Ε, Ε≥8 stored data packets. Compared with LT codes based method, this method reduced network's communication cost by about 61% and the Sink node's query cost by about 40%.

全文