Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A Key Management Scheme Using Deployment Knowledge for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhen Yu ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA ; Guan, Yong

Wireless sensor networks pose new security and privacy challenges. One of the important challenges is how to bootstrap secure communications among nodes. Several key management schemes have been proposed. However, they either cannot offer strong resilience against node capture attacks, or require too much memory for achieving the desired connectivity. In this paper, we propose a novel key management scheme using deployment knowledge. In our scheme, a target field is divided into a number of hexagon grids and sensor nodes are divided into the same number of groups as that of grids, where each group is deployed into a unique grid. By using deployment knowledge, we drastically reduce the number of potential groups from which a node's neighbors may come. Thus, a pairwise key can be generated efficiently for any two neighbor nodes. Compared with existing schemes, our scheme achieves higher connectivity with a much lower memory requirement and shorter transmission range. It also outperforms others in terms of resilience against node capture attacks.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:19 ,  Issue: 10 )