By Topic

Key Predistribution Approach in Wireless Sensor Networks Using LU Matrix

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)
Hangyang Dai ; Sch. of Autom. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Hongbing Xu

To achieve secure communication between sensor nodes in wireless sensor networks (WSNs), it is important to be able to establish efficient key predistribution mechanisms. Here, a matrix-based key predistribution scheme for WSN is presented, as shown in the following process. First, LU matrix-based method is employed to decompose the polynomial pool, which substitutes for the key pool to establish the shared keys. Second, the shared key is computed by the shared polynomial. Third, we can always compute the common polynomial with mutual authentication. The analysis indicates that the proposed scheme allows 100% connectivity regardless of the number of keys. To evaluate the efficiency of the network-wide memory overhead, each row or column of L and U matrices is divided into two parts: nonzero-element part and zero-element part. The results demonstrate that this method provides references for increasing the efficiency of LU matrix-based algorithms. By introducing polynomial-based key predistribtion, the resilience against node capture has been greatly enhanced as well.

Published in:

Sensors Journal, IEEE  (Volume:10 ,  Issue: 8 )