By Topic

A Matrix-Based Random Key Pre-distribution Scheme 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
$33 $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

3 Author(s)
Ting Yuan ; Fudan University, Shanghai, 200433, P. R. China ; Shiyong Zhang ; Yiping Zhong

Dynamics of wireless sensor networks (WSN) make security one of the top issues we should pay attention to. WSN's can be deployed in hostile environments where their nodes are easy to be captured or re-programmed for deleterious use by an adversary. Therefore, it is necessary to protect communications between sensor nodes through cryptographic methods. To address this, symmetric key management in wireless sensor networks arises as a challenging security issue because other key management issues (e.g., asymmetric cryptography or key distribution centers) are proven undesirable for resource-limited sensor nodes. So far, several key distribution schemes have been proposed to solve key management problems. In this paper, we propose a matrix-based random key pre-distribution scheme, which uses simple linear algebraic operations to derive common keys and is shown to be better resilient against node collusion than certain existing schemes.

Published in:

Computer and Information Technology, 2007. CIT 2007. 7th IEEE International Conference on

Date of Conference:

16-19 Oct. 2007