检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马骋娉 唐亮[1] 卢云波[3] 俞凯[1] 卜智勇[1]
机构地区:[1]中国科学院上海微系统与信息技术研究所宽带无线技术实验室,上海200050 [2]中国科学院大学,北京100039 [3]中国科学技术大学,合肥230000
出 处:《计算机应用研究》2014年第6期1804-1807,1815,共5页Application Research of Computers
基 金:中国科学院NICT先导专项基金资助项目(XDA06010304);上海市科学技术委员会资助项目(12PJ1410300);新一代宽带无线移动通信网重大专项资助项目(2011ZX03001-007-03)
摘 要:在认知无线电多节点联合频谱感知中,当感知节点中存在恶意用户发起频谱感知数据窜改(spectrum sensing data falsification,SSDF)攻击时,联合频谱感知的性能将受到严重影响。针对上述问题,研究并建立一种具有潜伏期的攻击模型。该模型在信誉值偏低时将停止攻击并累积信誉值,并在此基础上提出基于信誉机制的加权序贯检测(weighted sequential probability ratio test,WSPRT)算法,在计算权值时,综合考虑单节点表现的可信度和稳定度。仿真比较了传统检测算法与该算法在不同攻击模式下的关键性能。仿真结果表明,与现有算法相比,该算法检测性能提升,适用于有大量恶意节点存在的环境,并可以有效抵御更加灵活的SSDF攻击。In cognitive radio cooperative spectrum sensing,when malicious nodes exist,by sending wrong data to the fusion center,the performance of cooperative spectrum sensing will be impacted severely,this kind of attack is called SSDF.To solve this problem,this paper introduced a new smarter S-SSDF pattern,which could heal its reputation by performing like a normal node when its reputation was low.And it proposed a WSPRT algorithm based on reputation mechanism by considering both reliability and stability of the CR nodes when calculating the weights.In the simulation,it compared key indicators of traditional algorithm and the WSPRT algorithm.The simulation results show,the scheme proposed can adapt a large amount of malicious nodes,and has better robustness against SSDF attacks than traditional scheme.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3