基于中国剩余定理和LU矩阵的传感器网络密钥预分配方案

Key Predistribution Scheme Based on CRT and LU Matrix for Wireless Sensor Networks

针对典型分簇式传感器网络密钥预分配方案连通性和抗毁性差、节点开销大的问题,结合中国剩余定理和LU矩阵提出了一个密钥预分配方案.该方案簇头节点与簇内节点间的通信密钥运用中国剩余定理建立,而簇头节点之间以及簇头节点和基站间的通信密钥采用LU矩阵生成,这样既克服了运用中国剩余定理建立通信密钥的单一性问题,又克服了采用LU矩阵生成通信密钥节点开销大的缺陷.方案支持节点加入与撤销,簇内节点加入与撤销时方案分别满足后向和前向安全性.与典型密钥预分配方案相比,该方案以占用一个密钥存储空间的簇内节点开销和较少的簇头节点开销既实现了网络100%的连通性,又实现了网络完全抗毁性.

Aiming at the shortages of connectivity, resistance and node overheads among traditional key predistribution schemes for heterogeneous sensor networks, a key predistribution scheme combining the Chinese remainder theorem （CRT） with LU matrix was proposed. The CRT is used to secure the commu nication keys between cluster head and its cluster members. The communication keys among cluster heads or between cluster head and base station are generated with LU matrix. The problems that the communica- tion key in any cluster using CRT is sole and that the required overheads is too large using LU matrix are solved. It is shown that node addition and revocation are feasible in the proposed scheme. When the cluster member is added and revoked, the presented scheme is supported with backward-security and forward-se curity, respectively. Compared with several typical schemes, the perfect connectivity is given with one key storage unit required for the whole overheads of the cluster member and small overheads for the clusterhead and the per{ect resistance of networks is guaranteed.