Key Predistribution Approach in Wireless Sensor Networks Using LU Matrix

• Published in: IEEE sensors journal Vol. 10; no. 8; pp. 1399 - 1409
• Main Authors: Dai, Hangyang, Xu, Hongbing
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2010; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Authentication; Information security; Keys; LU matrix-based; Mathematical analysis; Matrices; Matrix decomposition; Monitoring; Networks; polynomial-based key predistribution; Polynomials; Pools; Protocols; Public key; Resilience; security; Sensors; Studies; Uranium; Wireless communication; Wireless sensor networks; wireless sensor works
• ISSN: 1530-437X; 1558-1748
• DOI: 10.1109/JSEN.2009.2039130

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.