无线传感器网络中基于闭合环包围的边界节点检测

由于无线传感器网络中可能会出现覆盖漏洞,导致网络无法提供高质量的数据,所以需要检测边界节点以准确找到覆盖漏洞进行修复。已有研究大多是通过传感器的坐标或者依据大量节点信息进行检测, 现提出算法通过检测每个节点的邻居节点是否能形成包围检测节点的闭合环来判别当前节点是否为边界节点。该算法使得节点能够仅基于小邻域的信息自主地决定它是否是边界节点,使其适用于节点分布不均匀的网络中。仿真实验验证了该算法在识别准确率、降低通信量等方面的有效性。     

一种低功耗无线传感器网络节点设计

无线传感网络节点功耗直接决定了无线网络的生存周期,为了降低节点能耗,在对多种微处理器芯片和射频芯片性能分析比较的基础上,选择了MSP430F2618处理器芯片和射频芯片CC2520射频芯片,采用微处理器与无线模块独立架构,设计了一种性能灵活无线网络节点;提出了微处理器、射频芯片在工作模式与多种低功耗模式之间切换,以及微处理器时钟的控制等节能策略,在此基础上设计了网络路由节点和端节点软件系统;实验证明:在发射功率为0 dBm,数据传输速率为1 MHz时,设计的节点运行电流和休眠电流(26.1 mA,1.57μA)与传统的Imote节点(35.1 mA,3.6μA)、Mica2节点(56.2 mA,21μA)相比,明显低于传统节点;当节点电池容量为2*700 mAh,工作周期为10分钟时,其生存周期为7.2个月;设计的节点的寿命达到预期目标。     

A smart node architecture for adding mobility to wireless sensor networks

Adding a few mobile nodes into the conventional wireless sensor networks can greatly improve the sensing and control capabilities of the networks and can help researchers solve many challenges such as network deployment and repair. This paper presents an enhanced node architecture for adding controlled mobility to wireless sensor networks. The structural model, the power model and the networking model of the proposed mobile node have been built respectively for better node control. And it provides a novel robotic platform for experimental research in hybrid sensor networks or other distributed measurement and control systems. A testbed has finally been created for validating the basic functions of the proposed mobile sensor node. The results of a coverage experiment show that the mobile node can provide additional support for network coverage and can ensure that the sensor network will work properly in undesirable environments.     

无线传感网络中通用传感器节点硬件结构设计

无线传感网络是当前国内外传感器技术领域的热点研究课题。提出了一种构建无线传感网络节点实验平台的方法;基于该设计方案实现的无线传感网络节点可以有效地组建网络拓扑结构及多种传感数据采集传输。它还可以用于实现声音空间定位系统。关键词:无线传感网络;节点;拓扑结构;数据采集;声音空间定位     

基于距离的分布式无线传感器网络定位算法*

针对水下无线传感器节点的定位问题进行研究,提出了一种可实现网络规模升级的分布式无信标节点的自定位算法。该定位算法无须额外的硬件支持,仅采用节点间的距离信息建立相对坐标系,确定各节点的相对位置。详细介绍了该算法的实现过程,通过仿真讨论了求精过程、通信半径等对定位误差的影响,并验证了该算法的合理性。为目标跟踪、地理路由、网络管理等系统功能提供了有力的技术支持。     

基于图信号处理的无线传感器网络异常节点检测算法

针对无线传感器网络（WSN）中传感器自身安全性低、检测区域恶劣及资源受限造成节点采集数据异常的问题,提出一种基于图信号处理的WSN异常节点检测算法。首先,依据传感器位置特征建立K-近邻（KNN）图信号模型;然后,基于图信号在低通滤波前后的平滑度之比构建统计检验量;最后,通过统计检验量与判决门限实现异常节点存在性的判断。通过在公开的气温数据集与PM2.5数据集上的仿真验证,实验结果表明,与基于图频域异常检测算法相比,在单个节点异常情况相同条件下,所提算法检测率提升7个百分点;在多个节点异常情况相同条件下,其检测率均达到98%,并且在网络节点异常偏离值较小时仍具有较高的检测率。     

一种分布式无线传感器网络节点定位算法

基于接收信号强度(RSSl)的无线传感器网络节点定位算法由于无需额外测距硬件的支持而受到广泛的应用.但无线信号传输受到环境的影响,使得基于RSSI的定位算法存在较大的定位误差.针对上述不足提出了一种基于概率的无线传感器网络节点定位方法.首先根据信标节点发送信号强度与未知节点接收信号强度差来计算未知节点到其一跳范围内所有信标节点的估计距离,然后根据这些估计距离,通过计算未知节点在某个位置概率密度函数的最大值来确定未知节点自身的位置坐标.通过仿真表明,该方法在较低的信标节点密度和节点通信半径条件下,具有较高的节点定位精度和定位覆盖率.     

分布式无线传感器网络故障检测算法综述

阐述了传感器网络中节点发生故障的原因并建立了故障模型。将当前主要的分布式节点故障检测算法分成了基于多数投票策略、基于中值策略、基于决策扩散策略、基于加权和基于分簇的算法五大类,详细阐述了分布式无线传感器网络故障检测算法的原理和步骤,并指出了各个算法的优势与不足。最后,对各个算法的性能进行了分析与比较,讨论了算法存在的问题,并指出了进一步的研究方向。     

无线传感器网络入侵检测系统模型

为了提高无线传感器网络的安全性,针对无线传感器网络的自身特性,设计了一种入侵检测系统模型.该模型按照聚类的方法,将区域划分成簇;在每个簇中选举簇头,簇头需定期轮换;采用基于相关向量机(RVM)的入侵检测方案.实验表明:所提出的模型与其它检测模型相比具有更高的平均检测率和更低的平均误检率,且具有低能耗的特点.     

能量均衡的无线传感器网络节点非均匀分布路由协议

针对现有无线传感器网络(WSN)分簇路由协议因节点分布不均匀而造成能量不均衡、“热区”能量空洞问题,提出一种能量均衡的节点非均匀分布路由协议。该协议以节点“度”、 节点到Sink节点的距离及节点平均剩余能量与节点本身剩余能量的比值作为竞选主(副)簇头的参数,并且各簇之间通过路由树与Sink节点通信。仿真结果表明,本协议可降减少于“热区”内或节点密度高的簇的簇头轮换次数,推迟出现第一个死亡节点的时间,使网络负载更加均衡,延长了网络的生命周期。     

无线传感器网络入侵检测的重复博弈建模研究

通过分析无线传感器网络节点影响网络可用性及其整体性能的自私行为,提出了一种无线传感器网络入侵检测的重复博弈模型,集中于检测和响应传感器节点的自私行为以加强网络节点的协作性能,利用节点与其邻居节点进行的重复博弈过程,广播节点的效用变化,即时检测出网络节点的自私行为。通过对网络节点的自私行为引入惩戒机制,从而大大降低了节点背离协作的可能性。仿真结果表明,对节点的自私行为实施惩戒机制,可以大大增强节点间相互协作,从而保证网络的连通性。     

Cluster based node scheduling method for wireless sensor networks

By researching on the node scheduling problem of m-covered and connected sensor networks,a new concept of two-hops-cluster is proposed in this paper,and based on it,a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k(k≤m) different groups {0,1,...,k 1} is designed,without requiring location information.Our algorithm guarantees that each group to be connected and maintains the coverage ratio with high possibility.Theoretical analysis and simulation results show that it has better performance than previous randomized scheduling scheme,and can prolong the lifetime of the sensor network effectively.     

无线传感器网络最少数量通信节点定位方法

随机布置的无线传感器网络,通信节点数量和位置影响网络性能。利用免疫理论与矢量量化技术提出了一种具有最少数量特性的无线传感器网络通信节点定位方法。根据生物免疫机制建立无线传感器节点激活模型,基于免疫自适应调节算法确定传递事件信息所需最少通信节点数;以全部节点坐标为矢量,通信节点数为矢量类别,矢量量化后获得的代表矢量即为通信节点在监测区域的位置。仿真结果表明该方法能极大地减少通信节点数量,优化网络空间资源布局。     

无线传感器网络中一种基于分簇的节点调度算法

本文研究m覆盖与连通的无线传感器网络中的节点调度问题,提出了一种两跳簇的概念,并在此基础上提出了一种新的节点调度算法.该算法可在不知道节点位置信息的情况下,将无线传感器网络中的所有节点较为均匀地指派到k(km)个不同的分组{0,1,...,k1}之中,且可同时保证每个分组中的节点具有全局连通性与较高的网络覆盖率.理论分析与实验结果表明,该算法具有比传统随机调度方法更好的节点调度性能,可更加有效地延长无线传感器网络的生命周期.     

Pattern recognition for detecting distributed node exhaustion attacks in wireless sensor networks

Malicious attacks when launched by the adversary-class against sensor nodes of a wireless sensor network, can disrupt routine operations of the network. The mission-critical nature of these networks signifies the need to protect sensory resources against all such attacks. Distributed node exhaustion attacks are such attacks that may be launched by the adversarial class from multiple ends of a wireless sensor network against a set of target sensor nodes. The intention of such attacks is the exhaustion of the victim’s limited energy resources. As a result of the attack, the incapacitated data-generating legitimate sensor nodes are replaced with malicious nodes that will involve in further malicious activity against sensory resources. One such activity is the generation of fictitious sensory data to misguide emergency response systems to mobilize unwanted contingency activity. In this paper, a model is proposed for such an attack based on network traffic flow. In addition, a distributed mechanism for detecting such attacks is also defined. Specific network topology-based patterns are defined to model normal network traffic flow, and to facilitate differentiation between legitimate traffic packets and anomalous attack traffic packets. The performance of the proposed attack detection scheme is evaluated through simulation experiments, in terms of the size of the sensor resource set required for participation in the detection process for achieving a desired level of attack detection accuracy. The results signify the need for distributed pattern recognition for detecting distributed node exhaustion attacks in a timely and accurate manner.     

基于时间序列数据的无线传感器网络的异常检测方法

伴随着无线传感器网络的发展和广泛应用,针对传感器网络在恶劣环境下传感器之间采样值差异大以及随着无线传感器网络故障节点增多导致事件检测不准确的问题,提出一种基于传感器网络时间序列数据的检测方法.利用传感器采集的K个正常数据的中位数建立枢轴量,构造置信区间,提出一种计算数据区间差异度的方法以判断发生异常的来源.实验结果表明,本文方法对传感器网络的异常数据检测率保持在98%以上,误报率保持在0.5%以下,具有一定的实用性.     

面向目标侦测的非配合式无线传感器网络研究

针对战场目标侦测需求,在满足无线传感器网络低成本、低功耗约束条件的前提下,选择了传感器组合,设计实现了非配合式无线传感器网络硬件平台,采用红外传感器作为"唤醒传感器"实现节点休眠唤醒功能,同时检测人员与车辆,磁阻传感器负责铁磁物质检测,声音传感器实现车辆与人员的声音信号特征检测,利用简单实用的数据处理方法对各传感器信号...     

Efficient distributed data scheduling algorithm for data aggregation in wireless sensor networks

With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggregation functions used to aggregate multiple data into one packet are unrepeatable; that is, every data is aggregated only at most once. This problem motivated us to study reporting data with minimum energy cost subject to that a fixed number of data are allowed to be aggregated into one packet and every data is aggregated at most once. In this paper, we propose novel data aggregation and routing structures for reporting generated data. With the structures, we study the problem of scheduling data to nodes in the networks for data aggregation such that the energy cost of reporting data is minimized, termed MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. In addition, we show that MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING is NP-complete. Furthermore, a distributed data scheduling algorithm is proposed accordingly. Simulations show that the proposed algorithm provides a good solution for MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING.