random key predistribution
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 0)

H-INDEX

9
(FIVE YEARS 0)

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Jugminder Kaur ◽  
Sandeep S. Gill ◽  
Balwinder S. Dhaliwal

Security is always a major concern in wireless sensor networks (WSNs). Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF) routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS) to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF) is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.


2014 ◽  
Vol 2014 ◽  
pp. 1-14
Author(s):  
Shihui Zheng ◽  
Yuan Tian ◽  
Lei Jin ◽  
Yu Yang

A distributed sensor network (DSN) can be deployed to collect information for military or civilian applications. However, due to the characteristics of DSNs such as limited power, key distribution for a distributed sensor network is complex. In this paper, a neighbor-based path key establishing method and a seed-based algorithm are put forward to improve the original random key pre-distribution scheme. The new scheme is portable because it is independent of the routing protocol. Moreover, the connectivity of the entire network also approaches 1. In particular, the new scheme can keep high connectivity by setting a small amount of redundancy in parameter values when the number of neighbors drops because of the node dormancy or death. The resilience against node capture in our scheme is not lower than that in thel-path scheme and the basic schemes when the number of hops in a path is larger than 5, and the simulation result shows that the efficiency of our scheme is also slightly higher.


2013 ◽  
Vol 818 ◽  
pp. 224-229
Author(s):  
Yu Quan Zhang

A key management strategy is presented for heterogeneous wireless sensor networks. The wireless sensor networks have some sensor nodes which have greater power and transmission capability than other nodes have. Both ordinary nodes and heterogeneous nodes are evenly distributed in sensing square area respectively. The pairwise keys between nodes are established through utilizing the concept of the overlap key sharing and the random key predistribution scheme. Analysis and comparison demonstrate that the connectivity and security of wireless sensor networks have been improved obviously even with some heterogeneous nodes.


2012 ◽  
Vol 263-266 ◽  
pp. 920-925 ◽  
Author(s):  
Alan Dahgwo Yein ◽  
Cheng Yeh Chen ◽  
Te Cheng Hsu ◽  
Wen Shyong Hsieh ◽  
Jiun An Lin

Wireless sensor networks have been widely used in many areas, such as earthquake monitoring, building structure monitoring, and military surveillance. In this work, we focus on the wireless sensor network deployed in the battlefield, using random key predistribution scheme. Based on the node cloning attack, we proposed a new attack scheme, called compromised key redistribution attack, and discussed related attack scenarios. Furthermore, we have exposed that, when the overlapping factor of compromised key set is larger than 0.05, it is almost 90% that the number of distinct compromised keys is 10.5% of the original key pool. This result helps the adversary estimate the approximated size of original key pool by calculating the overlapping factor, thus calculate the probability that malicious nodes successfully establish malicious connections with legitimate nodes.


Sign in / Sign up

Export Citation Format

Share Document