An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.     

Novel Approach of Key Predistribution for Grid Based Sensor Networks

Wireless Personal Communications - Grid based sensor networks are significant for applications such as monitoring goods in a warehouse, studying traffic level of city streets, monitoring energy...     

Modeling Pairwise Key Establishment for Random Key Predistribution in Large-Scale Sensor Networks

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys are required to be established between them. Considering the storage limitations and the lack of post-deployment configuration information of sensors, random key predistribution schemes have been proposed. Due to limited number of keys, sensors can only share keys with a subset of the neighboring sensors. Sensors then use these neighbors to establish pairwise keys with the remaining neighbors. In order to study the communication overhead incurred due to pairwise key establishment, we derive probability models to design and analyze pairwise key establishment schemes for large-scale sensor networks. Our model applies the binomial distribution and a modified binomial distribution and analyzes the key path length in a hop-by-hop fashion. We also validate our models through a systematic validation procedure. We then show the robustness of our results and illustrate how our models can be used for addressing sensor network design problems.     

A Hybrid Trust Management Scheme for Wireless Sensor Networks

Wireless sensor network (WSN) consists of wireless small sensor nodes deployed in the terrain for continuous observation of physical or environmental conditions. The data collected from the WSN is used for making decisions. The condition for making critical decision is to assure the trustworthiness of the data generated from sensor nodes. However, the approaches for scoring the sensed data alone is not enough in WSN since there is an interdependency between node and data item. If the overall trust score of the network is based on one trust component, then the network might be misguided. In this work, we propose the hybrid approach to address the issue by assigning the trust score to data items and sensor nodes based on data quality and communication trust respectively. The proposed hybrid trust management scheme (HTMS) detects the data fault with the help of temporal and spatial correlations. The correlation metric and provenance data are used to score the sensed data. The data trust score is utilized for making decision. The communication trust and provenance data are used to evaluate the trust score of intermediate nodes and source node. If the data item is reliable enough to make critical decisions, a reward is given by means of adding trust score to the intermediate nodes and source node. A punishment is given by reducing the trust score of the source and intermediate nodes, if the data item is not reliable enough to make critical decisions. Result shows that the proposed HTMS detects the malicious, faulty, selfish node and untrustworthy data.     

一种无状态的传感器网络密钥预分配方案

 在无线传感器网络中,节点被敌方捕获以后将泄露节点内存储的群组密钥等秘密信息,所以需要建立一种安全高效的群组密钥管理系统来及时对被捕获节点进行撤销,以保证无线传感器网络中群组通信的安全.提出一种基于逻辑密钥树结构的密钥预分配方案,群组控制者和密钥服务器(GCKS)为逻辑密钥树中每一逻辑节点分配一个密钥集,每一sensor节点对应一个叶节点,以及一条从该叶节点到根节点的路径,GCKS将该路径上所有节点的密钥植入sensor节点.节点撤销时,GCKS将逻辑密钥树分成互不相连的子树,利用子树中sensor节点的共享密钥进行群组密钥的更新.分析表明本方案满足无状态性,以及正确性、群组密钥保密性、前向保密性和后向保密性等安全性质,具有较低的存储、通信和计算开销,适用于无线传感器网络环境.     

A Two-Layer Key Establishment Scheme for Wireless Sensor Networks

In a large scale sensor network, it is infeasible to assign a unique Transport Layer Key (TLK) for each pair of nodes to provide the end-to-end security due to the huge memory cost per node. Thus, conventional key establishment schemes follow a key predistribution approach to establish a Link Layer Key (LLK) infrastructure between neighboring nodes and rely on multihop paths to provide the end-to-end security. Their drawbacks include vulnerability to the node compromise attack, large memory cost, and energy inefficiency in the key establishment between neighboring nodes. In this paper, we propose a novel key establishment scheme, called LAKE, for sensor networks. LAKE uses a t-degree trivariate symmetric polynomial to facilitate the establishment of both TLKs and LLKs between sensor nodes in a two-dimensional space, where each node can calculate direct TLKs and LLKs with some logically neighboring nodes and rely on those nodes to negotiate indirect TLKs and LLKs with other nodes. Any two end nodes can negotiate a TLK on demand directly or with the help of only one intermediate node, which can be determined in advance. As for the LLK establishment, LAKE is more secure under the node compromise attack with much less memory cost than conventional solutions. Due to the location-based deployment, LAKE is also energy efficient in that each node has direct LLKs with most neighbors without spending too much energy on the establishment of indirect LLKs with neighbors through multihop routing.     

无线传感器网络的多空间密钥预分配方案

针对无线传感器网络的安全性要求,分析R.Blom的密钥预分配方案,并在此基础上做出改进,提出了多空间密钥预分配方案:为无线传感器网络中的每一个传感器节点构建多个密钥空间,并通过节点间的共同密钥空间使每个节点对之间都形成一个成对密钥。通过仿真实验测试该方案的安全性,实验结果认为该方案对于该方案对节点捕获攻击具有较高的弹性。     

一种基于位置的WSN密钥管理方案

针对当前无线传感器网络（WSN）随机密钥预分布方案中网络只能概率连通且密钥不能作为认证的问题，文中提出了一种基于节点位置的密钥管理方案LBK-KMS，文中详细介绍LBK-KMS方案的建立过程；并从安全抵抗性，网络连通性，扩展性以及通信计算性能等方面与E-G以及q-Composite方案进行了比较分析；最后探讨了下一步可研究的工作．     

On the Detection of Clones in Sensor Networks Using Random Key Predistribution

Random key predistribution security schemes are well suited for use in sensor networks due to their low overhead. However, the security of a network using predistributed keys can be compromised by cloning attacks. In this attack, an adversary breaks into a sensor node, reprograms it, and inserts several copies of the node back into the sensor network. Cloning gives the adversary an easy way to build an army of malicious nodes that can cripple the sensor network. In this paper, we propose an algorithm that a sensor network can use to detect the presence of clones. Keys that are present on the cloned nodes are detected by looking at how often they are used to authenticate nodes in the network. Simulations verify that the proposed method accurately detects the presence of clones in the system and supports their removal. We quantify the extent of false positives and false negatives in the clone detection process.     

一种基于双密钥的无线传感网络动态密钥管理方案

针对无线传感网络节点的存储空间、能量等的限制,以及动态密钥管理的无身份认证的安全问题等,提出一种类似一次一密的双密钥管理方案.该方案增加了身份认证模块,以及新节点的认证机制.同时在更新动态密钥时引入盐值,这一特性又进一步增强了无线传感器网络的抗毁性能.最后分析了方案的存储量、连通性以及安全性：在超过6 000个节点的网络环境下,该方案单个节点的密钥存储量大幅降低,仅有E-G方案的一半左右;在连通性方面,E-G方案是基于概率的,一般为0.9,而该方案的连通率为1;在安全性方面,该方案降低了密钥环的数量,未捕获节点的密钥暴露概率比E-G方案低很多.     

A Secure Key Predistribution Scheme for WSN Using Elliptic Curve Cryptography

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.     

无线传感器网络密钥预分配蜂窝模型

要达到无线传感器网络的安全通信,必须对网络中节点之间的通讯数据用密钥进行必要的加密。文章使用蜂窝模型分组方案,把节点按照预测的地理位置关系分组,给处于相同组或是相邻组的节点之间分配共享密钥,使节点的分组模式和查询更符合节点广播特征。蜂窝模型密钥预分配机制极大的提高密钥利用率,减少了密钥分配和维护代价,使传感器网络的安全性和连通性极大的提高。     

A Novel Sub-regional Key Distribution Scheme for Distributed Wireless Sensor Networks

International Journal of Wireless Information Networks - Security is critical to any networks, including WSNs. The packets are transmitted hop by hop in WSNs over a broadcasting medium, which makes...     

Two-Tier,Scalable and Highly Resilient Key Predistribution Scheme for Location-Aware Wireless Sensor Network Deployments

We propose a probabilistic key predistribution scheme for wireless sensor networks, where keying materials are distributed to sensor nodes for secure communication. We use a two-tier approach in which there are two types of nodes: regular nodes and agent nodes. Agent nodes are more capable than regular nodes. Our node deployment model is zone-based such that the nodes that may end up with closer positions on ground are grouped together. The keying material of nodes that belong to different zones is non-overlapping. However, it is still possible for nodes that belong to different zones to communicate with each other via agent nodes when needed. We give a comparative analysis of our scheme through simulations and show that our scheme provides good connectivity figures at reasonable communication cost by using minimal flooding in key distribution. Moreover, we show that our scheme is scalable such that no extra overhead in incurred in case of increased number of nodes and sensor field size. Most importantly, simulation results show that our scheme is highly resilient to node captures.     

一种基于ID的传感器网络密钥管理方案

对偶密钥的建立是无线传感器网络的安全基础,它使得节点之间能够进行安全通信。但是由于节点资源的限制,传统的密钥管理方法在传感器网络中并不适用。在分析了现有密钥预分配协议的前提下,该文提出一种新的基于ID的密钥预分配协议。此协议用计算和比较散列值的方式替代广播方式协商密钥,减少了传感器节点大量的通信消耗。然后,分析了所提出方案的安全性、通信量和计算量,并和已有协议进行了比较。结果表明本文的方法不仅能保证安全性,而且节约了大量通信资源。     

Energy Proficient Hybrid Secure Scheme for Wireless Sensor Networks

Wireless Personal Communications - One way hash chain with a new key indicating the performance of the node as well to isolate malicious nodes from the network. Public key cryptography is derived...     

一种有效的无线传感器网络密钥协商方案

 针对无线传感器网络能量、计算能力、存储空间以及带宽等局限性问题,提出了一种适合无线传感器网络的密钥协商方案EKASFWSN(Efficient Key Agreement Scheme for Wireless Sensor Networks).该方案首先运用身份加密(IBE)算法预置网络系统参数并通过计算获得节点的相关参数;然后节点使用组播技术向邻居节点广播其ID号并利用Diffie-Hellman密钥交换技术和IBE算法安全地交换节点间的相关参数、计算节点的密钥;最后利用计算获得的节点间共享密钥使用对称密码方法对网络消息进行加、解密.与目前在WSNS研究中比较流行的传统网络密钥协商方案进行的理论分析和仿真实验,结果表明:EKASFWSN方案较好的解决了无线传感器网络在计算能力、能量、存储空间和带宽等方面的局限性问题;并通过密钥交换和身份加密等技术提高了节点通信的安全.     

A Key Pre-distribution Scheme based on Sub-regions for Multi-Hop Wireless Sensor Networks

Wireless Personal Communications - The key pre-distribution schemes in wireless sensor networks (WSNs) have attracted researchers’ attentions recently in some applications. These researches...     

A Key Pre-distribution Scheme for Wireless Sensor Networks Using Hexagonal Deployment knowledge

To insure security for the messages sent among sensor nodes, it is important to establish keys for encryption to nodes which have had no prior direct contact with each other in wireless sensor networks. To solve the problem above, several key pre-distribution schemes have been proposed. In this paper, we present a novel key pre-distribution scheme using hexagonal deployment knowledge, in which the q-composite keys scheme has been improved. By using hexagonal division over the deploy- ment region, the probability of sharing common keys be- tween each sub-region and its neighboring sub-regions are equal, so the keys for encryption can be generated efficiently. The analytic results show that the scheme we pre-sented can achieve a higher connection probability of any two neighboring nodes than previous schemes, and net- work resilience against node capture can be substantially improved.     

Centralized Key Management Scheme in Wireless Sensor Networks

Today, key management is widely recognized as an important aspect of security in wireless sensor networks. In these networks, sensor nodes can be either mobile or static. Therefore, supporting the mobility of the nodes can be regarded as a purpose of key management schemes. In our previous work, we presented a key management scheme that was more efficient with respect to security and connectivity compared to the other ones. In that scheme, it is assumed that the nodes are static. In this paper we are going to present a scheme that supports the mobility of the nodes and makes the initial scheme more flexible. The basic criterion for the evaluation of the scheme is the communication overhead. First, the nodes establish a secure link with the cluster heads and then establish a secure link among themselves with the help of the cluster heads. We have analyzed this scheme with regards to the communication overhead and we will compare it with the other schemes.