检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚玉坤[1] 吕盼成 王宇[1] Yao Yukun;Lyu Pancheng;Wang Yu(Key Laboratory of Mobile Communications Technology of Chongqing,Chongqing University of Posts&Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065
出 处:《计算机应用研究》2018年第3期879-883,共5页Application Research of Computers
基 金:重庆市科委自然科学基金资助项目(cstc2012jj A40040);重庆市基础与前沿研究计划资助项目(cstc2015jcyj BX0085)
摘 要:针对中间节点对收到的所有编码包进行验证浪费网络资源和目的节点解码速率慢等问题进行研究,提出一种高效自适应的抗污染攻击网络编码传输方案-EANC(efficient and adaptive network coding transmission scheme against pollution attack)。EANC方案在数据分组编码阶段,利用按照网络编码的时间和空间特性构造的线性子空间签名方案准确地验证数据分组是否被污染从而有效控制污染数据分组的传播,并且能使中间节点调节验证步骤使之自适应于当前网络的污染程度,从而提高验证效率;在目的节点解码阶段,EANC方案利用目的节点重传恢复机制降低解码恢复时延。仿真结果表明,EANC方案能够减少子空间的签名长度并且降低目的节点解码恢复的平均时延。In order to solve the problem that intermediate node verifies all the encoded packets wasting the network resources and the slow decoding rate of the destination node,this paper proposed an efficient and adaptive network coding transmission scheme which called EANC.In data packet encoding stage,EANC scheme used network encoding time and space characteristics to structure linear subspace signature scheme,the scheme was accurate verification of data packets effectively and control the spread of pollution data packets,EANC scheme could make the middle nodes adjust detection step adapt to the current network pollution level and improved verification efficiency;at the destination node decoding stage,EANC scheme used the destination node packet loss retransmission mechanism to reduce the decoding delay.The simulation results show that the EANC scheme can reduce the time of the linear subspace signature and reduce the average time delay of the decoding and recovery of the destination node.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.122.147