无线传感器网络中的虫洞攻击和防御

无线传感器网络被誉为21世纪三大技术之一,其安全问题受到了越来越多的关注.文章首先介绍了无线传感器网络的特征,分析了安全问题的根源,然后详细介绍了无线传感器网络中虫洞攻击的原理和破坏性,提出引入简化的marsh信任模型,将邻居节点以往表现作为信任评估的经验来源,通过具体分析确定节点的位置关系,从而避免传感器网络中的虫洞攻击,最后指出了下一步研究的方向.     

4G下切3G定位算法策略研究

定位技术是无线传感器网络的支撑技术之一,针对无线传感器网络低成本、低能耗的要求,在继承DV-Hop定位算法优点的基础上,提出根据跳数来调节节点定位过程中的数据包接收量即LDV-Hop定位算法。传感器网络是计算机科学技术的一个新的研究领域,节点定位技术是传感器网络关键技术之一,传感器节点采集到的数据必须结合其位置信息才有意义,没有位置信息的数据几乎没有利用价值。     

无线传感器网络混合定位技术研究

在大规模复杂无线传感器网络中往往采用多种节点定位技术,在此结合现有无线传感器定位技术的现状,提出了一种混合定位技术以实现不同定位方法之间的互补。一方面利用RSSI定位弥补TDOA定位覆盖范围小的缺点;另一方面将测距信息引入到非测距定位DV—Hop算法中,用RSSI测距模型来提高DV-Hop算法中定位节点与信标节点间有效距离的精度。实验结果表明,该混合定位技术实现了TDOA,RSSI以及DV-HOP等定位技术的融合,有效地提高了复杂大规模无线传感器网络的节点定位精度。     

改进的DV-Hop无线传感网络节点定位算法

针对传感器部署密度大、分布不均匀,DV-Hop定位算法误差大等问题,提出了一种改进DV-Hop的无线传感器节点定位算法.首先采用DV-Hop算法对未知传感器节点位置进行计算,然后在采用遗传算法对DV-Hop定位的误差进行修正.仿真结果表明,改进DV-Hop算法提高了节点的定位精度,降低定位的误差,更能真实地反映传感器网络节点的实际分布情况.     

无线传感器网络中平均跳距修正的DV-Hop定位算法

针对基本无线传感器网络DV-Hop定位算法中,计算平均跳距时产生偏小误差的原因,提出了基于平均跳距修正的DV-Hop算法。改进算法中,引入信标节点个数比例、所有信标节点平均跳距的最大值以及所有信标节点平均跳距的平均值三个因子,并采用它们对平均跳距进行修正。通过Matlab软件对算法进行仿真验证,结果表明,改进后的DV-Hop算法有效降低了未知节点的定位误差,是一种可行的无线传感器网络节点定位解决方案。     

无线传感器网络抗欺骗的节点定位算法

节点位置定位是无线传感器网络应用的基本要求之一。针对无线传感器网络在开放性环境中应用容易遭受恶意节点欺骗攻击的问题,设计了一种抗欺骗的节点安全定位算法。算法将参考节点进行分组划分,并通过不同分组之间定位结果的比较,排除其中可能存在的恶意节点。在分组过程中,算法同时考虑了参考节点的优选问题,避免不良拓扑结构造成的定位偏差。仿真试验分析表明,算法能够有效地抵抗恶意节点的定位信息欺骗,大大提高了网络节点的定位精度。     

无线传感器网络中一种改进的DV-Hop定位算法研究

节点定位算法是无线传感器网络中的关键技术。针对DV-Hop定位算法定位精度不高的问题,提出一种改进的DV-Hop定位算法,通过减小全网平均跳距与真实的平均跳距的差距,重新修订不在网络区域的未知节点的坐标,提高平均跳距取值的准确性。仿真结果表明,在同等网络环境下,改进的DV-Hop定位算法的定位误差减小,能有效提高节点的定位精度。     

WSN中一种改进的DV-Hop节点定位算法

DV-Hop算法是一种经典的距离无关的无线传感器网络节点定位算法.详细分析了DV-Hop算法的定位过程,针对其局限性提出一种改进的DV-Hop算法.该改进算法在传统DV-Hop算法的第一阶段采用分簇策略以减小通信开销和分组冲突概率,并且用拟牛顿优化算法代替传统的最小二乘法计算节点位置,最后用Matlab7.0进行仿真....     

基于差分进化和人工蜂群混合策略的DV-Hop改进算法

为了解决无线传感器网络依靠DV-Hop算法定位过程中存在误差偏高的问题,将人工蜂群算法和差分进化算法融合,引入传统DV-Hop算法中,提出一种HDV-Hop算法。该算法在继承经典DV-Hop算法的前提下,获取锚节点的信息及平均跳距距离,在未知节点定位阶段引入混合策略的目标函数,优化搜索算法,提高定位精度,完成对未知节点的定位。仿真分析表明,该算法相比于DV-Hop算法和基于人工蜂群的定位算法能有效降低定位误差,提高稳定性。     

基于TDoA测距的传感器网络安全定位研究

针对基于TDoA测距的定位技术,分析了基本虫洞攻击与一贯虫洞攻击的特点,提出了一种利用无线多跳网络时空特性与测距数据一致性性质的攻击检测方法,并从理论上给出了此方法的成功检测攻击概率下限值.仿真结果表明提出的检测方法在各种网络参数下均优于已有的方法.     

On providing wormhole‐attack‐resistant localization using conflicting sets

Wormhole attack is a severe attack that can be easily mounted on a wide range of wireless networks without compromising any cryptographic entity or network node. In the wormhole attack, an attacker sniffs packets at one point in the network and tunnels them through the wormhole link to another point. Such kind of attack can deteriorate the localization procedure in wireless sensor networks. In this paper, we first analyze the impacts of the wormhole attack on the localization procedure. Then, we propose a secure localization scheme against the wormhole attacks called SLAW including three phases: wormhole attack detection, neighboring locators differentiation, and secure localization. The main idea of the SLAW is to build a so‐called conflicting set for each locator based on the abnormalities during the message exchanges, which can be used to differentiate the dubious locators to achieve secure localization. We first consider the simplified system model in which there is no packet loss and all the nodes have the same transmission range. We further consider the general system model where the packet loss exists and different types of nodes have different transmission radii. We conduct the simulations to illustrate the effectiveness of the proposed secure localization scheme and compare it with the existing schemes under different network parameters. Copyright © 2014 John Wiley & Sons, Ltd.     

DV-Hop定位算法在随机传感器网络中的应用研究

DV-Hop节点定位算法是一种重要的与距离无关的定位算法。在各向同性的密集网络中,DV-Hop可以得到比较合理的定位精度,然而在随机分布的网络中,节点定位误差较大。该文根据DV-Hop算法定位过程,在平均每跳距离估计、未知节点到各参考节点之间距离的计算和节点位置估计方法等3个方面进行了改进,分析和仿真了不同改进措施和综合改进的定位性能。结果表明,与有关方法相比,该文提出的改进措施可极大地提高节点定位精度。此外,该文改进措施不改变DV-Hop算法的定位过程,因此不需要增加网络通信量和额外硬件支持,是理想的与距离无关算法。     

无线传感网络中抵御虫洞攻击的基于统计估计的新型位置方案

Wormhole attack is one of the most devastating threats for range-free localization in wireless sensor networks. In this paper, we evaluate three statistical estimation methods with the same network model and geographic information obtained by the DV-Hop algorithm. We analyze the limits of Minimum Mean Square Estimate (MMSE), Least Median of Squares (LMS) and Enhanced greedy Attack-Resistant MMSE (EARMMSE) and propose an improved EARMMSE with the hop-distance relationship, named EARMMSE +. Simulation results illustrate the performance of MMSE, LMS and EARMMSE +with different anchor fraction, the length of wormhole link and the average local neighborhood and show that EARMMSE +outperforms MMSE and LMS.     

基于改进DV-Hop的无线传感器网络节点定位算法

针对DV-Hop距算法定位误差大的难题,提出一种改进离估计误差,并利用DV-Hop的传感器节点定位算法。首先修正知节点与信标节DV-Hop算法对节点进行定位;然后对进V-Hop算法定位误差行校正,最后在Matlab 2012平台上对算法性能进行仿真分析。仿真结果表明,本文算法可以较好地克服DV-Hop算法存在的不足,提高了传感器节点的定位精度。     

DV-Loc: a scalable localization protocol using Voronoi diagrams for wireless sensor networks [accepted from open call]

Localization systems have been identified as a key issue in the development and operation of wireless ssensor networks. DV-Hop, a wellknown localization algorithm, has recently been proposed for WSNs. Its basic idea relies on transforming the distance to all beacon nodes from hops to meters by using the computed average size of a hop. Despite its advantages, the DV-Hop algorithm has some limitations, mainly due to its high communication cost and energy consumption, which unfortunately limit its applicability to small or medium-sized sensor networks. The scalability issue of DV-Hop is a challenging problem that needs to be addressed. In this article we propose a novel localizationbased protocol and show how Voronoi diagrams can be used efficiently to scale a DV-Hop algorithm while maintaining and/or reducing further DV-Hop?s localization error. In our localization scheme, nodes can also be localized by their Voronoi cells. In order to evaluate the performance of our scheme, we present an extensive set of simulation experiments using ns-2. Our results clearly indicate that our proposed algorithm performs and scales better than DV-Hop.     

改进的DV-HOP无线传感器网络定位算法

为了提高无需测距的距离矢量（DV-Hop）定位算法对随机分布网络节点的定位精度。在分析了DV-Hop算法实现思想的基础上,提出了一种锚节点整体均匀分布优化方案,对该算法节点跳数进行优化。另一方面,在双通信半径算法基础上提出了一种三通信半径改进方法,使得两节点之间的跳数与距离的关系更接近线性规律,最后结合两种改进方法,进行整体仿真。仿真结果表明,锚节点均匀分布的三通信半径DV-Hop算法比双通信半径DV-Hop算法提高定位精度约为7%~8%。     

Topological comparison‐based wormhole detection for MANET

Wormhole attack is considered one of the most threatening security attacks for mobile ad hoc networks. In a wormhole attack, a tunnel is setup in advance between two colluders. The colluders record packets at one location and forward them through the tunnel to another location in the network. Depending on whether or not the colluders are participating in the network functions, the wormhole attack can be further divided into two categories: traditional wormhole attack and Byzantine wormhole attack. Existing researches focusing on detecting traditional wormhole attacks can be classified into three categories: one‐hop delay‐based approach, topological analysis‐based or special hardware/middleware‐based approaches. Unfortunately, they all have their own limitations. Most of the researches detecting Byzantine wormhole attack are not addressing the Byzantine wormhole attack directly. Instead, they focus on observing the consequence after a Byzantine wormhole attack, like packet dropping or modification. In this paper, we propose to detect both traditional and Byzantine wormhole attacks by detecting some topological anomalies introduced by wormhole tunnels. Simulation results show that our scheme can achieve both high wormhole attack detection rate and accuracy. Our scheme is also simple to implement. Copyright © 2012 John Wiley & Sons, Ltd.     

无线Mesh网络中的虫洞攻击检测研究

为了有效检测出无线mesh网络中的虫洞攻击,针对微软提出的支持多射频的链路质量源路由MR-LQSR(multi-radio link-quality souse routing)协议提出了一种虫洞攻击模型,并根据虫洞攻击及无线mesh网的特点,在基于端到端的虫洞攻击检测算法、投票机制、邻居检测机制和基于身份加密技术的基础上提出一种基于端到端的虫洞攻击检测机制.最后通过理论分析和实验证实了该机制能有效地抵御无线mesh网中的虫洞攻击和提高无线mesh网的安全性.     

基于身份的无线传感器网络定位认证方案

在介绍了无线传感器网络定位系统并剖析其各组成部分所面临的安全威胁的基础上,提出了一种基于身份的安全定位认证方案.该认证方案能够有效运用在定位系统的各个部分.安全性分析验证了方案能够有效阻止针对定位系统各种形式的网络攻击.对相关方案的性能分析和比较表明,所提出的方案在网络资源消耗、有效性和可实现方面都比较适合无线传感器网络.     

Agent‐based secure routing for underwater acoustic sensor networks

The underwater networks have severe security implications and are vulnerable to various types of attacks such as selective forwarding, wormhole, and sinkhole. Neighbor discovery, a fundamental requirement for routing is vulnerable to wormhole attack, which enables false neighbor acceptance, thereby degrading the routing performance. The proposed agent‐based secured routing scheme enhances the quality of service by discovering the wormhole resilient secure neighbors and route the information through the secure path. This scheme uses 4 agencies, namely, security, routing, underwater gateway, and vehicle, which are embedded with static and mobile agents. (1) Agents in security agency of a node discover secured neighbors by using the direction of arrival estimation and authentication, (2) agents in routing agency of a node establish secured routes from source to surface gateway, (3) agents in Underwater Gateway Agency communicate with Autonomous Underwater Vehicles (AUVs) and underwater nodes for key distribution, and (4) vehicle traversing agency in AUV coordinates with Underwater Gateway Agency for changing AUVs traversal to cover the isolated network area. The proposed scheme depicts the improved performance compared to basic neighbor discovery and channel aware routing protocol in terms of failure detection, energy consumption, and overheads.