Privacy preserving secure expansive aggregation with malicious node identification in linear wireless sensor networks

The Wireless Sensor Networks (WSNs) used for the monitoring applications like pipelines carrying oil, water, and gas; perimeter surveillance; border monitoring; and subway tunnel monitoring form linearWSNs. Here, the infrastructure being monitored inherently forms linearity (straight line through the placement of sensor nodes). Therefore, suchWSNs are called linear WSNs. These applications are security critical because the data being communicated can be used for malicious purposes. The contemporary research of WSNs data security cannot fit in directly to linear WSN as only by capturing few nodes, the adversary can disrupt the entire service of linear WSN. Therefore, we propose a data aggregation scheme that takes care of privacy, confidentiality, and integrity of data. In addition, the scheme is resilient against node capture attack and collusion attacks. There are several schemes detecting the malicious nodes. However, the proposed scheme also provides an identification of malicious nodes with lesser key storage requirements. Moreover, we provide an analysis of communication cost regarding the number of messages being communicated. To the best of our knowledge, the proposed data aggregation scheme is the first lightweight scheme that achieves privacy and verification of data, resistance against node capture and collusion attacks, and malicious node identification in linear WSNs.     

水声传感器网络节点自适应加权定位算法

对水声传感器网络节点定位进行研究,针对水声传感器网络节点间测距精度不高的问题,提出一种水声传感器网络节点自适应加权定位算法。考虑到水声传感器网络节点间的测距误差随着节点间距离的增大而增大,算法改进了锚节点选择机制,并且对不同锚节点在定位测度中的权重进行加权,改进定位测度,提高了测距信息的利用效率。仿真实验表明该算法提高了节点定位精度。     

Energy-efficient filtering for skyline queries in cluster-based sensor networks

Filtering is a generic technique for skyline retrieval in sensor networks, for the purpose of reducing the communication cost, the dominant part of energy consumption. The vast majority of existing filtering approaches are suitable for uniform and correlated datasets, whereas in many applications the data distribution is clustered or anti-correlated. The only work considering anti-correlated dataset requires significant energy for filtering construction, and it is hard to be efficiently adapted to clustered databases. In this paper, we propose a new filtering algorithm, which settles the problem by utilizing individual node characteristics and generating personalized filters. Given a fraction k, a personalized filter prunes at least k percent of points on assigned nodes. A novel scheme for data cluster representation and a sampling method are then proposed to reduce the filtering cost and maximize the benefit of filtering. Extensive simulation results show the superiority of our approach over existing techniques.     

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

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

能量自适应的无线传感器网络分簇路由协议

为有效解决无线传感器网络中的"热区"问题,提出了一种能量自适应的非均匀分簇路由协议.协议采取非均匀的分簇结构,使靠近基站的簇范围减小到合理的范围,即在靠近基站的区域内,每个簇由较少的无线传感器节点构成,这些节点的主要工作是负责转发其它簇的信息,从而有效减少其能量消耗速率.同时,协议在通信路由的过程中还综合考虑了簇头与中转节点的距离以及中转节点的能量消耗率.实验结果表明,该协议有效解决了"热区"问题,并且延长了无线传感器网络的生命周期.     

一种基于分簇的无线传感器网络动态密钥分发协议

层簇式无线传感器网络具有能量利用率高的优点,目前已经提出了多种基于分簇的路由协议,但这些协议并没有考虑到安全性因素.针对这个问题,提出了一种基于分簇的动态密钥分发协议SDKD,通过综合考虑节点的剩余能量和地理位置信息优化簇头选举机制,并使用哈希函数产生动态密钥加密通信过程.仿真实验表明,SDKD协议与典型的分簇协议LEAP相比,降低了网络能量消耗,并延长了网络生命周期.     

电机定子温度在线监测的无线传感器网络节点设计

针对电机复杂的结构,提出了将无线传感器网络应用到电机定子绕组温度在线监测中,克服了传统在线监测网络的局限性.深刻剖析了铂电阻三线法测温的原理和基于检温计Pt100与可编程片上系统(PSoC)的传感器节点的硬件设计过程,其性能可以满足无线传感器网络节点对功耗的要求,在此基础之上设计了温度传感器节点的软件.实验结果表明:该温度传感器节点能有效地分析和校正误差,测温准确,为组建电机定子温度在线监测的无线传感器网络奠定了基础.     

Dynamic camouflage event based malicious node detection architecture

Compromised sensor nodes may collude to segregate a specific region of the sensor network preventing event reporting packets in this region from reaching the basestation. Additionally, they can cause skepticism over all data collected. Identifying and segregating such compromised nodes while identifying the type of attack with a certain confidence level is critical to the smooth functioning of a sensor network. Existing work specializes in preventing or identifying a specific type of attack and lacks a unified architecture to identify multiple attack types. Dynamic Camouflage Event-Based Malicious Node Detection Architecture (D-CENDA) is a proactive architecture that uses camouflage events generated by mobile-nodes to detect malicious nodes while identifying the type of attack. We exploit the spatial and temporal information of camouflage event while analyzing the packets to identify malicious activity. We have simulated D-CENDA to compare its performance with other techniques that provide protection against individual attack types and the results show marked improvement in malicious node detection while having significantly less false positive rate. Moreover, D-CENDA can identify the type of attack and is flexible to be configured to include other attack types in future.     

传感网中对抗恶意节点的博弈论分析

无线传感网作为应用广泛的多跳自组织网络,由成百上千资源有限的传感器节点组成.当网络数据传输时,若节点的通信负载超过其可用带宽,则会发生拥塞,使得传输不可靠,尤其在无线传感网特殊的工作环境中,当有恶意节点存在时会更严重.为此,引入博弈论,对有恶意节点存在的传感网进行研究,分析节点行为,建立博弈模型,给出实现步骤和验证方案,综合理论分析和仿真结果,获得节点最佳策略,达到网络拥塞避免的既定目标.     

A survey on trust based detection and isolation of malicious nodes in ad-hoc and sensor networks

Mobile ad-hoc networks (MANETs) and wireless sensor networks (WSNs) have gained remarkable appreciation and technological development over the last few years. Despite ease of deployment, tremendous applications and significant advantages, security has always been a challenging issue due to the nature of environments in which nodes operate. Nodes’ physical capture, malicious or selfish behavior cannot be detected by traditional security schemes. Trust and reputation based approaches have gained global recognition in providing additional means of security for decision making in sensor and ad-hoc networks. This paper provides an extensive literature review of trust and reputation based models both in sensor and ad-hoc networks. Based on the mechanism of trust establishment, we categorize the stateof-the-art into two groups namely node-centric trust models and system-centric trust models. Based on trust evidence, initialization, computation, propagation and weight assignments, we evaluate the efficacy of the existing schemes. Finally, we conclude our discussion with identification of some unresolved issues in pursuit of trust and reputation management.     

具有空间电磁场探测功能的WSNs节点设计

介绍一种能探测空间电磁场的低功耗无线传感器网络（WSNs）节点硬件设计方案,以16位单片机MSP430F149为核心,结合外围检波器AD8307构建无线网络探测节点。介绍了空间电磁场的2种检测器件并作了比较。节点设计具有小体积、低功耗、低成本等特点,可实现对目标磁信号的探测。     

Secure communications for cluster-based ad hoc networks using node identities

Ad hoc networks are self-configurable networks with dynamic topologies. All involved nodes in the network share the responsibility for routing, access, and communications. The mobile ad hoc network can be considered as a short-lived collection of mobile nodes communicating with each other. Such networks are more vulnerable to security threats than traditional wireless networks because of the absence of the fixed infrastructure. For providing secure communications in such networks, lots of mechanisms have been proposed since the early 1990s, which also have to deal with the limitations of the mobile ad hoc networks, including high power saving and low bandwidth. Besides, public key infrastructure (PKI) is a well-known method for providing confidential communications in mobile ad hoc networks. In 2004, Varadharajan et al. proposed a secure communication scheme for cluster-based ad hoc networks based on PKI. Since the computation overheads of the PKI cryptosystem are heavy for each involved communicating node in the cluster, we propose an ID-based version for providing secure communications in ad hoc networks. Without adopting PKI cryptosystems, computation overheads of involved nodes in our scheme can be reduced by 25% at least.     

Adaptive design optimization of wireless sensor networks using genetic algorithms

We present a multi-objective optimization methodology for self-organizing, adaptive wireless sensor network design and energy management, taking into consideration application-specific requirements, communication constraints and energy-conservation characteristics. A precision agriculture application of sensor networks is used as an example. We use genetic algorithms as the optimization tool of the developed system and an appropriate fitness function is developed to incorporate many aspects of network performance. The design characteristics optimized by the genetic algorithm system include the status of sensor nodes (whether they are active or inactive), network clustering with the choice of appropriate clusterheads and finally the choice between two signal ranges for the simple sensor nodes. We show that optimal sensor network designs constructed by the genetic algorithm system satisfy all application-specific requirements, fulfill the existent connectivity constraints and incorporate energy-conservation characteristics. Energy management is optimized to guarantee maximum life span of the network without lack of the network characteristics that are required by the specific application.     

Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks

Data aggregation in wireless sensor networks is employed to reduce the communication overhead and prolong the network lifetime. However, an adversary may compromise some sensor nodes, and use them to forge false values as the aggregation result. Previous secure data aggregation schemes have tackled this problem from different angles. The goal of those algorithms is to ensure that the Base Station (BS) does not accept any forged aggregation results. But none of them have tried to detect the nodes that inject into the network bogus aggregation results. Moreover, most of them usually have a communication overhead that is (at best) logarithmic per node. In this paper, we propose a secure and energy-efficient data aggregation scheme that can detect the malicious nodes with a constant per node communication overhead. In our solution, all aggregation results are signed with the private keys of the aggregators so that they cannot be altered by others. Nodes on each link additionally use their pairwise shared key for secure communications. Each node receives the aggregation results from its parent (sent by the parent of its parent) and its siblings (via its parent node), and verifies the aggregation result of the parent node. Theoretical analysis on energy consumption and communication overhead accords with our comparison based simulation study over random data aggregation trees.     

Quantum security in wireless sensor networks

Security in sensor networks, though an important issue for widely available wireless networks, has been studied less extensively than other properties of these networks, such as, for example, their reliability. The few security schemes proposed so far are based on classical cryptography. In contrast, the present paper develops a new security solution, based on quantum cryptography. The scheme developed here comes with the advantages quantum cryptography has over classical cryptography, namely, effectively unbreakable keys and therefore effectively unconditionally secure messages. Our security system ensures privacy of the measured data field in the presence of an intruder who listens to messages broadcast in the field.     

基于区域分簇的大规模无线传感器网络生命周期优化策略

针对环境监测、电网冰灾监测等大规模监测系统中监测区域覆盖广、传感器数量大等特性,为节约网络能耗以延长生命周期,提出了一种基于区域分簇的大规模无线传感器网络生命周期优化策略(RCS).该策略首先利用传感器节点的位置信息进行凝聚的层次聚类(AGNES)算法将大规模网络分区以优化簇首的分布;其次,候选簇首节点竞选簇首成功后进行不均匀分簇,同时加入时间阈值来均衡簇首节点的能耗;最后,采用簇间多跳路由,根据节点剩余能量、与汇聚点距离计算网络能耗代价来构建最小生成树进行路由选择.在仿真实验中,该策略与经典的低功耗自适应分簇(LEACH)协议和能量高效的非均匀分簇(EEUC)算法比较,簇首能耗平均分别减少了45.1%和2.4%,网络生命周期分别延长了38%和3.7%.实验结果表明,RCS在大规模网络中能有效均衡整体网络能耗,显著延长了网络的生命周期.     

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

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

基于CC1111的无线传感器网络节点设计

介绍了德州仪器(TI)最新推出的单片无线收发片上系统(SoC)CC1111的结构特点和性能,在此基础上设计了无线传感器网络的节点,并结合其工作原理,阐述了它在无线传感器网络节点设计中的应用。     

一种新的无线传感器网络恶意节点追踪方法

无线传感器网络中缺少单一可信的路由设备,存在中间节点篡改包标记的问题,为解决这一问题,提出一种改进的节点采样包标记算法.该算法通过对ID和数据包进行HASH运算来产生水印,并把水印概率性标记到相应的标记区中,Sink节点根据标记信息来实现对恶意节点的追踪.该算法能够有效地抵抗串通节点更改标记,把恶意节点定位在一跳范围之内.实验表明,改进后的算法可以有效地追踪到恶意节点,并将该方法与基于边标记的追踪方法进行对比,定位成功率得到提高.     

Radiation detection with distributed sensor networks

In any assessment of potential terrorist attacks, the nuclear threat takes center stage. Although weapons-grade nuclear materials arc heavily guarded, a plausible scenario involves terrorists detonating a simple radiological dispersion device (ROD) capable of broadcasting nonfissile but highly radioactive particles over a densely populated area. In most cases, a motor vehicle has to transport the device and its payload commonly known as a "dirty bomb" - to the target destination. As a final defense against such a weapon, select traffic choke points in the US have large portal monitoring systems to help detect illicit isotopes. The distributed sensor network project at Los Alamos National Laboratory, in cooperation with the University of New Mexico, is developing a network of radiation detectors that, coupled with other sensors that collect supportive data, is suitable for ROD interdiction in either urban or rural environments. Compared to a portal monitor, a DSN is much less visible, uses less power per detector, is hand carried and thus more rapidly deployable, and simplifies coverage of multiple transport avenues. Also, to function effectively, portal monitoring systems typically require slow or halted traffic, whereas our DSN can be tailored for any moderate traffic speed.