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...     

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)的未知节点之间的相对距离有一个更好的估计,把接收到的信标的平均能量作为一种新的决策度量。基于此得到一个作为精度参数的平方位置误差和一个提高定位性能的优化问题。仿真结果表明,通过优化传输功率的配置可以实现能耗的大幅减少。     

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.     

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…     

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.     

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.     

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.     

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.     

A secure enhanced privacy-preserving key agreement protocol for wireless mobile networks

The rapid proliferation of mobile networks has made security an important issue, particularly for transaction oriented applications. Recently, Jo et al. presented an efficient authentication protocol for wireless mobile networks and asserted that their proposed approach provides all known security functionalities including session key (SK) security under the assumption of the widely-accepted Canetti–Krawczyk (CK) model. We reviewed Jo et al.’s proposed roaming protocol and we demonstrate that it fails to provide the SK-security under the CK-adversary setting. We then propose an enhancement to Jo et al.’s roaming protocol to address the security drawback found in Jo et al.’s protocol. In the enhanced roaming protocol, we achieve the SK-security along with reduced computation, communication and storage costs. We also simulate the enhanced roaming protocol using NS2 for end-to-end delay and network throughput, and the simulation results obtained demonstrate the efficiency of our protocol.     

Anonymous three-factor authenticated key agreement for wireless sensor networks

Wireless Networks - Secure information exchange in wireless sensor networks (WSN) is a continuing issue since the resource-constrained sensors generally deployed over an unattended environment. To...     

Indoor localization based on wireless sensor networks

Indoor localization systems are becoming very popular because they enable the creation of very interesting location-based applications. This paper provides a short introduction about localization systems based on a sensor network and the actual state of the art. Important topics related to indoor localization like the necessary infrastructure, available technologies and their expected accuracy are treated. Additionally, the results of previous work referred to the performance evaluation of localization algorithms are shortly described. Finally, some ideas related to further investigations are presented.     

HiRLoc: high-resolution robust localization for wireless sensor networks

In this paper, we address the problem of robustly estimating the position of randomly deployed nodes of a wireless sensor network (WSN), in the presence of security threats. We propose a range-independent localization algorithm called high-resolution range-independent localization (HiRLoc), that allows sensors to passively determine their location with high resolution, without increasing the number of reference points, or the complexity of the hardware of each reference point. In HiRLoc, sensors determine their location based on the intersection of the areas covered by the beacons transmitted by multiple reference points. By combining the communication range constraints imposed by the physical medium with computationally efficient cryptographic primitives that secure the beacon transmissions, we show that HiRLoc is robust against known attacks on WSN, such as the wormhole attack, the Sybil attack, and compromise of network entities. Finally, our performance evaluation shows that HiRLoc leads to a significant improvement in localization accuracy compared with state-of-the-art range-independent localization schemes, while requiring fewer reference points.     

Power efficient range-free localization algorithm for wireless sensor networks

Considering energy consumption, hardware requirements, and the need of high localization accuracy, we proposed a power efficient range-free localization algorithm for wireless sensor networks. In the proposed algorithm, anchor node communicates to unknown nodes only one time by which anchor nodes inform about their coordinates to unknown nodes. By calculating hop-size of anchor nodes at unknown nodes one complete communication between anchor node and unknown node is eliminated which drastically reduce the energy consumption of nodes. Further, unknown node refines estimated hop-size for better estimation of distance from the anchor nodes. Moreover, using average hop-size of anchor nodes, unknown node calculates distance from all anchor nodes. To reduce error propagation, involved in solving for location of unknown node, a new procedure is adopted. Further, unknown node upgrades its location by exploiting the obtained information in solving the system of equations. In mathematical analysis we prove that proposed algorithm has lesser propagation error than distance vector-hop (DV-Hop) and other considered improved DV-Hop algorithms. Simulation experiments show that our proposed algorithm has better localization performance, and is more computationally efficient than DV-Hop and other compared improved DV-Hop algorithms.     

Density adaptive localization for irregularly deployed wireless sensor networks

In wireless sensor networks (WSNs), irregularly deployed nodes can significantly degrade the performance of the localization system. In this paper, we propose a novel localization scheme for the irregularly deployed WSNs. The basic approach is to control the transmission of location messages by using the fuzzy c-means (FCM) clustering algorithm. Next, each node selects its localization method according to the node density. Simulation studies show that the proposed approach can enhance the localization accuracy, while reducing the retransmission messages in the irregularly deployed WSNs.     

Theoretic analysis of unique localization for wireless sensor networks

Node self-localization has become an essential requirement for realistic applications over wireless sensor networks (WSNs). Although many distributed localization algorithms have been proposed, fundamental theoretic analysis of unique localization is still in its early stage of development. This paper aims at a synthetic and homogeneous survey of the theoretical basis on WSN localization problem carried out thus far. Specifically, subsequent to establishing a technological context of relevant terms, we construct a graph and then a formation for each WSN to present current state-of-the-art by analyzing possible conditions for unique localization, as well as corresponding verification algorithms, by drawing on the powerful results from rigidity theory, distance geometry, geometric constraints in CAD, and combinatorial theory. We show that the unique localization problem is well understood in two-dimension, however, only partial analogous results are available in three-dimension.     

On composability of localization protocols for wireless sensor networks

Realistic, complex outdoor environments pose significant challenges for node localization in wireless sensor networks. In spite of the fact that many elegant and clever solutions have been proposed, no robust localization system has emerged. This status quo is because existing solutions work well for single sets of assumptions that, however, do not always hold in complex environments. In this article we review the state of the art for node localization in wireless sensor networks and show how localization protocol composability has the potential to provide the robust solution that is needed. By composing localization protocols in a hierarchy and allowing the execution of multiple localization schemes, robust solutions against any single protocol failure can be built.     

Reactive and adaptive monitoring to secure aggregation in wireless sensor networks

Data aggregation is considered as one of the fundamental distributed data processing procedures for saving the energy and minimizing the medium access layer contention in wireless sensor networks. However, sensor networks are likely to be deployed in an untrusted environment, which make them vulnerable against several attacks. A compromised node may forge arbitrary aggregation value and mislead the base station into trusting a false reading. Secure in-network aggregation can detect such manipulation. But, as long as such subversive activity is, reliable aggregation result can not be obtained. In contrast, the collection of individual sensor node values is robust and solves the problem of availability, but in an inefficient way. Our work seeks to bridge this gap in secure data collection. We propose a framework that enhances availability with efficiency close to that of in-network aggregation avoiding over-reliance on sensors. To achieve this, we design a scheme that is built on one core concept: no trust is supposed in any sensor. Therefore, we design a two hierarchical levels of monitoring to ensure the integrity and the accuracy of aggregate result, only when necessary, i.e. only when malicious activities are detected. Relying on this new type of monitoring mechanism, the framework has the ability to recover from aggregator failure without neglecting energy efficiency, providing thus much higher availability than other security protocols.     

一种基于KeyRev的无线传感器网络密钥撤销方案

KeyRev密钥撤销方案可以在一定程度上销毁无线传感网络中的受损节点,并可以生成新一轮通信中会话密钥,已生成会话密钥的节点即可生成数据加密密钥和MAC校验密钥。但因其是采用明文广播受损节点信息。使遭受攻击的节点很容易发现自己身份暴露,从而采取欺骗、篡改等手段依然参与网络通信。对此方案予以改进优化,对广播信息隐蔽处理,更加安全有效地剔除网络中的受损节点。