CAJ | 학술논문

为解决无人值守传感器网络的数据存储可靠性问题,提出了一种具有低通信成本和低访问成本的分布式存储算法.算法采用步数为cn的并行定向随机游走机制,将网络中的k个源数据包按照一定的接收概率分散存储到网络中所有的n个节点,在每个节点形成一个存储数据包.理论分析和实验结果表明,基于该算法的存储过程完成之后,即使有部分传感器节点损坏,Sink 节点只要随机收集到k+ε,ε大于等于11个存储数据包,就能成功地计算出原来的k个源数据包.与具有代表性的基于LT码的算法相比,文中算法将存储每个源数据包的通信次数从约3nlnn降至约3n；将读取源数据包的节点访问次数从大于k+100降至约k+11.
위해결무인치수전감기망락적수거존저가고성문제,제출료일충구유저통신성본화저방문성본적분포식존저산법.산법채용보수위cn적병행정향수궤유주궤제,장망락중적k개원수거포안조일정적접수개솔분산존저도망락중소유적n개절점,재매개절점형성일개존저수거포.이론분석화실험결과표명,기우해산법적존저과정완성지후,즉사유부분전감기절점손배,Sink 절점지요수궤수집도k+ε,ε대우등우11개존저수거포,취능성공지계산출원래적k개원수거포.여구유대표성적기우LT마적산법상비,문중산법장존저매개원수거포적통신차수종약3nlnn강지약3n；장독취원수거포적절점방문차수종대우k+100강지약k+11.
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+ε,ε≥ 1 1 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.