摘要
针对无人值守传感器网络的数据存储可靠性问题,提出一种实现简单、性能高效的分布式存储算法。算法采用定向随机游走规则,将网络中的k个源数据包传递到网络中所有的n个节点,网络中的每个节点按一定的概率接收一个新到达的源数据包并将其异或到之前存储的存储数据包中。数值实验表明:存储过程完成之后,即使有部分传感器节点损坏,Sink节点只要收集到任意k+ε,ε≥8个存储数据包,就能计算出原来的k个源数据包;与相关文献提出的基于LT码的方法相比,本算法节省存储过程中各传感器节点约61%的通信成本,同时降低Sink节点约40%的访问成本,具有较好的应用潜质。
To solve the data storage reliability problem of unattended wireless sensor networks （UWSN） which is made of n unreliable nodes （κ 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, κ 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 κ＋ε,ε≥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%.
出处
《中南大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2013年第12期4894-4902,共9页
Journal of Central South University:Science and Technology
基金
国家重点基础研究发展计划("973"计划)项目(2011CB302402)
国家高技术研究发展计划("863"计划)项目(2008AA01Z402)
关键词
无人值守传感器网络
数据存储
分布式存储算法
随机游走
unattended wireless sensor networks
data storage
distributed storage algorithm
random walk
