计算机应用 ›› 2016, Vol. 36 ›› Issue (4): 945-951.DOI: 10.11772/j.issn.1001-9081.2016.04.0945

• 网络空间安全 • 上一篇    下一篇

基于跳数差的无线传感器网络安全定位方法

肖继清, 刘震宇, 肖江   

  1. 广东工业大学 信息工程学院, 广州 510006
  • 收稿日期:2015-09-07 修回日期:2015-10-20 出版日期:2016-04-10 发布日期:2016-04-08
  • 通讯作者: 肖继清
  • 作者简介:肖继清(1990-),男,江西樟树人,硕士研究生,主要研究方向:无线传感器网络安全、节点定位; 刘震宇(1976-),男,广东广州人,副教授,博士,主要研究方向:物联网、通信网安全、数字信号处理; 肖江(1987-),男,江西樟树人,硕士研究生,主要研究方向:无线传感器网络定位。
  • 基金资助:
    国家自然科学基金资助项目(61401106);广东省自然科学基金资助项目(S2013040013643);广东省实施技术标准战略专项(15ZK0016);广州市科学研究专项(2014J4100206);广东工业大学博士启动基金资助项目(113021)。

Hop difference based secure localization scheme for wireless sensor network

XIAO Jiqing, LIU Zhenyu, XIAO Jiang   

  1. School of Information Engineering, Guangdong University of Technology, Guangzhou Guangdong 510006, China
  • Received:2015-09-07 Revised:2015-10-20 Online:2016-04-10 Published:2016-04-08
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61401106), the Natural Science Foundation of Guangdong Province (S2013040013643), the Special Fund for the Implementation of Technical Standards in Guangdong Province (15ZK0016), the Guangzhou Scientific Research Fund (2014J4100206), the Startup Foundation for Doctors of Guangdong University of Technology (113021).

摘要: 针对无线传感器网络(WSN)中女巫攻击使距离矢量跳数(DV-HOP)等算法的定位结果产生偏差的问题,提出基于跳数差值的距离矢量跳数算法(HDDV-HOP)及其增强型算法(EHDDV-HOP)。首先,检测节点通过可控泛洪方式获取其他节点的邻居节点列表;其次,检测节点通过分析邻居节点列表检测虚假节点并建立白名单;最后,节点根据白名单选择性转发接收到的数据包并进行安全定位。两种算法的区别在于它们使用不同的检测方式,HDDV-HOP算法中检测节点分析邻居节点列表是否相同,而EHDDV-HOP算法中检测节点分析邻居节点列表交集与并集中元素个数之比。仿真结果表明,在信标节点比例达到20%和信号覆盖不对称时,与无女巫攻击时DV-HOP算法相比,HDDV-HOP定位误差相对大133.4%,EHDDV-HOP在相似度阈值合适时只高出7.3%,但都低于有女巫攻击时DV-HOP的定位误差。两种算法都能抵御女巫攻击,但EHDDV-HOP更优。

关键词: 无线传感器网络, 定位, 女巫攻击, 距离矢量跳数算法, 跳数差

Abstract: To deal with the problem that the localization result of Distance Vector-Hop (DV-HOP) may be rendered far from precision by the Sybil attack in Wireless Sensor Network (WSN), two hop difference based secure localization algorithms, namely HDDV-HOP and EHDDV-HOP, were proposed. Firstly, neighbor node lists of other nodes were got by the detection nodes through the controlled flooding mechanism. Secondly, the neighbor node lists were analyzed to detect fake nodes and white node lists were established. Finally, packets were selectively relayed based on white node lists and the unknown nodes were securely localized. The two algorithms differ in the techniques they used to detect fake nodes. In HDDV-HOP, whether or not neighbor node lists were the same was checked; while in EHDDV-HOP, the ratio of the amount of elements in the intersection of two neighbor node lists to that of elements in the union of the two was analyzed. The simulation results show that, compared with DV-HOP without the Sybil attack, when the ratio of beacon nodes to normal nodes reaches 20% and signal coverage is asymmetric,the localization error of HDDV-HOP is increased by 133.4%, while the error of EHDDV-HOP is increased by 7.3% when the similarity threshold is suitable, but the localization errors of the both algorithms are smaller than that of DV-HOP with the Sybil attack. Both of HDDV-HOP and EHDDV-HOP can defend against the Sybil attack, however EHDDV-HOP outperforms HDDV-HOP.

Key words: Wireless Sensor Network (WSN), localization, Sybil attack, Distance Vector-Hop (DV-HOP), hop difference

中图分类号: