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

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

无线传感器网络中一种基于公钥的密钥分配方案

针对基于对称密钥的密钥分配技术无法彻底解决无线传感器网络中密钥分配的安全问题,提出了一种基于公钥的密钥预分配方案,基站利用一系列原始公钥和单向散列函数产生公钥集合,并为每个节点随机分配公私钥对和公钥集合的子集。由于私钥的唯一性,采用该方案不仅能够提高网络的安全性能,而且可以改善网络的存储开销。利用随机图论的相关原理证明,该方案与传统的密钥预分配方案相比,既保证了网络的安全,又兼顾了网络和节点资源有限的实际,在连通性不变的前提下,其网络安全性和网络的扩展性大幅度提高。     

Multiregional secure localization using compressive sensing in wireless sensor networks

Security and accuracy are two issues in the localization of wireless sensor networks (WSNs) that are difficult to balance in hostile indoor environments. Massive numbers of malicious positioning requests may cause the functional failure of an entire WSN. To eliminate the misjudgments caused by malicious nodes, we propose a compressive‐sensing–based multiregional secure localization (CSMR_SL) algorithm to reduce the impact of malicious users on secure positioning by considering the resource‐constrained nature of WSNs. In CSMR_SL, a multiregion offline mechanism is introduced to identify malicious nodes and a preprocessing procedure is adopted to weight and balance the contributions of anchor nodes. Simulation results show that CSMR_SL may significantly improve robustness against attacks and reduce the influence of indoor environments while maintaining sufficient accuracy levels.     

无线传感器网络中基于EBS的高效安全的群组密钥管理方案

为了保证无线传感器网络(WSN)群组通信的安全性,设计了一种基于EBS的群组密钥管理方案.提出方案首先通过合并链状簇和星型簇简化无线传感器网络的拓扑结构,然后通过增加网络被捕获时所需入侵节点的数量来防止攻击者通过少量共谋节点得到所有管理密钥,之后利用图染色算法对分配密钥组合的节点进行排序,并依据海明距离和EBS方法对网络中的传感器节点进行管理密钥分配.在此基础上给出了对传感器节点的加入和离开事件进行处理的方法.在有效性和性能分析阶段,首先通过2个实验分别对提出方案中共谋攻击的可能性和入侵节点数量对网络抵抗共谋攻击能力的影响进行分析,实验结果表明提出方案增强了WSN抵抗共谋攻击的能力;然后对提出方案和SHELL在加入事件和离开事件时的系统代价进行比较,结果表明提出方案所需的密钥更新消息数量和传感器节点存储量均小于SHELL方案.     

Trust-aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.     

A design for secure and survivable wireless sensor networks

In this article, we present a study of the design of secure and survivable wireless sensor networks (WSN) that has yet to be addressed in the literature. Our goal is to develop a framework that provides the security and survivability features that are crucial to applications in a WSN, because WSNs are vulnerable to physical and network-based security attacks, accidents, and failures. To achieve such a goal, we first examine the security and survivability requirements. We then propose a security and survivability architecture in a WSN with heterogeneous sensor nodes. To understand the interactions between survivability and security, we also design and analyze a key management scheme. The results of the experiment show that a good design can improve both security and survivability of a WSN; however, in some situations, there is a trade off between security and survivability.     

Elliptic key cryptography with Beta Gamma functions for secure routing in wireless sensor networks

Wireless Networks - The security of data communicated through wireless networks is a challenging issue due to the presence of malicious and unauthenticated users whose intention is either to...     

An improved key distribution mechanism for large-scale hierarchical wireless sensor networks

Wireless sensor networks are often deployed in hostile environments and operated on an unattended mode. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Due to their expensive energy consumption and hardware requirements, asymmetric key based cryptographies are not suitable for resource-constrained wireless sensors. Several symmetric-key pre-distribution protocols have been investigated recently to establish secure links between sensor nodes, but most of them are not scalable due to their linearly increased communication and key storage overheads. Furthermore, existing protocols cannot provide sufficient security when the number of compromised nodes exceeds a critical value. To address these limitations, we propose an improved key distribution mechanism for large-scale wireless sensor networks. Based on a hierarchical network model and bivariate polynomial-key generation mechanism, our scheme guarantees that two communicating parties can establish a unique pairwise key between them. Compared with existing protocols, our scheme can provide sufficient security no matter how many sensors are compromised. Fixed key storage overhead, full network connectivity, and low communication overhead can also be achieved by the proposed scheme.     

Malicious attack-resistant secure localization algorithm for wireless sensor network

In hostile environments, localization often suffers from malicious attacks that may distort transmit power and degrade positioning accuracy significantly for wireless sensor network. A robust semidefinite relaxation secure localiza-tion algorithm RSRSL was proposed to improve the location accuracy against malicious attacks. On the assumption of unknown transmit power, which is undoubtedly approximate to the fact of WSN, a novel secure location probability model was introduced for single-target and multi-target sensor networks, respectively. Taking the computational complexity of RSRSL into account, the nonlinear and non-convex optimization problem was simplified into a semidefinite programming problem. According to the results from both simulations and field experiments, it is clearly demonstrated that the proposed RSRSL has better performance on location accuracy, in contrast to the conventional localization algorithms.     

Tree-based key predistribution for wireless sensor networks

The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks. In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined by iterated hash computations based on a tree structure. Our scheme can be regarded as an improvement of HARPS, Ramkumar and Memon (IEEE J Sel Area Commun 23(3):611–621, 2005),or a generalization of Leighton and Micali’s scheme (Lect Notes Comput Sci 773:456–479, 1994). We rigorously analyze our scheme focusing on the resiliency of the network and hash computational complexity for each node and compare the performance with existing schemes. Specifically, we show that our scheme provides stronger resiliency and requires less hash computational complexity than HARPS.     

基于高能效RSSI的WSN定位

传感器自我定位是无线传感器网络中许多和定位有关的技术之一。虽然定位的主要目的是提高定位精度,但是能量消耗对定位提出了新的挑战。文中在考虑估计误差的同时,研究了最优功率分配的参考节点在一定意义上的最小能量消耗。为了对一个参考节点和一个利用了接收信号强度指示器(RSSI)的未知节点之间的相对距离有一个更好的估计,把接收到的信标的平均能量作为一种新的决策度量。基于此得到一个作为精度参数的平方位置误差和一个提高定位性能的优化问题。仿真结果表明,通过优化传输功率的配置可以实现能耗的大幅减少。     

Self-healing group key distribution with time-limited node revocation for wireless sensor networks

A novel key distribution scheme with time-limited node revocation is proposed for secure group communications in wireless sensor networks. The proposed scheme offers two important security properties: the seal-healing re-keying message distribution which features periodic one-way re-keying with implicitly authentication, efficient tolerance for the lost re-keying messages, and seamless Traffic Encryption Key (TEK) switch without disrupting ongoing data transmissions; and the time-limited dynamic node attachment and detachment, so that both forward and backward secrecy is assured by dual directional hash chains. It is shown that the communication and computation overhead of the proposed protocol is light, and the protocol is robust under poor communication channel quality and frequent group node topology change.     

Location-based pairwise key predistribution for wireless sensor networks

A practical pairwise key distribution scheme is necessary for wireless sensor networks since sensor nodes are susceptible to physical capture and constrained in their resources. In this paper, we investigate a simple and practical scheme that achieves higher connectivities and perfect resilience with less resources, even in case of deployment errors.     

面向WSN的安全范围查询协议研究

针对两层无线传感器网络中范围查询所要求的低能耗和高隐私保护,提出了一种具有隐私和完整性保护的安全范围查询协议:SPQ。SPQ是由数据加密、前缀成员验证、概率邻居验证、查询传输过程分离等技术组成,能够在保证不泄露隐私的情况下完成范围查询。分析和仿真结果表明,相对于其他安全协议,SPQ在保证范围查询安全性的同时具有更低能耗。     

基于区域的异构无线传感器网络密钥管理

密钥管理是无线传感器网络中极具挑战性的安全问题之一.在随机密钥预分配方案的基础上,提出一种利用节点部署知识和已知区域信息的异构无线传感器网络密钥预分配方案,并分别从网络连通性、节点内存需求和安全性等方面对方案进行性能评价和模拟仿真.结果表明,相比现有密钥管理方案,本方案能提高网络的连通性,减小节点所需存储空间,并增强网络抗攻击能力.     

Identity-based key agreement and encryption for wireless sensor networks

1 Introduction WSN has received considerable attention during last decade [1?4] (see, for example, the proceedings of the ACM and IEEE Workshops on WSN). It has wide variety of applications, including military sensing and tracking, environment and securit…     

Novel DV-Hop localization algorithm for wireless sensor networks

Many improved DV-Hop localization algorithm have been proposed to enhance the localization accuracy of DV-Hop algorithm for wireless sensor networks. These proposed improvements of DV-Hop also have some drawbacks in terms of time and energy consumption. In this paper, we propose Novel DV-Hop localization algorithm that provides efficient localization with lesser communication cost without requiring additional hardware. The proposed algorithm completely eliminates communication from one of the steps by calculating hop-size at unknown nodes. It significantly reduces time and energy consumption, which is an important improvement over DV-Hop—based algorithms. The algorithm also uses improvement term to refine the hop-size of anchor nodes. Furthermore, unconstrained optimization is used to achieve better localization accuracy by minimizing the error terms (ranging error) in the estimated distance between anchor node and unknown node. Log-normal shadowing path loss model is used to simulate the algorithms in a more realistic environment. Simulation results show that the performance of our proposed algorithm is better when compared with DV-Hop algorithm and improved DV-Hop—based algorithms in all considered scenarios.     

Monte Carlo localization for mobile wireless sensor networks

Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchor-based localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo localization algorithm. We concentrate on improving the localization accuracy and efficiency by making better use of the information a sensor node gathers and by drawing the necessary location samples faster. To do so, we constrain the area from which samples are drawn by building a box that covers the region where anchors’ radio ranges overlap. This box is the region of the deployment area where the sensor node is localized. Simulation results show that localization accuracy is improved by a minimum of 4% and by a maximum of 73% (average 30%), for varying node speeds when considering nodes with knowledge of at least three anchors. The coverage is also strongly affected by speed and its improvement ranges from 3% to 55% (average 22%). Finally, the processing time is reduced by 93% for a similar localization accuracy.     

Node distribution-based localization for large-scale wireless sensor networks

Distributed localization algorithms are required for large-scale wireless sensor network applications. In this paper, we introduce an efficient algorithm, termed node distribution-based localization (NDBL), which emphasizes simple refinement and low system-load for low-cost and low-rate wireless sensors. Each node adaptively chooses neighboring nodes, updates its position estimate by minimizing a local cost-function, and then passes this updated position to neighboring nodes. This update process uses a node distribution that has the same density per unit area as large-scale networks. Neighbor nodes are selected from the range in which the strength of received signals is greater than an experimentally based threshold. Based on results of a MATLAB simulation, the proposed algorithm was more accurate than trilateration and less complex than multi-dimensional scaling. Numerically, the mean distance error of the NDBL algorithm is 1.08–5.51 less than that of distributed weighted multi-dimensional scaling (dwMDS). Implementation of the algorithm using MicaZ with TinyOS-2.x confirmed the practicality of the proposed algorithm.     

Self-healing group-wise key distribution schemes with time-limited node revocation for wireless sensor networks

In this article two novel group-wise key distribution schemes with time-limited node revocation are introduced for secure group communications in wireless sensor networks. The proposed key distribution schemes are based on two different hash chain structures, dual directional hash chain and hash binary tree. Their salient security properties include self-healing rekeying message distribution, which features a periodic one-way rekeying function with efficient tolerance for lost rekeying messages; and time-limited dynamic node attachment and detachment. Security evaluation shows that the proposed key distribution schemes generally satisfy the requirement of group communications in WSNs with lightweight communication and computation overhead, and are robust under poor communication channel quality.