17-03-2014, 06:22 PM
Abstract
An improved LU matrix key-distribution scheme for
wireless sensor networks is proposed. Based on the LU
matrix, the hash function and the clustered structure,
this scheme can delete and update key information with
the network topology changes to avoid key information
to be revealed. Also, this scheme can reduce
communication, computation and key storage
overhead, which can solve the problem that each
sensor node has limited resource. Comparison and
simulation results show that the proposed scheme can
perform better than most of the existing key
management schemes in the network security, key
storage overhead.
Key words—wireless sensor network, key predistribution,
LU matrix, hash function, the clustered
structure
1. Introduction
Wireless sensor networks (WSNs) increasingly
become viable solutions to many challenging problems
in various applications such as military sensing and
tracking, environment monitoring, patient monitoring
and data gathering. But due to some characteristics of
WSNs, any potential adversary may intercept, wiretap,
and counterfeit interrelated information. Therefore,
security is very important to WSNs[1-4]. In the secure
mechanism of WSNs, the key management is the best
basal.
Many key management schemes were developed for
WSNs[3][5]. Based on the framework of WSNs, existing
schemes can be classified into two categories[3]: the flat
distributed architecture such as the basic random predistributed
scheme[6], the q -composite scheme[7], Du’s
scheme[8]; the hierarchical architecture( the clustered
architecture) such as the reliable pairwise key-update
scheme (RPKU)[9],and the improved polynomial key
distribution mechanism(IKDM)[10]. Combining the LU
matrix key pre-distribution scheme[11] and the clustered
structure, this paper proposes a new key scheme.
The rest of this paper is organized as follows.
Section II presents some related work. Section III
describes the proposed scheme. Section IV gives the
security analysis and performance evaluation. The
conclusion is summarized in Section V.
An improved LU matrix key-distribution scheme for
wireless sensor networks is proposed. Based on the LU
matrix, the hash function and the clustered structure,
this scheme can delete and update key information with
the network topology changes to avoid key information
to be revealed. Also, this scheme can reduce
communication, computation and key storage
overhead, which can solve the problem that each
sensor node has limited resource. Comparison and
simulation results show that the proposed scheme can
perform better than most of the existing key
management schemes in the network security, key
storage overhead.
Key words—wireless sensor network, key predistribution,
LU matrix, hash function, the clustered
structure
1. Introduction
Wireless sensor networks (WSNs) increasingly
become viable solutions to many challenging problems
in various applications such as military sensing and
tracking, environment monitoring, patient monitoring
and data gathering. But due to some characteristics of
WSNs, any potential adversary may intercept, wiretap,
and counterfeit interrelated information. Therefore,
security is very important to WSNs[1-4]. In the secure
mechanism of WSNs, the key management is the best
basal.
Many key management schemes were developed for
WSNs[3][5]. Based on the framework of WSNs, existing
schemes can be classified into two categories[3]: the flat
distributed architecture such as the basic random predistributed
scheme[6], the q -composite scheme[7], Du’s
scheme[8]; the hierarchical architecture( the clustered
architecture) such as the reliable pairwise key-update
scheme (RPKU)[9],and the improved polynomial key
distribution mechanism(IKDM)[10]. Combining the LU
matrix key pre-distribution scheme[11] and the clustered
structure, this paper proposes a new key scheme.
The rest of this paper is organized as follows.
Section II presents some related work. Section III
describes the proposed scheme. Section IV gives the
security analysis and performance evaluation. The
conclusion is summarized in Section V.