A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks
Yi Jiang, Shi Hao-shan · Journal of Electronic Science and Technology · 2008
In recent years, several random key pre- distribution schemes have been proposed to bootstrap keys for encryption, but the problem of key and node revocation has received relatively little attention. In this paper, based on a random key pre-distribution scheme using clustering, we present a novel random key revoca- tion protocol, which is suitable for large scale networks greatly and removes compromised information efficiently. The revocation protocol can guarantee network security by using less memory consumption and communication load, and combined by centralized and distributed revoca- tion, having virtues of timeliness and veracity for revoca- tion at the same time. protocol, which is unsuitable for random key pre-distribution schemes. In this paper, we present a novel random key revocation protocol based on a random key pre-distribution scheme using clustering. The revocation protocol is suitable for large scale networks greatly and removes compromised informa- tion efficiently. Because the network topology is a two-level hierarchical, we consider the revocation protocol from two aspects: in a cluster and between clusters. In a cluster, the revocation protocol is combined by centralized and distri- buted revocation with virtues of timeliness and veracity. Between clusters, the revocation protocol can guarantee network security by using less memory consumption and communication load. In addition, we also propose a special method to set up secure links for any two clusters, which is a high point in the paper, except for the revocation protocol. The remainder of the paper is organized as follows. A random key pre-distribution scheme is described in Section 2. Section 3 details the cluster-based random key revocation protocol from two aspects: in a cluster and between clusters. Finally, our concluding remark is exposed in Section 4.