# A Secure Privacy-Preserving Data Aggregation Model in Wearable Wireless Sensor Networks

Authors: Changlun Zhang; Chao Li; Jian Zhang
Journal: Journal of Electrical and Computer Engineering
 (2015)

---

## Abstract

With the rapid development and widespread use of wearable wireless sensors, data aggregation technique becomes one of the most important research areas. However, the sensitive data collected by sensor nodes may be leaked at the intermediate aggregator nodes. So, privacy preservation is becoming an increasingly important issue in security data aggregation. In this paper, we propose a security privacy-preserving data aggregation model, which adopts a mixed data aggregation structure. Data integrity is verified both at cluster head and at base station. Some nodes adopt slicing technology to avoid the leak of data at the cluster head in inner-cluster. Furthermore, a mechanism is given to locate the compromised nodes. The analysis shows that the model is robust to many attacks and has a lower communication overhead.


---

## Body

## 1. Introduction

Recently, the wearable wireless sensors become powerful and rapidly expanding in healthcare monitoring [1–3]. The wearable sensors can be used to collect and transmit the data to the users. Sometimes, the data collected from some near places are similar to each other. Meanwhile, the powers of sensors are limited. Therefore, the data aggregation techniques are used to reduce the communication overhead [4, 5]. In the process of data aggregation, data need to be aggregated by the aggregation nodes. Unfortunately, data aggregation is vulnerable to some attacks because the data are sensitive or privy. If the sensitive data are revealed, this may bring serious threat or economic loss. So, the security data aggregation is playing an important role in wearable sensors.In this paper, a security privacy-preserving data aggregation model is proposed. The model adopts a mixed data aggregation structure of tree and cluster. Data integrity is verified both at cluster head and at base station. Moreover, a locating mechanism is provided, which can locate the compromised node.The remainder of this paper is organized as follows. In Section2, the related work is summarized. A new secure privacy-preserving data aggregation model (SPPDA) is proposed and analyzed in Section 3. In Sections 4 and 5, the security and performance of the model are analyzed. Finally, the conclusion of this paper is given.


## 2. Related Work

Recently, secure data aggregation is becoming an important issue for wearable sensors. Cryptographic is an efficient mechanism to secure data aggregation. Moreover, the homomorphic encryption can aggregate encrypted messages directly from sensors without decrypting so that it has a short aggregation delay.Castelluccia et al. [6] proposed a simple and provably secure additively homomorphic stream cipher which is slightly less efficient on bandwidth than the hop-by-hop aggregation scheme described previously. Girao et al. [7] proposed an approach that conceals sensed and aggregated data end-to-end, which is feasible and frequently even more energy efficient than hop-by-hop encryption addressing a much weaker attacker model. Feng et al. [8] proposed a family of secret perturbation-based schemes, which can protect sensor data confidentiality without disrupting additive data aggregation.All the homomorphic encryption schemes above use the symmetric key. The securities of these schemes depend on the length of the key. Meanwhile, the security of the asymmetrical secret key schemes depends on the intractability of the algorithms. So the asymmetrical secret key schemes are designed.Boneh et al. [9] proposed a homomorphic public key encryption scheme, which improved the efficiency of election systems based on homomorphic encryption. Mykletun et al. [10] revisited and investigated the applicability of additively homomorphic public-key encryption algorithms for certain classes of wireless sensor networks and provide recommendations for selecting the most suitable public key schemes for different topologies and wireless sensor network scenarios. Girao et al. [11] provided an approach for a tiny Persistent Encrypted Data Storage (tinyPEDS) of the environmental fingerprint. Bahi et al. [12] proposed a secure end-to-end encrypted data aggregation scheme, which significantly reduces computation and communication overhead and can be practically implemented in on-the-shelf sensor platforms. Ozdemir and Xiao [13] proposed a novel integrity protecting hierarchical concealed data aggregation protocol, which is more efficient than other privacy homomorphic data aggregation schemes. Lin et al. [14] proposed a new concealed data aggregation scheme, which is robustness and efficiency. Zhou et al. [15] proposed a Secure-Enhanced Data Aggregation, which can achieve the highest security on the aggregated result compared with other asymmetric schemes.However, the models above can only detect the compromised nodes in verifying the data integrity at most, without locating the compromised nodes. In this paper, we present a new secure privacy-preserving data aggregation model (SPPDA), which adopts a mixed data aggregation structure. The network is divided into clusters, and the data aggregation trees are used in inner-cluster and interclusters. Firstly, some of nodes adopt slicing technology to avoid the leak of data at the cluster head. Secondly, data in the cluster are aggregated and sent to the cluster head, and cluster head verifies the data integrity to restrict the range of compromised node. Lastly, the cluster heads continue to send the data to the base station, and the data integrities are verified at the base station again. Furthermore, the model gives a mechanism to locate the compromised nodes. The analysis shows that this model has lower communication overhead.


## 3. SPPDA Model

The model uses the cluster structure network which contains three kinds of nodes: base station, cluster heads, and cluster nodes. The network is divided into two layers: inner-cluster and intercluster. In the inner-cluster, data are sent to the cluster head, and the cluster head verifies the data integrity to restrict the range of compromised node. In the intercluster, data are sent to the base station, and the integrity is verified at the base station. Furthermore, a mechanism is proposed to locate the compromised node. SPPDA model can be divided into initialization, the key distribution, inner-data aggregation, and interdata aggregation.


### 3.1. Initialization

The initialization of SPPDA model includes three parts: cluster head voting, inner-cluster data aggregation tree, and intercluster data aggregation tree.(1) Cluster Head Voting. Using the existing cluster protocols [16, 17], the network can be divided into many clusters. In the process of cluster, the trust management mechanism [18, 19] can be used to help the selection of the cluster header. Generally, it satisfied two conditions as follows:(1)
The cluster head has higher trust values.(2)
The clusters are evenly distributed in the monitoring area.(2) Inner-Cluster Data Aggregation Tree. In each cluster, the data are sent to the cluster head along the data aggregation tree [20]. The inner-cluster data aggregation tree is structured by a certain data aggregation tree protocol. It satisfied two conditions as follows:(1)
The degree of cluster head is large enough.(2)
The number of aggregation nodes is not more than the leaf nodes.Lastly, cluster heads set the compromising thresholdhch which is used to judge whether a branch in the cluster is compromised.(3) Intercluster Data Aggregation Tree. When the cluster heads aggregated the data of their cluster, the data in cluster heads are sent to the base station along the intercluster data aggregation tree. The intercluster data aggregation tree is similar to the structure of the inner-cluster data aggregation tree. Lastly, base station set the compromising threshold hch which is used to judge whether a branch of the BS is compromised.


### 3.2. The Key Distribution

In SPDSA model, there are three sets of key: BS (base station) key, CH (cluster head) key, andN (neighbor) key. The BS key is generated by the base station which is used to ensure the security of the communication between the cluster heads and the base station. The CH key is generated by each cluster head which is used to ensure the security of the communication between cluster nodes and the cluster head. The neighbors key is generated offline which is used to ensure the security of the communication between a node and its neighbors. The structure of each key is described as follows.(1) BS Key Distribution. BS generates three primes (q1,q2,q3) and m=q1q2q3 order elliptic curve (E). Then, according to the degree of BS which is defined as degree_BS, degree_BS groups of points {Xl,Yl,Zl}degree_BS are selected from E, and the order of those points is m.For each groupl, we get three new points according to the formula as follows:(1)Pl=q1q2Xl,Ql=q2q3Yl,Rl=q3q1Zl.Here,Pl is used to encrypt the aggregated data, Ql is used to record the number of the cluster, and Rl is used to mix the encrypted result and enhance the security of the data.Then, the BS gets a group of keys. The public key is (m, Pl, Ql, Rl, E) and the private key is (q1, q2, q3). The public key is distributed to the cluster heads in a secure way, and the private key is reserved by the BS.(2) CH Key Distribution. When the BS generates the key, each cluster head begins to generate the CH key. For example, CH(i) generates three primes (p1(i),p2(i),p3(i)) and an elliptic curve (E(i)) firstly. The order of E(i) is m(i)=p1(i)p2(i)p3(i). According to the degree of CH which is defined as degree_C(i), degree_C(i) groups of points {Vj1(i),Vj2(i),Vj3(i)}degree_C(i) are selected from E(i), and the order of those points is m(i).For each groupj, we get three new points according to the formula as follows:(2)Fji=p1ip2iVj1i,Gji=p2ip3iVj2i,Hji=p3ip1iVj3i.Here,Fj(i) is used to encrypt the aggregated data, Gj(i) is used to record the number of the cluster, and Hj(i) is used to mix the encrypted result and enhance the security of the data.Then, CH(i) gets a group of keys. The public key is (m(i),Fj(i),Gj(i),Hj(i),E(i))degree_C(i) and the private key is (p1(i), p2(i), p3(i)). Lastly, the public key is distributed to the cluster nodes in a security way, and the private key is reserved by the CH(i).(3) N Key. N key distribution consists of five steps [21]:(1)
Generation of a large pool ofP keys and their key identifiers.(2)
Random drawing ofk keys out of P without replacement to establish the key ring of a sensor.(3)
Loading of the key ring into the memory of each sensor.(4)
Saving of the key identifiers of a key ring and associated sensor identifier on a trusted controller node.(5)
For each node, loading theith controller node with the key shared with that node.Therefore, a secure link exists between two neighboring nodes only if they share a key. If two neighboring nodes cannot share a key but they can be connected by a link consisting of some nodes, this link can be the secure link between these two nodes.


### 3.3. Inner-Cluster Data Aggregation

In the inner-cluster data aggregation, the cluster heads can obtain the plaintext which is not secure enough for the data. Therefore, before the inner-cluster data aggregation, the slicing and mixing scheme [22] is used in each cluster.(1) Slicing. In each cluster, we call one node “leaf node” if some neighbors of this node belong to other clusters. And the leaf node slice its data into two parts. One slice is sent to the other node in another cluster and the other is kept by itself. Figure 1 shows the slicing scheme. The solid line is the route in which the data is transmitted to the cluster head. The dotted line is the route in which the leaf nodes send the slices to the neighbor nodes in other clusters. In Cluster 1, there are 4 leaf nodes: CN11, CN12, CN13, and CN14. According to the rule above, these nodes divide their data into two slices. One is kept by itself; another is sent to the neighbor nodes in other clusters along the dotted line. CN11 and CN12 send the slices to the neighbor nodes in other clusters not drawn in Figure 1. CN13 sends the slices to the CN22 in Cluster 2 and receives the slices from CN21 in Cluster 2. CN14 sends the slices to CN31 in Cluster 3.Figure 1
The slicing scheme.(2) Mixing. When all the leaf nodes send the slice, all nodes recomputed the data of it. If a node receives the slices, it adds all the slices to get a new data.After the slicing and the mixing, the dataMjsi is encrypted into Cjsi according to formula (3) at each cluster node in cluster i: (3)Cjsi=Mjsi×Fji+Gji+rjsi×Hji.Here, + is the summation in elliptic curve, × is the scalar multiplication in elliptic curve, andrjsi is random.Then, the encrypted data is transmitted to the cluster head. And the data are aggregated by the intermediate nodes. The aggregation of thejth branch in cluster i is(4)Cj,aggi=∑sMjsi×Fji+kji×Gji+∑srjsi×Hji.∑
s
M
j
s
i is the aggregation plaintext of branch j, kji is the number of the nodes in branch j, ∑srjsi is the aggregation of the random, and Cj,aggi is the ciphertext of the aggregation in branch j.The cluster head in clusteri receives the aggregation of each branch. Then, the cluster head decrypts the kji of each branch using the privacy key. The plaintext ξji is(5)ξji=logGji′p2ip3i×Cj,aggi.Here,Gji′=p2ip3i×Gji.The cluster head judges whether the result of each branch is compromised according to the thresholdhch. If a branch is compromised, the locating mechanism is used to locate the compromised node. If not, continue to aggregation.The cluster head gets the plaintext of the aggregation result in the cluster. That is,(6)Mi=∑jMji=∑jlogFji′p1ip2i×Cj,aggi.Here,Fji′=p1ip2i×Fji.At last, the dataMi is encrypted into Caggi by the cluster node according to formula (7) in cluster i:(7)Caggi=Mi×Pi+ki×Qi+r×Ri.Here,ki is the number of the cluster nodes in cluster i. r is random.


### 3.4. Intercluster Data Aggregation

After the inner-cluster data aggregation, the encrypted data is transmitted to the base station. And the data are aggregated by the intermediate nodes. The aggregation of thegth branch of base station is(8)Cg,agg=∑sMgs×Fg+kg×Gg+∑srgs×Hg.∑
s
M
g
s is the aggregation plaintext of branch j, kg is the number of the nodes in branch j, ∑srgs is the aggregation of the random, and Cg,agg(i) is the ciphertext of the aggregation in branch g.The base station receives the aggregation of each branch. Then, the base station decryptskg of each branch using the privacy key. The plaintext ξg is(9)ξg=logQi′q2q3×Cg,agg.Here,Qi′=q2q3×Qi.The base station judges whether the result of each branch is compromised according to the thresholdhch. If a branch is compromised, the locating mechanism is used to locate the compromised node. If not, continue to aggregation.The cluster head gets the plaintext of the aggregation result in the cluster. That is,(10)Mg=∑sM=∑slogPi′q1q2×Cg,agg.Here,Pi′=q1q2×Pi.


### 3.5. Locating Mechanism

Locating mechanism is used to locate the compromised nodes in the intermediate nodes. The locating mechanism works as follows.We assume that the numbers of leaf nodes and intermediate nodes arem and n. Then we have m≥n. The branch which does not pass the integrity verification is reconstructed into n branches, where there is only one intermediate node in each branch. The new intermediate nodes are the same as in old branch. And the data integrity is verified in the root node. If one branch does not pass the verification, the intermediate node in this branch is a compromised node and the locating mechanism ends.Figure2 shows the locating mechanism in a cluster. In the left part of Figure 2, CH finds a branch which consists of the red compromised nodes. So, this branch needs to be reconstructed. Obviously, CH1 and CH4 are two intermediate nodes. Therefore, this branch is divided into two new branches. CH1 and CH4 are also the intermediate nodes, and they are in the different branches. Then, these two branches transmit the data to the CH according to the rule described in inner-cluster data aggregation. And the CH checks their integrities. If a branch is still compromised, the only intermediate node in this branch is the compromised node.Figure 2
Locating mechanism.


### 3.6. A Case Study

In this section, we give a detailed example of SPPDA model with initialization, the key distribution, inner-cluster data aggregation, and intercluster data aggregation.(1) Initialization. In Figure 3, there are 25 sensor nodes distributed in the monitor area, and the base station is located in the left of the monitor area. These nodes are divided into 5 clusters. Then, the inner-cluster data aggregation tree and the intercluster data aggregation tree are constructed. In the intercluster data aggregation tree, there are 2 branches which are BSB1 and BSB2 from BS. BSB1 consisted of BS, CH1, CH2, and CH3. BSB2 consisted of BS, CH4, and CH5. In each cluster, there are 4 CNs and 1 CH. Then, the cluster nodes are divided into 2 branches. Using the ith cluster as an example, the branches are CBi1 and CBi2. The CBi1 consisted of CHi, CNi1, and CNi2. The CBi2 consisted of CHi, CNi3, and CNi4. When the data aggregation trees are completed, CH records the amount of the CNs in its cluster, and the BS records the amount of the CHs in the network.Figure 3
Initialization.(2) The Keys Distribution. According to the structure of the network in Figure 3, the BS generates 2 pairs of keys. The public keys are (m, P1, Q1, R1, E) and (m, P2, Q2, R2, E), and the privacy keys are always (q1, q2, q3). Meanwhile, according to the amount of the branches, the ith cluster head CHi generates 2 pairs of keys. The public keys are (m(i), F1(i), G1(i), H1(i), E(i)) and (m(i), F2(i), G2(i), H2(i), E(i)). The privacy keys are always (p1(i), p2(i), p3(i)).In order to reduce the computing overhead, the pointsPl, Ql, and Rl, (l=1,2) use some small prime numbers. And p1(i)=q1, p2(i)=q2, p3(i)=q3, and the elliptical curve E is same as E′. Table 1 shows the values of those major parameters. The orders of P1, P2, F1(i), and F2(i) are 17. The orders of Q1, Q2, G1(i), and G2(i) are 13. The orders of R1, R2, H1(i), and H2(i) are 19. The orders of two elliptical curves are 4199.Table 1
The values of the major parameters.
Parameters
Values
E
=
E
′
m
=
q
1
q
2
q
3
=
4199
(
P
l
,
Q
l
,
R
l
)
2
q
1
=
13, q2=19, q3=17
(
F
j
(
i
)
,
G
j
(
i
)
,
H
j
(
i
)
)
2
p
1
(
i
)
=
13, p2(i)=19, p3(i)=17(3) Inner-Cluster Data Aggregation. Firstly, the edge nodes are confirmed in each cluster by its CH. In this case, the edge nodes are CN13, CN14, CN22, CN24, CN32, CN33, CN41, CN42, CN52, and CN53. Secondly, each edge node generates a slice from its data. Then, each edge node sends its slice to its neighbor randomly which belongs to a different cluster. Figure 4 shows the process of the slicing. The full lines express the inner-cluster data aggregation tree, and the dash lines express the flow of the slices. After slicing, the nodes which receive the slices add them into their data. In Table 2, the operations of slicing and mixing are shown with specific numbers.Table 2
Data processing of edge nodes.
Cluster nodes
Original data
Slices
Mixing data
CN13
M
P
3
(
1
)
=
6
S
13
=
5
M
3
(
1
)
=
5
CN14
M
P
4
(
1
)
=
7
S
14
=
5
M
4
(
1
)
=
4
CN22
M
P
2
(
1
)
=
8
S
22
=
3
M
4
(
2
)
=
5
CN24
M
P
1
(
2
)
=
6
S
21
=
4
M
1
(
2
)
=
7
CN32
M
P
2
(
3
)
=
7
S
32
=
1
M
2
(
3
)
=
10
CN34
M
P
4
(
3
)
=
7
S
34
=
4
M
4
(
3
)
=
6
CN41
M
P
1
(
4
)
=
7
S
41
=
2
M
1
(
4
)
=
10
CN42
M
P
2
(
4
)
=
5
S
42
=
3
M
2
(
4
)
=
4
CN52
M
P
2
(
5
)
=
2
S
52
=
1
M
2
(
5
)
=
5
CN53
M
P
2
(
5
)
=
2
S
52
=
1
M
2
(
5
)
=
1Figure 4
The slices of the edge nodes.Using the first cluster as an example, the inner-cluster data aggregation is shown as follows. There are 4 CNs in the first cluster, and these CNs collect the data around them. Then, the data is encrypted according to formula (3). The plaintext and ciphertext of data are shown in Table 3.Table 3
The encryption in inner-cluster data aggregation.
Cluster nodes
PlaintextM(1)
CiphertextC(1)
CN11
M
1
(
1
)
=
4
C
1
(
1
)
=
4
F
1
(
1
)
+
G
1
(
1
)
+
9
H
1
(
1
)
CN12
M
2
(
1
)
=
6
C
2
(
1
)
=
6
F
1
(
1
)
+
G
1
(
1
)
+
4
H
1
(
1
)
CN13
M
3
(
1
)
=
5
C
3
(
1
)
=
5
F
2
(
1
)
+
G
2
(
1
)
+
5
H
2
(
1
)
CN14
M
4
(
1
)
=
4
C
4
(
1
)
=
4
F
2
(
1
)
+
G
2
(
1
)
+
2
H
2
(
1
)After the encryption, all of the CNs send their encrypted data to the CH along the inner-cluster aggregation tree. Then, the CH receives two aggregation data items from its two branches. Table4 shows the aggregation results in each branch.Table 4
The intercluster data aggregation.
Cluster branch
Aggregation results
CB11
C
1
,
agg
(
1
)
=
10
F
1
(
1
)
+
2
G
1
(
1
)
+
13
H
1
(
1
)
CB12
C
2
,
agg
(
1
)
=
9
F
2
(
1
)
+
2
G
2
(
1
)
+
7
H
2
(
1
)When the CH receives the aggregation data, it decryptst aggregation data according to formula (5). We get the amount of CNs in two branches as follows:(11)323C1,agg1=3230F11+646G11+4199H11,323C2,agg1=2907F21+646G21+2261H21.According to the orders of these nodes, we have17Fj1=0, 13Gj1=0, and 19Hj1=0. So,(12)323C1,agg1=646G11,323C2,agg1=646G21.Then, CH decrypts the aggregation again according to formula (6). We get the aggregation data of two branches which is 10 and 9. CH aggregates these two data items and encrypts them with the public key from BS: (13)C1=19P1+4Q1+23R1.The inner-cluster data aggregation in other four clusters is done in the same way. Table5 shows the plaintext and ciphertext of aggregation data in those five clusters.Table 5
The encryption in intercluster data aggregation.
Cluster heads
PlaintextM
CiphertextC
CH1
M
(
1
)
=
19
C
(
1
)
=
19
P
1
+
4
Q
1
+
23
R
1
CH2
M
(
2
)
=
19
C
(
2
)
=
19
P
1
+
4
Q
1
+
17
R
1
CH3
M
(
3
)
=
23
C
(
3
)
=
23
P
1
+
4
Q
1
+
21
R
1
CH4
M
(
4
)
=
17
C
(
4
)
=
17
P
2
+
4
Q
2
+
19
R
2
CH5
M
(
5
)
=
20
C
(
5
)
=
20
P
2
+
4
Q
2
+
12
R
2(4) Intercluster Aggregation Data. After the encryption, all of the CHs send their encrypted data to the BS along the intercluster aggregation tree. Then, the BS receives two aggregation data items from its two branches. Table 6 shows the aggregation results in each branch.Table 6
The intercluster data aggregation.
Base station branch
Aggregation results
BSB11
C
1
,
agg
=
61
P
1
+
12
Q
1
+
61
R
1
BSB12
C
2
,
agg
=
37
P
2
+
8
Q
2
+
31
R
2When the BS receives the aggregation data, it decrypts these two aggregation data items according to formula (9). We get the amount of CHs in two branches as follows:(14)323C1,agg=19703P1+3876Q1+19703R1,323C2,agg=11951P2+2584Q2+10013R2.According to the orders of these nodes, we have(15)17Pj=0,13Qj=0,19Rj=0.So,(16)323C1,agg=3876Q1,323C2,agg=2584Q2.CH decrypts the aggregation again according to formula (10). We get the aggregation data of two branches which is 61 and 37. BS aggregates these two data items and gets the aggregation data of the whole network which is 87.


## 3.1. Initialization

The initialization of SPPDA model includes three parts: cluster head voting, inner-cluster data aggregation tree, and intercluster data aggregation tree.(1) Cluster Head Voting. Using the existing cluster protocols [16, 17], the network can be divided into many clusters. In the process of cluster, the trust management mechanism [18, 19] can be used to help the selection of the cluster header. Generally, it satisfied two conditions as follows:(1)
The cluster head has higher trust values.(2)
The clusters are evenly distributed in the monitoring area.(2) Inner-Cluster Data Aggregation Tree. In each cluster, the data are sent to the cluster head along the data aggregation tree [20]. The inner-cluster data aggregation tree is structured by a certain data aggregation tree protocol. It satisfied two conditions as follows:(1)
The degree of cluster head is large enough.(2)
The number of aggregation nodes is not more than the leaf nodes.Lastly, cluster heads set the compromising thresholdhch which is used to judge whether a branch in the cluster is compromised.(3) Intercluster Data Aggregation Tree. When the cluster heads aggregated the data of their cluster, the data in cluster heads are sent to the base station along the intercluster data aggregation tree. The intercluster data aggregation tree is similar to the structure of the inner-cluster data aggregation tree. Lastly, base station set the compromising threshold hch which is used to judge whether a branch of the BS is compromised.


## 3.2. The Key Distribution

In SPDSA model, there are three sets of key: BS (base station) key, CH (cluster head) key, andN (neighbor) key. The BS key is generated by the base station which is used to ensure the security of the communication between the cluster heads and the base station. The CH key is generated by each cluster head which is used to ensure the security of the communication between cluster nodes and the cluster head. The neighbors key is generated offline which is used to ensure the security of the communication between a node and its neighbors. The structure of each key is described as follows.(1) BS Key Distribution. BS generates three primes (q1,q2,q3) and m=q1q2q3 order elliptic curve (E). Then, according to the degree of BS which is defined as degree_BS, degree_BS groups of points {Xl,Yl,Zl}degree_BS are selected from E, and the order of those points is m.For each groupl, we get three new points according to the formula as follows:(1)Pl=q1q2Xl,Ql=q2q3Yl,Rl=q3q1Zl.Here,Pl is used to encrypt the aggregated data, Ql is used to record the number of the cluster, and Rl is used to mix the encrypted result and enhance the security of the data.Then, the BS gets a group of keys. The public key is (m, Pl, Ql, Rl, E) and the private key is (q1, q2, q3). The public key is distributed to the cluster heads in a secure way, and the private key is reserved by the BS.(2) CH Key Distribution. When the BS generates the key, each cluster head begins to generate the CH key. For example, CH(i) generates three primes (p1(i),p2(i),p3(i)) and an elliptic curve (E(i)) firstly. The order of E(i) is m(i)=p1(i)p2(i)p3(i). According to the degree of CH which is defined as degree_C(i), degree_C(i) groups of points {Vj1(i),Vj2(i),Vj3(i)}degree_C(i) are selected from E(i), and the order of those points is m(i).For each groupj, we get three new points according to the formula as follows:(2)Fji=p1ip2iVj1i,Gji=p2ip3iVj2i,Hji=p3ip1iVj3i.Here,Fj(i) is used to encrypt the aggregated data, Gj(i) is used to record the number of the cluster, and Hj(i) is used to mix the encrypted result and enhance the security of the data.Then, CH(i) gets a group of keys. The public key is (m(i),Fj(i),Gj(i),Hj(i),E(i))degree_C(i) and the private key is (p1(i), p2(i), p3(i)). Lastly, the public key is distributed to the cluster nodes in a security way, and the private key is reserved by the CH(i).(3) N Key. N key distribution consists of five steps [21]:(1)
Generation of a large pool ofP keys and their key identifiers.(2)
Random drawing ofk keys out of P without replacement to establish the key ring of a sensor.(3)
Loading of the key ring into the memory of each sensor.(4)
Saving of the key identifiers of a key ring and associated sensor identifier on a trusted controller node.(5)
For each node, loading theith controller node with the key shared with that node.Therefore, a secure link exists between two neighboring nodes only if they share a key. If two neighboring nodes cannot share a key but they can be connected by a link consisting of some nodes, this link can be the secure link between these two nodes.


## 3.3. Inner-Cluster Data Aggregation

In the inner-cluster data aggregation, the cluster heads can obtain the plaintext which is not secure enough for the data. Therefore, before the inner-cluster data aggregation, the slicing and mixing scheme [22] is used in each cluster.(1) Slicing. In each cluster, we call one node “leaf node” if some neighbors of this node belong to other clusters. And the leaf node slice its data into two parts. One slice is sent to the other node in another cluster and the other is kept by itself. Figure 1 shows the slicing scheme. The solid line is the route in which the data is transmitted to the cluster head. The dotted line is the route in which the leaf nodes send the slices to the neighbor nodes in other clusters. In Cluster 1, there are 4 leaf nodes: CN11, CN12, CN13, and CN14. According to the rule above, these nodes divide their data into two slices. One is kept by itself; another is sent to the neighbor nodes in other clusters along the dotted line. CN11 and CN12 send the slices to the neighbor nodes in other clusters not drawn in Figure 1. CN13 sends the slices to the CN22 in Cluster 2 and receives the slices from CN21 in Cluster 2. CN14 sends the slices to CN31 in Cluster 3.Figure 1
The slicing scheme.(2) Mixing. When all the leaf nodes send the slice, all nodes recomputed the data of it. If a node receives the slices, it adds all the slices to get a new data.After the slicing and the mixing, the dataMjsi is encrypted into Cjsi according to formula (3) at each cluster node in cluster i: (3)Cjsi=Mjsi×Fji+Gji+rjsi×Hji.Here, + is the summation in elliptic curve, × is the scalar multiplication in elliptic curve, andrjsi is random.Then, the encrypted data is transmitted to the cluster head. And the data are aggregated by the intermediate nodes. The aggregation of thejth branch in cluster i is(4)Cj,aggi=∑sMjsi×Fji+kji×Gji+∑srjsi×Hji.∑
s
M
j
s
i is the aggregation plaintext of branch j, kji is the number of the nodes in branch j, ∑srjsi is the aggregation of the random, and Cj,aggi is the ciphertext of the aggregation in branch j.The cluster head in clusteri receives the aggregation of each branch. Then, the cluster head decrypts the kji of each branch using the privacy key. The plaintext ξji is(5)ξji=logGji′p2ip3i×Cj,aggi.Here,Gji′=p2ip3i×Gji.The cluster head judges whether the result of each branch is compromised according to the thresholdhch. If a branch is compromised, the locating mechanism is used to locate the compromised node. If not, continue to aggregation.The cluster head gets the plaintext of the aggregation result in the cluster. That is,(6)Mi=∑jMji=∑jlogFji′p1ip2i×Cj,aggi.Here,Fji′=p1ip2i×Fji.At last, the dataMi is encrypted into Caggi by the cluster node according to formula (7) in cluster i:(7)Caggi=Mi×Pi+ki×Qi+r×Ri.Here,ki is the number of the cluster nodes in cluster i. r is random.


## 3.4. Intercluster Data Aggregation

After the inner-cluster data aggregation, the encrypted data is transmitted to the base station. And the data are aggregated by the intermediate nodes. The aggregation of thegth branch of base station is(8)Cg,agg=∑sMgs×Fg+kg×Gg+∑srgs×Hg.∑
s
M
g
s is the aggregation plaintext of branch j, kg is the number of the nodes in branch j, ∑srgs is the aggregation of the random, and Cg,agg(i) is the ciphertext of the aggregation in branch g.The base station receives the aggregation of each branch. Then, the base station decryptskg of each branch using the privacy key. The plaintext ξg is(9)ξg=logQi′q2q3×Cg,agg.Here,Qi′=q2q3×Qi.The base station judges whether the result of each branch is compromised according to the thresholdhch. If a branch is compromised, the locating mechanism is used to locate the compromised node. If not, continue to aggregation.The cluster head gets the plaintext of the aggregation result in the cluster. That is,(10)Mg=∑sM=∑slogPi′q1q2×Cg,agg.Here,Pi′=q1q2×Pi.


## 3.5. Locating Mechanism

Locating mechanism is used to locate the compromised nodes in the intermediate nodes. The locating mechanism works as follows.We assume that the numbers of leaf nodes and intermediate nodes arem and n. Then we have m≥n. The branch which does not pass the integrity verification is reconstructed into n branches, where there is only one intermediate node in each branch. The new intermediate nodes are the same as in old branch. And the data integrity is verified in the root node. If one branch does not pass the verification, the intermediate node in this branch is a compromised node and the locating mechanism ends.Figure2 shows the locating mechanism in a cluster. In the left part of Figure 2, CH finds a branch which consists of the red compromised nodes. So, this branch needs to be reconstructed. Obviously, CH1 and CH4 are two intermediate nodes. Therefore, this branch is divided into two new branches. CH1 and CH4 are also the intermediate nodes, and they are in the different branches. Then, these two branches transmit the data to the CH according to the rule described in inner-cluster data aggregation. And the CH checks their integrities. If a branch is still compromised, the only intermediate node in this branch is the compromised node.Figure 2
Locating mechanism.


## 3.6. A Case Study

In this section, we give a detailed example of SPPDA model with initialization, the key distribution, inner-cluster data aggregation, and intercluster data aggregation.(1) Initialization. In Figure 3, there are 25 sensor nodes distributed in the monitor area, and the base station is located in the left of the monitor area. These nodes are divided into 5 clusters. Then, the inner-cluster data aggregation tree and the intercluster data aggregation tree are constructed. In the intercluster data aggregation tree, there are 2 branches which are BSB1 and BSB2 from BS. BSB1 consisted of BS, CH1, CH2, and CH3. BSB2 consisted of BS, CH4, and CH5. In each cluster, there are 4 CNs and 1 CH. Then, the cluster nodes are divided into 2 branches. Using the ith cluster as an example, the branches are CBi1 and CBi2. The CBi1 consisted of CHi, CNi1, and CNi2. The CBi2 consisted of CHi, CNi3, and CNi4. When the data aggregation trees are completed, CH records the amount of the CNs in its cluster, and the BS records the amount of the CHs in the network.Figure 3
Initialization.(2) The Keys Distribution. According to the structure of the network in Figure 3, the BS generates 2 pairs of keys. The public keys are (m, P1, Q1, R1, E) and (m, P2, Q2, R2, E), and the privacy keys are always (q1, q2, q3). Meanwhile, according to the amount of the branches, the ith cluster head CHi generates 2 pairs of keys. The public keys are (m(i), F1(i), G1(i), H1(i), E(i)) and (m(i), F2(i), G2(i), H2(i), E(i)). The privacy keys are always (p1(i), p2(i), p3(i)).In order to reduce the computing overhead, the pointsPl, Ql, and Rl, (l=1,2) use some small prime numbers. And p1(i)=q1, p2(i)=q2, p3(i)=q3, and the elliptical curve E is same as E′. Table 1 shows the values of those major parameters. The orders of P1, P2, F1(i), and F2(i) are 17. The orders of Q1, Q2, G1(i), and G2(i) are 13. The orders of R1, R2, H1(i), and H2(i) are 19. The orders of two elliptical curves are 4199.Table 1
The values of the major parameters.
Parameters
Values
E
=
E
′
m
=
q
1
q
2
q
3
=
4199
(
P
l
,
Q
l
,
R
l
)
2
q
1
=
13, q2=19, q3=17
(
F
j
(
i
)
,
G
j
(
i
)
,
H
j
(
i
)
)
2
p
1
(
i
)
=
13, p2(i)=19, p3(i)=17(3) Inner-Cluster Data Aggregation. Firstly, the edge nodes are confirmed in each cluster by its CH. In this case, the edge nodes are CN13, CN14, CN22, CN24, CN32, CN33, CN41, CN42, CN52, and CN53. Secondly, each edge node generates a slice from its data. Then, each edge node sends its slice to its neighbor randomly which belongs to a different cluster. Figure 4 shows the process of the slicing. The full lines express the inner-cluster data aggregation tree, and the dash lines express the flow of the slices. After slicing, the nodes which receive the slices add them into their data. In Table 2, the operations of slicing and mixing are shown with specific numbers.Table 2
Data processing of edge nodes.
Cluster nodes
Original data
Slices
Mixing data
CN13
M
P
3
(
1
)
=
6
S
13
=
5
M
3
(
1
)
=
5
CN14
M
P
4
(
1
)
=
7
S
14
=
5
M
4
(
1
)
=
4
CN22
M
P
2
(
1
)
=
8
S
22
=
3
M
4
(
2
)
=
5
CN24
M
P
1
(
2
)
=
6
S
21
=
4
M
1
(
2
)
=
7
CN32
M
P
2
(
3
)
=
7
S
32
=
1
M
2
(
3
)
=
10
CN34
M
P
4
(
3
)
=
7
S
34
=
4
M
4
(
3
)
=
6
CN41
M
P
1
(
4
)
=
7
S
41
=
2
M
1
(
4
)
=
10
CN42
M
P
2
(
4
)
=
5
S
42
=
3
M
2
(
4
)
=
4
CN52
M
P
2
(
5
)
=
2
S
52
=
1
M
2
(
5
)
=
5
CN53
M
P
2
(
5
)
=
2
S
52
=
1
M
2
(
5
)
=
1Figure 4
The slices of the edge nodes.Using the first cluster as an example, the inner-cluster data aggregation is shown as follows. There are 4 CNs in the first cluster, and these CNs collect the data around them. Then, the data is encrypted according to formula (3). The plaintext and ciphertext of data are shown in Table 3.Table 3
The encryption in inner-cluster data aggregation.
Cluster nodes
PlaintextM(1)
CiphertextC(1)
CN11
M
1
(
1
)
=
4
C
1
(
1
)
=
4
F
1
(
1
)
+
G
1
(
1
)
+
9
H
1
(
1
)
CN12
M
2
(
1
)
=
6
C
2
(
1
)
=
6
F
1
(
1
)
+
G
1
(
1
)
+
4
H
1
(
1
)
CN13
M
3
(
1
)
=
5
C
3
(
1
)
=
5
F
2
(
1
)
+
G
2
(
1
)
+
5
H
2
(
1
)
CN14
M
4
(
1
)
=
4
C
4
(
1
)
=
4
F
2
(
1
)
+
G
2
(
1
)
+
2
H
2
(
1
)After the encryption, all of the CNs send their encrypted data to the CH along the inner-cluster aggregation tree. Then, the CH receives two aggregation data items from its two branches. Table4 shows the aggregation results in each branch.Table 4
The intercluster data aggregation.
Cluster branch
Aggregation results
CB11
C
1
,
agg
(
1
)
=
10
F
1
(
1
)
+
2
G
1
(
1
)
+
13
H
1
(
1
)
CB12
C
2
,
agg
(
1
)
=
9
F
2
(
1
)
+
2
G
2
(
1
)
+
7
H
2
(
1
)When the CH receives the aggregation data, it decryptst aggregation data according to formula (5). We get the amount of CNs in two branches as follows:(11)323C1,agg1=3230F11+646G11+4199H11,323C2,agg1=2907F21+646G21+2261H21.According to the orders of these nodes, we have17Fj1=0, 13Gj1=0, and 19Hj1=0. So,(12)323C1,agg1=646G11,323C2,agg1=646G21.Then, CH decrypts the aggregation again according to formula (6). We get the aggregation data of two branches which is 10 and 9. CH aggregates these two data items and encrypts them with the public key from BS: (13)C1=19P1+4Q1+23R1.The inner-cluster data aggregation in other four clusters is done in the same way. Table5 shows the plaintext and ciphertext of aggregation data in those five clusters.Table 5
The encryption in intercluster data aggregation.
Cluster heads
PlaintextM
CiphertextC
CH1
M
(
1
)
=
19
C
(
1
)
=
19
P
1
+
4
Q
1
+
23
R
1
CH2
M
(
2
)
=
19
C
(
2
)
=
19
P
1
+
4
Q
1
+
17
R
1
CH3
M
(
3
)
=
23
C
(
3
)
=
23
P
1
+
4
Q
1
+
21
R
1
CH4
M
(
4
)
=
17
C
(
4
)
=
17
P
2
+
4
Q
2
+
19
R
2
CH5
M
(
5
)
=
20
C
(
5
)
=
20
P
2
+
4
Q
2
+
12
R
2(4) Intercluster Aggregation Data. After the encryption, all of the CHs send their encrypted data to the BS along the intercluster aggregation tree. Then, the BS receives two aggregation data items from its two branches. Table 6 shows the aggregation results in each branch.Table 6
The intercluster data aggregation.
Base station branch
Aggregation results
BSB11
C
1
,
agg
=
61
P
1
+
12
Q
1
+
61
R
1
BSB12
C
2
,
agg
=
37
P
2
+
8
Q
2
+
31
R
2When the BS receives the aggregation data, it decrypts these two aggregation data items according to formula (9). We get the amount of CHs in two branches as follows:(14)323C1,agg=19703P1+3876Q1+19703R1,323C2,agg=11951P2+2584Q2+10013R2.According to the orders of these nodes, we have(15)17Pj=0,13Qj=0,19Rj=0.So,(16)323C1,agg=3876Q1,323C2,agg=2584Q2.CH decrypts the aggregation again according to formula (10). We get the aggregation data of two branches which is 61 and 37. BS aggregates these two data items and gets the aggregation data of the whole network which is 87.


## 4. The Security Analysis

### 4.1. Ciphertext Only Attack

Ciphertext only attack is a basic attack in wearable sensors. When attackers use this attack, they only can try to get the plaintext by analyzing the ciphertext.SPPDA model uses the elliptic curve cryptography, which is an asymmetric encryption model. Its security is based on the intractability in decomposition of large prime numbers. So SPPDA model can resist this attack well as long as the suitable prime numbers are used.


### 4.2. Chosen-Plaintext Attack

In chosen-plaintext attack, attackers can get some plaintexts and the ciphertexts. Attackers want to get the secret key by analyzing these texts so that the other ciphertexts can be cracked rapidly by using this secret key.SPPDA model uses the elliptic curve encryption with three parameters, and one of them is used to add the random disturbance. In this way, even the same plaintexts can be encrypted to the different ciphertexts. So, no matter how many plaintext-ciphertexts the attackers get, they cannot get the secret key by analyzing the plaintext-ciphertexts.


### 4.3. Data Injection Attack

In data injection attack, the attackers send the unauthorized data to the aggregation node. If the aggregation aggregates this data, the result will be different from the real result. So the base station gets a fault result.SPPDA model uses the elliptic curve encryption. So the ciphertext is satisfied with the structure of the elliptic curve encryption. If the attackers send the data which lacks standardization, the aggregation can recognize it easily and remove it by the aggregation node.


### 4.4. Aggregation Node Compromised Attack

In the node compromised attack model, attackers can compromise some aggregation nodes in the wearable sensors. Then, attackers get the key of these nodes and perform unauthorized aggregation. So, the base station gets the fault result.SPPDA model verifies the data integrities both in cluster heads and in base station. If the aggregation node in cluster is compromised, cluster head can recognize the fault of the branch at which the compromised node stays. If the cluster head is compromised, base station can recognize the fault of branch at which the compromised cluster head stays. Then, the cluster head or base station uses the locating mechanism to locate the compromised node and remove it.


## 4.1. Ciphertext Only Attack

Ciphertext only attack is a basic attack in wearable sensors. When attackers use this attack, they only can try to get the plaintext by analyzing the ciphertext.SPPDA model uses the elliptic curve cryptography, which is an asymmetric encryption model. Its security is based on the intractability in decomposition of large prime numbers. So SPPDA model can resist this attack well as long as the suitable prime numbers are used.


## 4.2. Chosen-Plaintext Attack

In chosen-plaintext attack, attackers can get some plaintexts and the ciphertexts. Attackers want to get the secret key by analyzing these texts so that the other ciphertexts can be cracked rapidly by using this secret key.SPPDA model uses the elliptic curve encryption with three parameters, and one of them is used to add the random disturbance. In this way, even the same plaintexts can be encrypted to the different ciphertexts. So, no matter how many plaintext-ciphertexts the attackers get, they cannot get the secret key by analyzing the plaintext-ciphertexts.


## 4.3. Data Injection Attack

In data injection attack, the attackers send the unauthorized data to the aggregation node. If the aggregation aggregates this data, the result will be different from the real result. So the base station gets a fault result.SPPDA model uses the elliptic curve encryption. So the ciphertext is satisfied with the structure of the elliptic curve encryption. If the attackers send the data which lacks standardization, the aggregation can recognize it easily and remove it by the aggregation node.


## 4.4. Aggregation Node Compromised Attack

In the node compromised attack model, attackers can compromise some aggregation nodes in the wearable sensors. Then, attackers get the key of these nodes and perform unauthorized aggregation. So, the base station gets the fault result.SPPDA model verifies the data integrities both in cluster heads and in base station. If the aggregation node in cluster is compromised, cluster head can recognize the fault of the branch at which the compromised node stays. If the cluster head is compromised, base station can recognize the fault of branch at which the compromised cluster head stays. Then, the cluster head or base station uses the locating mechanism to locate the compromised node and remove it.


## 5. Performance Analysis

In this section, the computation overhead and the communication overhead of SPPDA model are analyzed and compared with the IPHCDA model.


### 5.1. The Computation Overhead

The computation overhead includes encryption, aggregation, and decryption. We assume that the overhead of addition, scalar multiplication, MAC, XOR, and the decryption are expressed asEAdd, EMul, EMAC, E⊕, and Elog, G is the amount of clusters, and N is the amount of the nodes in wearable sensors. Table 7 shows the computation overhead in IPHCDA model and SPDA model.Table 7
The computation overhead of IPHCDA and SPPDA.
Operation
IPHCDA
SPPDA
Encryption
N
⋅
(
E
Add
+
2
E
Mul
)
N
⋅
(
2
E
Add
+
3
E
Mul
)
Aggregation
(
N
-
1
)
⋅
E
Add
+
G
⋅
E
MAC
+
k
⋅
E
⊕
(
N
-
1
)
⋅
E
Add
Decryption
G
⋅
E
log
⁡
2
G
⋅
E
log
⁡In encryption operation, IPHCDA model needs twiceEMul and once EMul in each node, while SPPDA model needs three times EMul and twice EMul. In aggregation operation, IPHCDA model needs (N-1) times EAdd, G times EMAC, and k times E⊕, while SPPDA model only needs (N-1) times EAdd. The number of XOR operations is decided by the structure of the aggregation tree. The constant k is no less than 1 and no more than G-1. In decryption operation, IPHCDA model needs G times Elog, while SPPDA model needs 2G times Elog.In general, the computation overhead of IPHCDA model is lower than SPPDA model in encryption and decryption. The computation overhead of SPPDA model is lower than IPHCDA model in aggregation. But, there are two aspects not described in Table7.(1)
The orders of the elliptic curve are not the same in both models. The order in IPHCDA is larger than in SPPDA. So theEAdd, EMul, and Elog in IPHCDA model are larger.(2)
The computation overhead which is extra in SPPDA model is undertaken by the whole network, so the average overhead to each node is lower.So, the computation overheads in both models are almost the same.


### 5.2. The Communication Overhead

In this section, the communication overhead between SPPDA model and IPHCDA model is compared. It is assumed that these two models are used in the same network structure. Therefore, the comparison of the communication is the same as the comparison of length of ciphertext.It is assumedλ is the length of each prime in both models, and the number of the clusters in the network is G. So the length of ciphertext in IPHCDA model is (G+1)λ, and the length of ciphertext in SPPDA model is 3λ. In general case, λ=256 is safe enough to a ciphertext, and Table 1 shows the comparison of the length of ciphertext in two models when λ=256.In Table8, the length of ciphertext increases with G in IPHCDA model, and the length of ciphertext is constant 768 when G increases. So, when G>2, the length of ciphertext in IPHCDA model is larger than that in SPPDA model; that means the communication overhead of IPHCDA model is larger. Actually, a cluster-based network usually consists of plenty of clusters. Therefore, the SPPDA model has lower communication overhead.Table 8
The length of ciphertext in two models (λ=256, unit is bit).
Models
G
=
1
G
=
2
G
=
3
G
=
4
SPPDA
768
768
768
768
IPHCDA
512
768
1024
1280


## 5.1. The Computation Overhead

The computation overhead includes encryption, aggregation, and decryption. We assume that the overhead of addition, scalar multiplication, MAC, XOR, and the decryption are expressed asEAdd, EMul, EMAC, E⊕, and Elog, G is the amount of clusters, and N is the amount of the nodes in wearable sensors. Table 7 shows the computation overhead in IPHCDA model and SPDA model.Table 7
The computation overhead of IPHCDA and SPPDA.
Operation
IPHCDA
SPPDA
Encryption
N
⋅
(
E
Add
+
2
E
Mul
)
N
⋅
(
2
E
Add
+
3
E
Mul
)
Aggregation
(
N
-
1
)
⋅
E
Add
+
G
⋅
E
MAC
+
k
⋅
E
⊕
(
N
-
1
)
⋅
E
Add
Decryption
G
⋅
E
log
⁡
2
G
⋅
E
log
⁡In encryption operation, IPHCDA model needs twiceEMul and once EMul in each node, while SPPDA model needs three times EMul and twice EMul. In aggregation operation, IPHCDA model needs (N-1) times EAdd, G times EMAC, and k times E⊕, while SPPDA model only needs (N-1) times EAdd. The number of XOR operations is decided by the structure of the aggregation tree. The constant k is no less than 1 and no more than G-1. In decryption operation, IPHCDA model needs G times Elog, while SPPDA model needs 2G times Elog.In general, the computation overhead of IPHCDA model is lower than SPPDA model in encryption and decryption. The computation overhead of SPPDA model is lower than IPHCDA model in aggregation. But, there are two aspects not described in Table7.(1)
The orders of the elliptic curve are not the same in both models. The order in IPHCDA is larger than in SPPDA. So theEAdd, EMul, and Elog in IPHCDA model are larger.(2)
The computation overhead which is extra in SPPDA model is undertaken by the whole network, so the average overhead to each node is lower.So, the computation overheads in both models are almost the same.


## 5.2. The Communication Overhead

In this section, the communication overhead between SPPDA model and IPHCDA model is compared. It is assumed that these two models are used in the same network structure. Therefore, the comparison of the communication is the same as the comparison of length of ciphertext.It is assumedλ is the length of each prime in both models, and the number of the clusters in the network is G. So the length of ciphertext in IPHCDA model is (G+1)λ, and the length of ciphertext in SPPDA model is 3λ. In general case, λ=256 is safe enough to a ciphertext, and Table 1 shows the comparison of the length of ciphertext in two models when λ=256.In Table8, the length of ciphertext increases with G in IPHCDA model, and the length of ciphertext is constant 768 when G increases. So, when G>2, the length of ciphertext in IPHCDA model is larger than that in SPPDA model; that means the communication overhead of IPHCDA model is larger. Actually, a cluster-based network usually consists of plenty of clusters. Therefore, the SPPDA model has lower communication overhead.Table 8
The length of ciphertext in two models (λ=256, unit is bit).
Models
G
=
1
G
=
2
G
=
3
G
=
4
SPPDA
768
768
768
768
IPHCDA
512
768
1024
1280


## 6. Conclusion

In this paper, we present a new secure privacy-preserving data aggregation model, which adopts a mixed data aggregation structure of tree and cluster. The proposed model verifies the data integrity both at the cluster nodes and at the base station. Meanwhile, the model gives a mechanism to locate the compromised nodes. Lastly, the detail analysis shows that this model is robust to many attacks and has lower communication overhead.



---

*Source: 104286-2015-10-07.xml*