# Key Updating Methods for Combinatorial Design Based Key Management Schemes

Authors: Chonghuan Xu; Weinan Liu
Journal: Journal of Sensors
 (2014)

---

## Abstract

Wireless sensor network (WSN) has become one of the most promising network technologies for many useful applications. However, for the lack of resources, it is different but important to ensure the security of the WSNs. Key management is a corner stone on which to build secure WSNs for it has a fundamental role in confidentiality, authentication, and so on. Combinatorial design theory has been used to generate good-designed key rings for each sensor node in WSNs. A large number of combinatorial design based key management schemes have been proposed but none of them have taken key updating into consideration. In this paper, we point out the essence of key updating for the unital design based key management scheme and propose two key updating methods; then, we conduct performance analysis on the two methods from three aspects; at last, we generalize the two methods to other combinatorial design based key management schemes and enhance the second method.


---

## Body

## 1. Introduction

Wireless sensor network (WSN) is a kind of large wireless network. Generally speaking, WSNs consist of resource-limited sensor nodes with a large number of functions, such as sensing, collecting, and processing, which leads to their ability to fulfill special missions [1]. WSNs have become one of the most promising network technologies, which can be widely used in different applications. Because of the sensitivity of these applications and many issues involved in WSNs, sophisticated security services are required [2]. Key management is a corner stone on which to build secure WSNs, because it is able to protect many services, such as confidentiality and authentication, which are required for secure communication in WSNs. However, the sensor nodes in WSNs are all resource-limited devices. Therefore, key management schemes like Diffie-Hellman based or public-key based schemes, which are widely used in other networks, are not very suitable for the direct application in WSNs [3]. The key management scheme, which uses symmetric encryption technology, is still a hot research topic. Over the last decade, a lot of research works dealt with symmetric key predistribution issue for WSNs and many solutions have been proposed [4–6]. Nevertheless, in most existing solutions, the design of key rings (blocks of keys) strongly depends on the size of the WSNs, which results in either suffering from low scalability or degrading other performance metrics [7].Combinatorial design theory is an important part of combinatorial mathematics. Combinatorial design theory deals with the existence, construction, and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. Combinatorial design theory has been used in many different applications, such as cryptography and secret sharing in literatures [8–10], network design in literatures [11, 12], and key management for WSNs in literatures [7, 13–16]. Since Mitchell and Piper [13] firstly applied combinatorial designs to key distribution, a lot of other combinatorial design based key management schemes have been proposed.Key updating is very important in key management because the more often a key is used, the less secure it will be. To the best of our knowledge, there exists no updating method for combinatorial design based key management scheme. Therefore, we propose two key updating methods to resolve the problem mentioned above.The main contributions of this paper are as follows:(1)
we point out the essence of key updating for combinatorial design based key management schemes which is a multigroup key distribution;
(2)
we propose two key updating methods for the unital design based key management scheme. The two key updating methods can be generalized to other kinds of combinatorial design based key management schemes. The first proposed method is distributed where each sensor node is devoted to key updating and the second one is traditional group key distribution;
(3)
we conduct the performance analysis on our proposed two methods and show their advantages and disadvantages;
(4)
we enrich the application of combinatorial design in key management for WSNs and also point out some future research directions.The remainder of this paper is organized as follows: Section2 presents the related works on combinatorial design based key management scheme for WSNs and shows the importance of key updating. We propose our two methods in Section 3. In Section 4, we conduct the performance analysis on the two methods from three aspects and make some comparison. In Section 5, we discuss our two proposed methods and improve them. Finally, we draw conclusions and point out our future research directions in Section 6.


## 2. Related Work

Mitchell and Piper [13] firstly used combinatorial designs into key distribution. They introduced a number of new concepts and showed how the theory of incidence structures with special properties, called key distribution patterns, may be applied to key management problems. The proposed method is shown to generalize earlier work in the area.Çamtepe and Yener [14] proposed novel deterministic and hybrid schemes based on symmetric balanced incomplete block design (SBIBD) for key predistribution in WSNs. The SBIBD decides how many and what keys are assigned into each key-chain before the WSNs are deployed. After mapping from SBIBD to key predistribution, there are m
2
+
m
+
1 key rings, which contain k
=
m
+
1 keys selected from a key pool S with the size m
2
+
m
+
1. And each pair of two key rings shares exactly one common key. SBIBD which produces better connectivity with smaller key-chain size can make key distribution schemes more efficient. The main strength of the proposed scheme is that each pair of two nodes shares exactly one common key which can obtain total secure connectivity. However, the SBIBD schemes do not have a good scalability for large WSNs because they only generate m
2
+
m
+
1 key rings to obtain a key ring with m
+
1 keys, while the former are determined by the properties of SBIBD.Ruj and Roy [15] also used SBIBD to guarantee intraregion secure communications in grid group WSNs. In grid group WSNs, all nodes within a particular region can link to each other directly. While sensor nodes in different regions can make use of more special resource nodes to communicate with each other. Taking the Lee distance into account, they consider the resiliency not only in terms of fraction of links broken, but also in terms of the number of nodes and regions disconnected when some sensors are compromised. But the deterministic key predistribution schemes will lead to constant-time computation cost for shared key discovery and path key establishment.Basic schemes like [17] have perfect network resilience but their network scalability is only O
(
k
) where k is the key ring size. The SBIBD [15] and the trade [16] based ones obtain a network scalability of O
(
k
2
). The solutions proposed in [13] elevate the network scalability up to O
(
k
4
) without losing secure connectivity coverage and overall performances. The researchers apply the unital design into predistribution. They propose two schemes, a basic one and an enhanced one, which achieve a good tradeoff between scalability and connectivity.Combinatorial design based key management schemes obtain a lot of attentions. However, to the best of our knowledge, none of the related works have taken key updating into consideration. Without key updating, the key management schemes will be less secure as time passes. In this paper, we point out the essence of key updating for combinatorial design based key management scheme and then put up our two different kinds of key updating methods.


## 3. The Proposed Schemes

In this section, first we briefly introduce the unital design based key management scheme [7]. The brief introduction consists of unital design and its mapping to key predistribution. Then, we point out the essence of the key updating for the unital design based key management scheme. At last, we propose two key updating methods.


### 3.1. Unital Based Key Management Scheme

#### 3.1.1. Background: Unital Design

Combinatorial design theory is a part of combinatorial mathematics dealing with the existence, construction, and properties of the systems which consist of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. At-design (
ν
,
b
,
r
,
k
,
λ
) is defined as follows: given a finite set X of  ν points (elements), we construct a family of b subsets from the finite set X, called blocks, such that each block has a certain number of points, which is k, each point is contained in r blocks, and t points are contained together in exactly  λ blocks [13]. A unital design is a Steiner 2-design, where ν
=
m
3
+
1, b
=
m
2
(
m
3
+
1
)
/
(
m
+
1
) = m
2
(
m
2
-
m
+
1
)
,
r
=
m
2
,
k
=
m
+
1, and λ
=
1. We call the unital design 2−design (
m
3
+
1
,
m
2
(
m
2
-
m
+
1
)
,
m
2
,
m
+
1
,
1
), or (
m
3
+
1
,
m
+
1
,
1
) in short form.Here is an example of a 2-(9,3,1) unital design withm
=
2 shown in Table 1.Table 1
An example of a 2-(9,3,1) unital design.
B
1
B
2
B
3
B
4
B
5
B
6
B
7
B
8
B
9
B
10
B
11
B
12
E
1
1
1
1
1
E
2
2
2
2
2
E
3
3
3
3
3
E
4
4
4
4
4
E
5
5
5
5
5
E
6
6
6
6
6
E
7
7
7
7
7
E
8
8
8
8
8
E
9
9
9
9
9We can see from Table1 that there are 12 blocks, B
1
,
…
,
B
12, in the above example, and 9 elements E
1
,
…
,
E
9 are 1,2
,
…
,
9, respectively. In addition, we can find that every block has 3 elements; for example, B
1 has 3 elements, E
1, E
4, and E
8; each element is contained in 4 blocks; for example, E
1 is contained in B
1, B
6, B
7, and B
11, and each pair of 2 elements together is contained in exactly 1 block; for example, E
1 and E
4 together are contained only in B
1.


#### 3.1.2. A Basic Mapping from Unital to Key Predistribution for WSNs

Each block which hasm
+
1 points can be mapped into a sensor node in WSNs while each point can be mapped to a key. Note that point can also be called element in combinatorial design. The following table, Table 2, shows the basic mapping from unital design to key predistribution for WSNs.Table 2
The mapping from unital to key predistribution.
Unital design
Key predistribution
X: element set
S: key pool
Size of the object setX: ν
=
m
3
+
1
The number of keys|
S
|
=
m
3
+
1
Blocks
Key rings
Size of blockX:
The number of keys of each ring hasX: l
=
m
3
+
1
Number of generated blocks
b
=
m
2
(
m
2
-
m
+
1
)
Number of generated key rings (supported nodes)
n
=
m
2
(
m
2
-
m
+
1
)
Each point belongs to exactlym
2 blocks
Each key appears in exactlym
2 key ringsThe key distribution center (KDC) generates the unital blocks (key rings) and loads them to the memory of sensor nodes before these sensor nodes are deployed. Each distinct key ring will be preloaded in only one node, along with the corresponding key identifiers. When two nodes want to communicate with each other, they will exchange their key identifiers. According to their key identifiers, they can decide the communication key or they need to establish a secure path for communication. In the basic unital design mapping, each pair of two nodes shares at most one common key. Therefore, if two nodes have a common key, after exchanging the key identifiers, they will be able to determine this common key, or if two nodes do not have a common key, they need the help of other nodes to establish secure paths.


### 3.2. System Model for WSNs and Updating Model for Each Sensor

We can see from the generalized definition of the unital design (a 2-design(
m
3
+
1, m
2
(
m
2
-
m
+
1
)
,
m
2
,
m
+
1
,
1
)
) that there are m
3
+
1 keys and m
2
(
m
2
-
m
+
1
) sensor nodes. In addition, the definition of the unital design shows that each key is contained in m
2 sensor nodes and each sensor node has m
+
1 keys. We can regard all the sensor nodes which have the same key as a group; therefore, there will be m
3
+
1 group, and in each group there will be m
2 sensor nodes. Furthermore, each sensor node belongs to m
+
1 groups because it has m
+
1 keys.Therefore, the system model can be described in the following two formulas:(1)
G
i
⟶
k
i
:
n
i
1
,
n
i
2
,
…
,
n
i
m
2
where
i
=
m
3
+
1
,
n
i
:
k
i
1
,
k
i
2
,
…
,
k
i
(
m
+
1
)
where
j
=
m
2
×
(
m
2
-
m
+
1
)
.The first formula shows that the system model consists ofm
3
+
1 groups. Each group corresponds to a key and there are m
2 sensor nodes in each group which is marked by the key ID. Note that G
i
∩
G
j
=
1 because, in a unital design, each pair of 2 elements is contained together in exactly 1 block.The second formula points out that the system model is made up ofm
2
(
m
2
-
m
+
1
) sensor nodes and each sensor node n
i has m
+
1 keys. The m
+
1 keys can be defined as a key ring or a key block, B
i. Note that two nodes have one common key or not because in one unital design, each pair of B
i and B
i has the relationship that |
B
i
∩
B
j
|
=
0 or 1.According to the above system model, we can obtain the key updating model as each sensor node updates all itsm
+
1 keys. For each of sensor nodesn
i, the updating model can be described as in Figure 1.Figure 1
The updating model for each sensor.Figure1 shows the key updating model for each sensor. We can see, from it, sensor node n
i has m
+
1 keys k
i
1
,
k
i
2
,
…
,
k
i
(
m
+
1
). If it wants to update k
i
1, it will need to communicate with the other m
3 sensor nodes in G
1 that share the same key k
i
1 with it, and by some methods, the new updated key k
i
1 can be obtained by all the sensor nodes in the G
1. As each sensor node n
i has m
+
1 keys, it needs to communicate with other groups like what it does with G
1 to update all its other keys.We can see from the updating model for each of sensor nodes that the essence of key updating for the unital design based key management scheme is multigroup key management.In the following subsection, we propose two key updating methods for the unital design based key management scheme, the first one is distributed which means each sensor node in the group is devoted to updating the group key, while in the second one, there is a group manager in each group distributing the broadcast to update the group key.


### 3.3. The First Key Updating Method

In this method, each sensor node is predistributed with a device ID, that is,id
n
i,m
+
1 keys, and m
+
1 corresponding key ID. In addition, each sensor node also stores the corresponding ID of sensor nodes in each group which is made up of the corresponding key. Table 3 shows the detail of the content which each sensor node should store in the first method.Table 3
The content which each sensor node stores.
Content
i
d
n
i
k
i
1
,
i
d
k
i
1
,
i
d
n
11
,
n
12
,
…
,
n
1
m
2
/
n
i
k
i
2
,
i
d
k
i
2
,
i
d
n
21
,
n
22
,
…
,
n
2
m
2
/
n
i
⋮
k
i
(
m
+
1
)
,
i
d
k
i
(
m
+
1
)
,
i
d
n
(
m
+
1
)
1
,
n
(
m
+
1
)
2
,
…
,
n
(
m
+
1
)
m
2
/
n
iIn this method, to update one key, each sensor node will send a random number which is encrypted by the group key to other sensor nodes in the same group. And then, it will receive a certain number of messages which also contain random numbers from other sensor nodes. The number of the messages is determined by the number of legal sensor nodes in the group. For the sensorn
i, it updates one of its keys, k
i
1, as the following steps.Step 1.
Considern
i
→
n
11
,
n
12
,
…
,
n
1
m
2
/
n
i
∈
G
1: id
k
i
1|id
n
i|k
i
1 (RN
i).
In this step, sensor noden
i broadcasts the message id
k
i
1|id
n
i|k
i
1 (RN
i) to other sensor nodes which have the same group key k
i
1. Here, id
k
i
1 is the id of the key which needs to be updated; id
n
i is the ID of the sensor node and k
i
1 (RN
i) which is the decrypted RN
i.Step 2.
Sensorn
i receives broadcast message from other senor nodes. If the first part of the broadcast message, id
k
i
1, is also contained in the content of sensor n
i, and the ID of that sensor node (the sender of the broadcast message), id
n
i, is in the same key group, then it begins to receive the whole broadcast message. In order to compute the new updating key, it needs to receive a certain number (the number of other legal sensor nodes in the same key group). Note that after one node has used up its energy, it will inform other nodes in the same key group to delete its id. Therefore, the number of the broadcast messages which a sensor node needs to receive for computing the group key will decrease when the time goes. Note that these messages contain other RN generated by other sensor nodes in the same key group.Step 3.
After it receivesl messages for updating the key, it computes the new updated key as the following equation:
(2)
k
i
1
′
=
h
(
R
N
1
|
R
N
2
|
⋯
|
R
N
l
)
.
Herel
(
l
≤
m
3
+
1
) is the number of legal nodes. The order of each RN
i is decided by the ID of the sender which is set before deployment.
As each senor node hasm
+
1 keys, it needs to do the above steps m
+
1 times to update all its m
+
1 keys. When a sensor node is about to use up its energy, it will send a revocation message to other sensor nodes to inform them to delete the corresponding information about it in the key groups. In addition, if a node is detected as a promised sensor node, the detector will inform other nodes to delete the corresponding information about the promised node. The detector will ask other sensor nodes to update the corresponding keys the promised node has.


### 3.4. The Second Key Updating Method

In the first method, all the sensor nodes are distributed and are all responsible for the generation of the new key, while in the second key updating method, only one sensor node which is defined as group manager (GM) is responsible for the generation of a new key.In this key updating method, the GM stores the same content as the content each sensor node stores in the first method. Each member sensor node is predistributed with a device IDid
n
i, m
+
1 keys, and m
+
1 corresponding key ID. Note that in this scheme, each sensor node does not store the identifiers of other senor nodes. Table 4 shows the detail of the content which the group member sensor nodes store.Table 4
The content which the member sensor nodes store.
Content
i
d
n
i
k
i
1
,
i
d
k
i
1
k
i
2
,
i
d
k
i
2
⋮
k
i
(
m
+
1
)
,
i
d
k
i
(
m
+
1
)We can see from Table4 that this method is more efficient in storage overhead because each member sensor node stores less content than that of the first method. The second method is based on the group key distribution. Therefore, there are two kinds of sensor nodes in the system: the GM and the member sensor nodes. In this method, to update one key, the GM needs to generate the broadcast and each member sensor node can compute the group key after receiving the whole broadcast.The GM generates and sends the broadcast as the following steps.Step 1.
The GM generates the authentication polynomial as the following equation:(3)
a
j
(
x
)
=
∏
i
=
1
l
(
x
-
x
i
)
;
lis the number of legal member sensor nodes (except the GM and revoked sensor nodes), and l
≤
m
3.Step 2.
The GM generates the key updating polynomial as follows:(4)
P
j
(
x
)
=
k
u
j
+
a
j
(
x
)
;
ku
j is the key updating material.Step 3.
The GM generates the broadcast and sends it. The construction of the broadcast is as follows:(5)
B
j
(
x
)
=
i
d
k
∩
P
j
(
x
)
.
We can see from (5) that the broadcast consists of two parts. The first part is id
k, the ID of the key which needs to be updated. And the second part is the key updating polynomial P
j
(
x
) which is generated in the second step.
Each sensor node (except for the GM) receives the first part of the broadcast and decides whether it needs to receive the whole broadcast according to theID of the key,id
k. If it has this key (also has this key ID), then it receives the whole broadcast and computes the corresponding key updating information according to the broadcast; otherwise, it waits for the next broadcast. The key updating information can be computed as the following equation:
(6)
ku
j
′
=
P
j
(
x
)
=
k
u
j
+
a
j
(
x
i
)
=
k
u
j
+
0
=
k
u
j
.
Each legal member node will get the computation result of 0 when computing the authentication polynomiala
j
(
x
i
). Therefore, all the legal member nodes will get the same key update information ku
j from the above equation while other revoked sensor nodes will obtain value of a
j
(
x
i
). The different value a
j
(
x
i
) will lead to different key updating information ku
j. And then each legal member sensor node uses the key update information to update the group key as the following equation:
(7)
k
i
1
′
=
h
(
k
u
j
∣
k
i
1
)
.
Note that all the legal member nodes can compute the same updated key because these legal member nodes have the same group keyk
i
1 and use the same key updating information ku
j to update the group key.


## 3.1. Unital Based Key Management Scheme

### 3.1.1. Background: Unital Design

Combinatorial design theory is a part of combinatorial mathematics dealing with the existence, construction, and properties of the systems which consist of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. At-design (
ν
,
b
,
r
,
k
,
λ
) is defined as follows: given a finite set X of  ν points (elements), we construct a family of b subsets from the finite set X, called blocks, such that each block has a certain number of points, which is k, each point is contained in r blocks, and t points are contained together in exactly  λ blocks [13]. A unital design is a Steiner 2-design, where ν
=
m
3
+
1, b
=
m
2
(
m
3
+
1
)
/
(
m
+
1
) = m
2
(
m
2
-
m
+
1
)
,
r
=
m
2
,
k
=
m
+
1, and λ
=
1. We call the unital design 2−design (
m
3
+
1
,
m
2
(
m
2
-
m
+
1
)
,
m
2
,
m
+
1
,
1
), or (
m
3
+
1
,
m
+
1
,
1
) in short form.Here is an example of a 2-(9,3,1) unital design withm
=
2 shown in Table 1.Table 1
An example of a 2-(9,3,1) unital design.
B
1
B
2
B
3
B
4
B
5
B
6
B
7
B
8
B
9
B
10
B
11
B
12
E
1
1
1
1
1
E
2
2
2
2
2
E
3
3
3
3
3
E
4
4
4
4
4
E
5
5
5
5
5
E
6
6
6
6
6
E
7
7
7
7
7
E
8
8
8
8
8
E
9
9
9
9
9We can see from Table1 that there are 12 blocks, B
1
,
…
,
B
12, in the above example, and 9 elements E
1
,
…
,
E
9 are 1,2
,
…
,
9, respectively. In addition, we can find that every block has 3 elements; for example, B
1 has 3 elements, E
1, E
4, and E
8; each element is contained in 4 blocks; for example, E
1 is contained in B
1, B
6, B
7, and B
11, and each pair of 2 elements together is contained in exactly 1 block; for example, E
1 and E
4 together are contained only in B
1.


### 3.1.2. A Basic Mapping from Unital to Key Predistribution for WSNs

Each block which hasm
+
1 points can be mapped into a sensor node in WSNs while each point can be mapped to a key. Note that point can also be called element in combinatorial design. The following table, Table 2, shows the basic mapping from unital design to key predistribution for WSNs.Table 2
The mapping from unital to key predistribution.
Unital design
Key predistribution
X: element set
S: key pool
Size of the object setX: ν
=
m
3
+
1
The number of keys|
S
|
=
m
3
+
1
Blocks
Key rings
Size of blockX:
The number of keys of each ring hasX: l
=
m
3
+
1
Number of generated blocks
b
=
m
2
(
m
2
-
m
+
1
)
Number of generated key rings (supported nodes)
n
=
m
2
(
m
2
-
m
+
1
)
Each point belongs to exactlym
2 blocks
Each key appears in exactlym
2 key ringsThe key distribution center (KDC) generates the unital blocks (key rings) and loads them to the memory of sensor nodes before these sensor nodes are deployed. Each distinct key ring will be preloaded in only one node, along with the corresponding key identifiers. When two nodes want to communicate with each other, they will exchange their key identifiers. According to their key identifiers, they can decide the communication key or they need to establish a secure path for communication. In the basic unital design mapping, each pair of two nodes shares at most one common key. Therefore, if two nodes have a common key, after exchanging the key identifiers, they will be able to determine this common key, or if two nodes do not have a common key, they need the help of other nodes to establish secure paths.


## 3.1.1. Background: Unital Design

Combinatorial design theory is a part of combinatorial mathematics dealing with the existence, construction, and properties of the systems which consist of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. At-design (
ν
,
b
,
r
,
k
,
λ
) is defined as follows: given a finite set X of  ν points (elements), we construct a family of b subsets from the finite set X, called blocks, such that each block has a certain number of points, which is k, each point is contained in r blocks, and t points are contained together in exactly  λ blocks [13]. A unital design is a Steiner 2-design, where ν
=
m
3
+
1, b
=
m
2
(
m
3
+
1
)
/
(
m
+
1
) = m
2
(
m
2
-
m
+
1
)
,
r
=
m
2
,
k
=
m
+
1, and λ
=
1. We call the unital design 2−design (
m
3
+
1
,
m
2
(
m
2
-
m
+
1
)
,
m
2
,
m
+
1
,
1
), or (
m
3
+
1
,
m
+
1
,
1
) in short form.Here is an example of a 2-(9,3,1) unital design withm
=
2 shown in Table 1.Table 1
An example of a 2-(9,3,1) unital design.
B
1
B
2
B
3
B
4
B
5
B
6
B
7
B
8
B
9
B
10
B
11
B
12
E
1
1
1
1
1
E
2
2
2
2
2
E
3
3
3
3
3
E
4
4
4
4
4
E
5
5
5
5
5
E
6
6
6
6
6
E
7
7
7
7
7
E
8
8
8
8
8
E
9
9
9
9
9We can see from Table1 that there are 12 blocks, B
1
,
…
,
B
12, in the above example, and 9 elements E
1
,
…
,
E
9 are 1,2
,
…
,
9, respectively. In addition, we can find that every block has 3 elements; for example, B
1 has 3 elements, E
1, E
4, and E
8; each element is contained in 4 blocks; for example, E
1 is contained in B
1, B
6, B
7, and B
11, and each pair of 2 elements together is contained in exactly 1 block; for example, E
1 and E
4 together are contained only in B
1.


## 3.1.2. A Basic Mapping from Unital to Key Predistribution for WSNs

Each block which hasm
+
1 points can be mapped into a sensor node in WSNs while each point can be mapped to a key. Note that point can also be called element in combinatorial design. The following table, Table 2, shows the basic mapping from unital design to key predistribution for WSNs.Table 2
The mapping from unital to key predistribution.
Unital design
Key predistribution
X: element set
S: key pool
Size of the object setX: ν
=
m
3
+
1
The number of keys|
S
|
=
m
3
+
1
Blocks
Key rings
Size of blockX:
The number of keys of each ring hasX: l
=
m
3
+
1
Number of generated blocks
b
=
m
2
(
m
2
-
m
+
1
)
Number of generated key rings (supported nodes)
n
=
m
2
(
m
2
-
m
+
1
)
Each point belongs to exactlym
2 blocks
Each key appears in exactlym
2 key ringsThe key distribution center (KDC) generates the unital blocks (key rings) and loads them to the memory of sensor nodes before these sensor nodes are deployed. Each distinct key ring will be preloaded in only one node, along with the corresponding key identifiers. When two nodes want to communicate with each other, they will exchange their key identifiers. According to their key identifiers, they can decide the communication key or they need to establish a secure path for communication. In the basic unital design mapping, each pair of two nodes shares at most one common key. Therefore, if two nodes have a common key, after exchanging the key identifiers, they will be able to determine this common key, or if two nodes do not have a common key, they need the help of other nodes to establish secure paths.


## 3.2. System Model for WSNs and Updating Model for Each Sensor

We can see from the generalized definition of the unital design (a 2-design(
m
3
+
1, m
2
(
m
2
-
m
+
1
)
,
m
2
,
m
+
1
,
1
)
) that there are m
3
+
1 keys and m
2
(
m
2
-
m
+
1
) sensor nodes. In addition, the definition of the unital design shows that each key is contained in m
2 sensor nodes and each sensor node has m
+
1 keys. We can regard all the sensor nodes which have the same key as a group; therefore, there will be m
3
+
1 group, and in each group there will be m
2 sensor nodes. Furthermore, each sensor node belongs to m
+
1 groups because it has m
+
1 keys.Therefore, the system model can be described in the following two formulas:(1)
G
i
⟶
k
i
:
n
i
1
,
n
i
2
,
…
,
n
i
m
2
where
i
=
m
3
+
1
,
n
i
:
k
i
1
,
k
i
2
,
…
,
k
i
(
m
+
1
)
where
j
=
m
2
×
(
m
2
-
m
+
1
)
.The first formula shows that the system model consists ofm
3
+
1 groups. Each group corresponds to a key and there are m
2 sensor nodes in each group which is marked by the key ID. Note that G
i
∩
G
j
=
1 because, in a unital design, each pair of 2 elements is contained together in exactly 1 block.The second formula points out that the system model is made up ofm
2
(
m
2
-
m
+
1
) sensor nodes and each sensor node n
i has m
+
1 keys. The m
+
1 keys can be defined as a key ring or a key block, B
i. Note that two nodes have one common key or not because in one unital design, each pair of B
i and B
i has the relationship that |
B
i
∩
B
j
|
=
0 or 1.According to the above system model, we can obtain the key updating model as each sensor node updates all itsm
+
1 keys. For each of sensor nodesn
i, the updating model can be described as in Figure 1.Figure 1
The updating model for each sensor.Figure1 shows the key updating model for each sensor. We can see, from it, sensor node n
i has m
+
1 keys k
i
1
,
k
i
2
,
…
,
k
i
(
m
+
1
). If it wants to update k
i
1, it will need to communicate with the other m
3 sensor nodes in G
1 that share the same key k
i
1 with it, and by some methods, the new updated key k
i
1 can be obtained by all the sensor nodes in the G
1. As each sensor node n
i has m
+
1 keys, it needs to communicate with other groups like what it does with G
1 to update all its other keys.We can see from the updating model for each of sensor nodes that the essence of key updating for the unital design based key management scheme is multigroup key management.In the following subsection, we propose two key updating methods for the unital design based key management scheme, the first one is distributed which means each sensor node in the group is devoted to updating the group key, while in the second one, there is a group manager in each group distributing the broadcast to update the group key.


## 3.3. The First Key Updating Method

In this method, each sensor node is predistributed with a device ID, that is,id
n
i,m
+
1 keys, and m
+
1 corresponding key ID. In addition, each sensor node also stores the corresponding ID of sensor nodes in each group which is made up of the corresponding key. Table 3 shows the detail of the content which each sensor node should store in the first method.Table 3
The content which each sensor node stores.
Content
i
d
n
i
k
i
1
,
i
d
k
i
1
,
i
d
n
11
,
n
12
,
…
,
n
1
m
2
/
n
i
k
i
2
,
i
d
k
i
2
,
i
d
n
21
,
n
22
,
…
,
n
2
m
2
/
n
i
⋮
k
i
(
m
+
1
)
,
i
d
k
i
(
m
+
1
)
,
i
d
n
(
m
+
1
)
1
,
n
(
m
+
1
)
2
,
…
,
n
(
m
+
1
)
m
2
/
n
iIn this method, to update one key, each sensor node will send a random number which is encrypted by the group key to other sensor nodes in the same group. And then, it will receive a certain number of messages which also contain random numbers from other sensor nodes. The number of the messages is determined by the number of legal sensor nodes in the group. For the sensorn
i, it updates one of its keys, k
i
1, as the following steps.Step 1.
Considern
i
→
n
11
,
n
12
,
…
,
n
1
m
2
/
n
i
∈
G
1: id
k
i
1|id
n
i|k
i
1 (RN
i).
In this step, sensor noden
i broadcasts the message id
k
i
1|id
n
i|k
i
1 (RN
i) to other sensor nodes which have the same group key k
i
1. Here, id
k
i
1 is the id of the key which needs to be updated; id
n
i is the ID of the sensor node and k
i
1 (RN
i) which is the decrypted RN
i.Step 2.
Sensorn
i receives broadcast message from other senor nodes. If the first part of the broadcast message, id
k
i
1, is also contained in the content of sensor n
i, and the ID of that sensor node (the sender of the broadcast message), id
n
i, is in the same key group, then it begins to receive the whole broadcast message. In order to compute the new updating key, it needs to receive a certain number (the number of other legal sensor nodes in the same key group). Note that after one node has used up its energy, it will inform other nodes in the same key group to delete its id. Therefore, the number of the broadcast messages which a sensor node needs to receive for computing the group key will decrease when the time goes. Note that these messages contain other RN generated by other sensor nodes in the same key group.Step 3.
After it receivesl messages for updating the key, it computes the new updated key as the following equation:
(2)
k
i
1
′
=
h
(
R
N
1
|
R
N
2
|
⋯
|
R
N
l
)
.
Herel
(
l
≤
m
3
+
1
) is the number of legal nodes. The order of each RN
i is decided by the ID of the sender which is set before deployment.
As each senor node hasm
+
1 keys, it needs to do the above steps m
+
1 times to update all its m
+
1 keys. When a sensor node is about to use up its energy, it will send a revocation message to other sensor nodes to inform them to delete the corresponding information about it in the key groups. In addition, if a node is detected as a promised sensor node, the detector will inform other nodes to delete the corresponding information about the promised node. The detector will ask other sensor nodes to update the corresponding keys the promised node has.


## 3.4. The Second Key Updating Method

In the first method, all the sensor nodes are distributed and are all responsible for the generation of the new key, while in the second key updating method, only one sensor node which is defined as group manager (GM) is responsible for the generation of a new key.In this key updating method, the GM stores the same content as the content each sensor node stores in the first method. Each member sensor node is predistributed with a device IDid
n
i, m
+
1 keys, and m
+
1 corresponding key ID. Note that in this scheme, each sensor node does not store the identifiers of other senor nodes. Table 4 shows the detail of the content which the group member sensor nodes store.Table 4
The content which the member sensor nodes store.
Content
i
d
n
i
k
i
1
,
i
d
k
i
1
k
i
2
,
i
d
k
i
2
⋮
k
i
(
m
+
1
)
,
i
d
k
i
(
m
+
1
)We can see from Table4 that this method is more efficient in storage overhead because each member sensor node stores less content than that of the first method. The second method is based on the group key distribution. Therefore, there are two kinds of sensor nodes in the system: the GM and the member sensor nodes. In this method, to update one key, the GM needs to generate the broadcast and each member sensor node can compute the group key after receiving the whole broadcast.The GM generates and sends the broadcast as the following steps.Step 1.
The GM generates the authentication polynomial as the following equation:(3)
a
j
(
x
)
=
∏
i
=
1
l
(
x
-
x
i
)
;
lis the number of legal member sensor nodes (except the GM and revoked sensor nodes), and l
≤
m
3.Step 2.
The GM generates the key updating polynomial as follows:(4)
P
j
(
x
)
=
k
u
j
+
a
j
(
x
)
;
ku
j is the key updating material.Step 3.
The GM generates the broadcast and sends it. The construction of the broadcast is as follows:(5)
B
j
(
x
)
=
i
d
k
∩
P
j
(
x
)
.
We can see from (5) that the broadcast consists of two parts. The first part is id
k, the ID of the key which needs to be updated. And the second part is the key updating polynomial P
j
(
x
) which is generated in the second step.
Each sensor node (except for the GM) receives the first part of the broadcast and decides whether it needs to receive the whole broadcast according to theID of the key,id
k. If it has this key (also has this key ID), then it receives the whole broadcast and computes the corresponding key updating information according to the broadcast; otherwise, it waits for the next broadcast. The key updating information can be computed as the following equation:
(6)
ku
j
′
=
P
j
(
x
)
=
k
u
j
+
a
j
(
x
i
)
=
k
u
j
+
0
=
k
u
j
.
Each legal member node will get the computation result of 0 when computing the authentication polynomiala
j
(
x
i
). Therefore, all the legal member nodes will get the same key update information ku
j from the above equation while other revoked sensor nodes will obtain value of a
j
(
x
i
). The different value a
j
(
x
i
) will lead to different key updating information ku
j. And then each legal member sensor node uses the key update information to update the group key as the following equation:
(7)
k
i
1
′
=
h
(
k
u
j
∣
k
i
1
)
.
Note that all the legal member nodes can compute the same updated key because these legal member nodes have the same group keyk
i
1 and use the same key updating information ku
j to update the group key.


## 4. Performance Analysis

In this section, we conduct the performance analysis on the two different kinds of key updating methods. As the sensor nodes in WSNs are all resource-limited devices, we take the following three aspects into consideration: storage, computation, and communication overhead.


### 4.1. Storage Overhead

Table5 shows the storage overhead of the sensor devices in the proposed two methods.Table 5
The storage overhead of the two methods.
id
Key
The sensor node in the first method
m
4
+
m
3
+
m
+
2
m
+
1
The sensor node in the second method
m
+
2
m
+
1In the first method, each sensor node stores its own device ID, andm
+
1 group information which contains one key, one key ID, and other m
3 IDs of other sensor nodes is in the same group. Therefore, the total ID number which each sensor node stores is (
m
3
+
1
)
(
m
+
1
)
+
1
=
m
4
+
m
3
+
m
+
2 and the total number of keys is m
+
1.In the second method, the GM has the same storage overhead as the first method; however, each member sensor node only needs to store its device ID andm
+
1 group information. The group information consists of one key and one key ID. Therefore, the total ID number which each member sensor node stores is (
m
+
1
)
+
1
=
m
+
2, and the total number of keys is also m
+
1, the same as the first method.We can see from Table5 that the second method is more efficient in storage overhead than the first method. Therefore, when the sensor nodes in WSNs are more limited in memory, the second method would be preferable.


### 4.2. Computation Overhead

Table6 shows the computation overhead of the sensor devices in the proposed two methods.Table 6
The computation operation of the two methods.
Generate RN
Poly generation
Poly evaluation
Hash
The sensor node in the first method
1
0
0
m
+
1
The GM in the second method
1
1
0
m
+
1
The sensor node in the second method
0
0
m
+
1
m
+
1In the first method, each sensor node needs to generate a random number RN and dom
+
1 hash to update its m
+
1 keys.In the second method, the GM needs to generate a random number, that is, the updating information, and al-degree polynomial while other sensor nodes need to do m
+
1 polynomial evaluation operations to obtain m
+
1 updating information. Both the GM and the member sensor nodes need to operate m
+
1 hash to update its m
+
1 keys.As all the sensor nodes in both methods havem
+
1 hash operations (when lengths of the content n and n
m are small, the time required for hash operations, for example, md5 and sha1, is not obviously different compared with that of polynomial operations which need a large number of loops. For example, the time required for hashing 64-bit data by md5 in java is 1 ms while hashing 64000 bits is about 19 ms); we can compare them from the previous three items: Generate RN, Poly generation, and Poly evaluation. The first method is much more efficient in computation overhead because the Generate RN operation is much more efficient in computation than that of the Poly operation in the second method. Therefore, when the sensor nodes in WSNs are more limited in computation ability, the first method would be preferable.


### 4.3. Communication Overhead

Table7 shows the communication overhead of the sensor devices in the proposed two methods.Table 7
The communication overhead of the two methods.
id
RN
Poly
The sensor node in the first method
2
(
m
3
+
1
)
(
m
+
1
)
(
m
3
+
1
)
(
m
+
1
)
0
The sensor node in the second method
m
+
1
0
m
+
1Table7 shows the communication overhead of the devices in two methods. In the first key updating method, in order to update one key, a sensor node needs to send a message which contains two IDs and one encrypted random number and will receive m
3 messages from other m
3 nodes in the same key group. The communication overhead for updating one key is 2
(
m
3
+
1
) IDs and m
3
+
1 random numbers. Therefore, for each of sensor nodes to update all its m
+
1 keys, the total communication overhead is 2
(
m
3
+
1
)
(
m
+
1
) ID and (m
3
+
1)(m
+
1) random numbers.In the second method, the GM needs to send (while the other sensor nodes need to receive) the broadcast which contains the ID of the key and al-degree polynomial (l
≤
m
3
+
1). Therefore, the total communication overhead of the GM and each member sensor node are both m
+
1 keys and m
+
1
l-degree polynomials. Here, we take into consideration the largest communication overhead of each sensor node; therefore, the number of legal sensor nodes or the degree of the authentication polynomial, l, is set as m
3 (m
3
+
1 member sensor nodes except the GM itself). Because each sensor node needs to update all its m
+
1 keys, the total communication overhead is m
+
1 ID and m
+
1
m
3-degree polynomials.Here, we define all the IDs, RNs, and coefficients of the polynomial AS belonging toFp. Therefore, the communication overhead of the two methods can be concluded in Table 8.Table 8
The communication overhead of the two methods.
The sensor node in the first method
3
(
m
3
+
1
)
(
m
+
1
)
log
⁡
p
The sensor node in the second method
(
m
3
+
1
)
(
m
+
1
)
log
⁡
pTable8 shows that the second method is more efficient than the first method in communication overhead. Therefore, when the sensor nodes in WSNs are more limited in energy, the second method is preferred.


### 4.4. Comparison between the Two Methods

We can draw a conclusion from the above three subsections that the first method is better in computation while the second method is more efficient in storage and communication. In addition, the second method is more energy saving because the energy cost is linked to communication overhead (communication needs more energy than the calculation) [18]. However, the first method is more secure because in the first second the capture of one sensor node will not affect the whole WSNs with the help of other security technologies such as IDS (intrusion detect system), while in the second method, the capture of the GM will affect the whole WSNs. Note that the capture of the member sensor nodes will not affect the WSNs. In conclusion, as each proposed method has its own strong points and weak points, we should choose different key updating method for different applications.


## 4.1. Storage Overhead

Table5 shows the storage overhead of the sensor devices in the proposed two methods.Table 5
The storage overhead of the two methods.
id
Key
The sensor node in the first method
m
4
+
m
3
+
m
+
2
m
+
1
The sensor node in the second method
m
+
2
m
+
1In the first method, each sensor node stores its own device ID, andm
+
1 group information which contains one key, one key ID, and other m
3 IDs of other sensor nodes is in the same group. Therefore, the total ID number which each sensor node stores is (
m
3
+
1
)
(
m
+
1
)
+
1
=
m
4
+
m
3
+
m
+
2 and the total number of keys is m
+
1.In the second method, the GM has the same storage overhead as the first method; however, each member sensor node only needs to store its device ID andm
+
1 group information. The group information consists of one key and one key ID. Therefore, the total ID number which each member sensor node stores is (
m
+
1
)
+
1
=
m
+
2, and the total number of keys is also m
+
1, the same as the first method.We can see from Table5 that the second method is more efficient in storage overhead than the first method. Therefore, when the sensor nodes in WSNs are more limited in memory, the second method would be preferable.


## 4.2. Computation Overhead

Table6 shows the computation overhead of the sensor devices in the proposed two methods.Table 6
The computation operation of the two methods.
Generate RN
Poly generation
Poly evaluation
Hash
The sensor node in the first method
1
0
0
m
+
1
The GM in the second method
1
1
0
m
+
1
The sensor node in the second method
0
0
m
+
1
m
+
1In the first method, each sensor node needs to generate a random number RN and dom
+
1 hash to update its m
+
1 keys.In the second method, the GM needs to generate a random number, that is, the updating information, and al-degree polynomial while other sensor nodes need to do m
+
1 polynomial evaluation operations to obtain m
+
1 updating information. Both the GM and the member sensor nodes need to operate m
+
1 hash to update its m
+
1 keys.As all the sensor nodes in both methods havem
+
1 hash operations (when lengths of the content n and n
m are small, the time required for hash operations, for example, md5 and sha1, is not obviously different compared with that of polynomial operations which need a large number of loops. For example, the time required for hashing 64-bit data by md5 in java is 1 ms while hashing 64000 bits is about 19 ms); we can compare them from the previous three items: Generate RN, Poly generation, and Poly evaluation. The first method is much more efficient in computation overhead because the Generate RN operation is much more efficient in computation than that of the Poly operation in the second method. Therefore, when the sensor nodes in WSNs are more limited in computation ability, the first method would be preferable.


## 4.3. Communication Overhead

Table7 shows the communication overhead of the sensor devices in the proposed two methods.Table 7
The communication overhead of the two methods.
id
RN
Poly
The sensor node in the first method
2
(
m
3
+
1
)
(
m
+
1
)
(
m
3
+
1
)
(
m
+
1
)
0
The sensor node in the second method
m
+
1
0
m
+
1Table7 shows the communication overhead of the devices in two methods. In the first key updating method, in order to update one key, a sensor node needs to send a message which contains two IDs and one encrypted random number and will receive m
3 messages from other m
3 nodes in the same key group. The communication overhead for updating one key is 2
(
m
3
+
1
) IDs and m
3
+
1 random numbers. Therefore, for each of sensor nodes to update all its m
+
1 keys, the total communication overhead is 2
(
m
3
+
1
)
(
m
+
1
) ID and (m
3
+
1)(m
+
1) random numbers.In the second method, the GM needs to send (while the other sensor nodes need to receive) the broadcast which contains the ID of the key and al-degree polynomial (l
≤
m
3
+
1). Therefore, the total communication overhead of the GM and each member sensor node are both m
+
1 keys and m
+
1
l-degree polynomials. Here, we take into consideration the largest communication overhead of each sensor node; therefore, the number of legal sensor nodes or the degree of the authentication polynomial, l, is set as m
3 (m
3
+
1 member sensor nodes except the GM itself). Because each sensor node needs to update all its m
+
1 keys, the total communication overhead is m
+
1 ID and m
+
1
m
3-degree polynomials.Here, we define all the IDs, RNs, and coefficients of the polynomial AS belonging toFp. Therefore, the communication overhead of the two methods can be concluded in Table 8.Table 8
The communication overhead of the two methods.
The sensor node in the first method
3
(
m
3
+
1
)
(
m
+
1
)
log
⁡
p
The sensor node in the second method
(
m
3
+
1
)
(
m
+
1
)
log
⁡
pTable8 shows that the second method is more efficient than the first method in communication overhead. Therefore, when the sensor nodes in WSNs are more limited in energy, the second method is preferred.


## 4.4. Comparison between the Two Methods

We can draw a conclusion from the above three subsections that the first method is better in computation while the second method is more efficient in storage and communication. In addition, the second method is more energy saving because the energy cost is linked to communication overhead (communication needs more energy than the calculation) [18]. However, the first method is more secure because in the first second the capture of one sensor node will not affect the whole WSNs with the help of other security technologies such as IDS (intrusion detect system), while in the second method, the capture of the GM will affect the whole WSNs. Note that the capture of the member sensor nodes will not affect the WSNs. In conclusion, as each proposed method has its own strong points and weak points, we should choose different key updating method for different applications.


## 5. Discussion

### 5.1. Generalization

When a combinatorial design is constructed, the number of elements and the number of blocks are both determined which will load to the determination of the number of groups and sensor nodes. As our methods are designed for the case that there exist a certain number of groups which contain some sensor nodes and sensor nodes which have some keys, they can be generalized to other combinatorial design based key management schemes.For example, the symmetric balanced incomplete block design (SBIBD) is a(
ν
,
b
,
r
,
k
,
and
λ
) design, where =
b
=
m
2
+
m
+
1,r
=
k
=
m
+
1, and λ
=
1. There are m
2
+
m
+
1 sensor nodes and m
2
+
m
+
1 keys in the WSNs. In addition, each key is contained in m
+
1 sensor nodes and each sensor node has m
+
1 keys, which means, for a sensor node n
i, it needs to update m
+
1 keys among m
+
1 key groups. The sensor node n
i can use the proposed two methods to update its m
+
1 keys.


### 5.2. The Improvement of the Second Method

The second method can be improved in two factors: less communication overhead and self-healing.As we can see from predistribution rule, each sensor node hasm
+
1 keys. Note that the construction of the unital design makes it possible for m
2
-
m
+
1 blocks having all m
3
+
1 elements. For example, in the example of the 2-(9,3,1) unital in Table 1, there are 2
2
-
2
+
1
=
3 blocks and 2
3
+
1
=
9 keys, and B
1, B
2, and B
10 have all the 9 different keys, and so do B
2, B
7, and B
9. Taking advantage of this good feature, we set that a node manages m
+
1 groups, so the number of group managers and the corresponding broadcasts will drop to m
2
(
m
2
-
m
+
1
)
/
(
m
+
1
). The first part KID of the broadcast contains all the key IDs which the GM has. Therefore, the broadcast can be described as in the following equation:
(8)
B
j
(
x
)
=
KID
∪
P
j
(
x
)
.The disadvantage is that the degree of theP
j
(
x
) will increase to m
2
(
m
2
-
m
+
1
)
-
m as the authentication polynomial contains all IDs of the legal sensor nodes the GM knows. To reduce the degree of theP
j
(
x
), we can replace the authentication polynomial with the revocation polynomial and masking polynomial which will lead to only t (the degree of the masking polynomial) revocation ability. The masking polynomial is used in [19], and the construction of P
j
(
x
) is as follows:
(9)
P
j
(
x
)
=
r
j
(
x
)
×
k
u
j
+
s
(
x
,
si
d
j
)
,
where r
j
(
x
) is the revocation polynomial, s
(
x
,
si
d
j
) is the masking polynomial, and si
d
j is the session ID.The modification increases the storage overhead that each sensor node needs to store the masking polynomial and the session ID but can decrease the degree of theP
j
(
x
) to T which can be much less than m
2
(
m
2
-
m
+
1
)
-
m.Self-healing is a desirable feature for group key distribution scheme as the wireless environment and resource-limited features make the WSNs sometime an unreliable network. In unreliable networks, the member in the group may lose a message from the GM. The member can ask the GM to resend the broadcast. However, it will become a large communication cost for the GM when the resend requirement increases. To overcome the above problem, in 2002, group key distribution with the feature of self-healing is proposed, and soon self-healing group key distribution scheme becomes a hot research topic [20].Our second method can be easily modified to a self-healing one with some more communication overhead. The construction of the broadcast can also refer to that in [19] which can be described as the following equation:
(10)
B
j
=
{
KID
∪
P
j
(
x
)
j
=
1,2
KID
∪
P
max
⁡
(
j
-
T
,
1
.
.
.
,
j
)
(
x
)
,
.
.
.
,
P
j
(
x
)
j
=
3
,
…
,
m
.Here,m is the number of all the sessions and T is the number of P
j
(
x
) which each broadcast owns to ensure the ability of self-healing the group key within T sessions. Note that the number of P
j
(
x
) in the second part of B
j increases from 1 to T. Figure 2 shows the relationship between T and healing rate in the case that there are 1001 sensor nodes (a GM controls 1000 member sensor nodes) in the WSNs where the loss probability is 10%.Figure 2
The relationship betweenT and healing rate.As we can see from Figure2, the broadcast which contains less P
j
(
x
) can still have a good healing rate which means that we can set T a small number for self-healing of the second method.


## 5.1. Generalization

When a combinatorial design is constructed, the number of elements and the number of blocks are both determined which will load to the determination of the number of groups and sensor nodes. As our methods are designed for the case that there exist a certain number of groups which contain some sensor nodes and sensor nodes which have some keys, they can be generalized to other combinatorial design based key management schemes.For example, the symmetric balanced incomplete block design (SBIBD) is a(
ν
,
b
,
r
,
k
,
and
λ
) design, where =
b
=
m
2
+
m
+
1,r
=
k
=
m
+
1, and λ
=
1. There are m
2
+
m
+
1 sensor nodes and m
2
+
m
+
1 keys in the WSNs. In addition, each key is contained in m
+
1 sensor nodes and each sensor node has m
+
1 keys, which means, for a sensor node n
i, it needs to update m
+
1 keys among m
+
1 key groups. The sensor node n
i can use the proposed two methods to update its m
+
1 keys.


## 5.2. The Improvement of the Second Method

The second method can be improved in two factors: less communication overhead and self-healing.As we can see from predistribution rule, each sensor node hasm
+
1 keys. Note that the construction of the unital design makes it possible for m
2
-
m
+
1 blocks having all m
3
+
1 elements. For example, in the example of the 2-(9,3,1) unital in Table 1, there are 2
2
-
2
+
1
=
3 blocks and 2
3
+
1
=
9 keys, and B
1, B
2, and B
10 have all the 9 different keys, and so do B
2, B
7, and B
9. Taking advantage of this good feature, we set that a node manages m
+
1 groups, so the number of group managers and the corresponding broadcasts will drop to m
2
(
m
2
-
m
+
1
)
/
(
m
+
1
). The first part KID of the broadcast contains all the key IDs which the GM has. Therefore, the broadcast can be described as in the following equation:
(8)
B
j
(
x
)
=
KID
∪
P
j
(
x
)
.The disadvantage is that the degree of theP
j
(
x
) will increase to m
2
(
m
2
-
m
+
1
)
-
m as the authentication polynomial contains all IDs of the legal sensor nodes the GM knows. To reduce the degree of theP
j
(
x
), we can replace the authentication polynomial with the revocation polynomial and masking polynomial which will lead to only t (the degree of the masking polynomial) revocation ability. The masking polynomial is used in [19], and the construction of P
j
(
x
) is as follows:
(9)
P
j
(
x
)
=
r
j
(
x
)
×
k
u
j
+
s
(
x
,
si
d
j
)
,
where r
j
(
x
) is the revocation polynomial, s
(
x
,
si
d
j
) is the masking polynomial, and si
d
j is the session ID.The modification increases the storage overhead that each sensor node needs to store the masking polynomial and the session ID but can decrease the degree of theP
j
(
x
) to T which can be much less than m
2
(
m
2
-
m
+
1
)
-
m.Self-healing is a desirable feature for group key distribution scheme as the wireless environment and resource-limited features make the WSNs sometime an unreliable network. In unreliable networks, the member in the group may lose a message from the GM. The member can ask the GM to resend the broadcast. However, it will become a large communication cost for the GM when the resend requirement increases. To overcome the above problem, in 2002, group key distribution with the feature of self-healing is proposed, and soon self-healing group key distribution scheme becomes a hot research topic [20].Our second method can be easily modified to a self-healing one with some more communication overhead. The construction of the broadcast can also refer to that in [19] which can be described as the following equation:
(10)
B
j
=
{
KID
∪
P
j
(
x
)
j
=
1,2
KID
∪
P
max
⁡
(
j
-
T
,
1
.
.
.
,
j
)
(
x
)
,
.
.
.
,
P
j
(
x
)
j
=
3
,
…
,
m
.Here,m is the number of all the sessions and T is the number of P
j
(
x
) which each broadcast owns to ensure the ability of self-healing the group key within T sessions. Note that the number of P
j
(
x
) in the second part of B
j increases from 1 to T. Figure 2 shows the relationship between T and healing rate in the case that there are 1001 sensor nodes (a GM controls 1000 member sensor nodes) in the WSNs where the loss probability is 10%.Figure 2
The relationship betweenT and healing rate.As we can see from Figure2, the broadcast which contains less P
j
(
x
) can still have a good healing rate which means that we can set T a small number for self-healing of the second method.


## 6. Conclusion

In this paper, we focus on how to update the key used in combinatorial design based key management schemes for WSNs. In order to better introduce combinatorial design, we give an example of unital design and its mapping to key predistribution for WSNs. Then, we propose two key updating methods for the unital design based key management scheme; one is distributed and the other is group based. The key updating methods can be generalized to other combinatorial design based key management schemes, and the group based key updating method can be modified to a self-healing version easily. We conduct the performance analysis on the two proposed methods from three aspects: storage, computation, and communication overhead. As the essence of updating keys for combinatorial design based key management schemes is the same as that of the unital design based key management scheme, our two key updating methods can be generalized into other combinatorial design based key management schemes. Referring to the construction ofP
j
(
x
) in [19], we can modify the second method to a less communication overhead version. In addition, the second method also can be modified to a self-healing one. The best contribution of this paper is that with the key updating feature, combinatorial design based key management scheme will be more secure and, thus, enriches the application of combinatorial design in key management for WSNs.Regarding future work, we will research in the following two aspects:(1)
how to reduce the communication overhead of the first method by the construction of the combinatorial design;
(2)
looking for or coming up with another combinatorial design holding better features for key management in WSNs.



---

*Source: 134357-2014-07-01.xml*