摘要
针对空间失效模式下的数据存储和恢复问题,设计了一种基于数据复制的存储和恢复算法.该算法为每个数据节点分配一个冗余节点,在数据节点失效时可以利用冗余节点中的数据来成功恢复数据,并且使整个过程消耗的代价最小.理论分析和仿真实验表明,同Greedy算法相比,在保证成功恢复的同时,该方法显著降低了网络的整体能耗,从而有效延长了网络的生存周期.
In accordance with data storage and recovery at a spatial failure pattern,a storage and recovery algorithm based on data replication was proposed.The algorithm assigns a redundant node for every data node,and it can recover data successfully from the redundant node when the data nodes fail and thus minimise the total cost.Compared with the Greedy algorithm,theoretical analysis and simulation results show that this method can not only reduce the total energy cost but also prolong the lifetime of networks for successful recovery.
基金
安徽省自然科学基金(090412041
11040606M138)资助
关键词
数据存储
节点失效
数据复制
数据恢复
data storage
node failure
data replication
data recovery
