LEACH-Based Security Routing Protocol for WSNs

Jianli Wang, Laibo Zheng, Li Zhao, and Dan Tian

School of Information Science and Engineering, Shandong University,

27 Shanda Nan Road, Jinan, P.R.China, 250100
glhwjl@163.com.cn, zhenglaibo@sdu.edu.cn,
zhaoli0525@sina.com, td200412327@126.com

Abstract. LEACH is the first protocol of wireless sensor networks based on

clustering and layered structure technology, but the security problem related to
the wireless sensor network is not considered. Therefore, it is necessary to
provide an efficient security routing algorithm for practical wireless sensor
networks. In this paper, we proposed a LEACH-based key management scheme
for wireless sensor networks based on Exclusion Basis Systems and μ TESLA.
We use EBS for key generation and distribution, and use μ TESLA to guarantee
the cluster head can update security key after the first round. The proposed
algorithm decreases the storage requirements of keys, and the network
communications load for updating cluster keys. The key management scheme
can enhance the survivability and ensure the security of WSNs.

Keywords: WSNs, Exclusion Basis Systems, LEACH, Security protocol.

1 Introduction
Due to the fact that in certain applications of sensor networks, like military
applications, diplomatic communications, e-learning and air traffic control etc.,
security of WSNs becomes more and more important. These systems process data
gathered from multiple sensors to monitor events in an area of interest. Sensors in such
systems are typically disposable and expected to last until their energy drains. Some
recent researches have focused on managing secure wireless communications in such
networks. When a large group of sensors are constrained in energy, computation and
communication resource, an efficient key management procedure becomes critical.
LEACH (Low Energy Adaptive Clustering Hierarchy) has very important significance
for wireless sensor network routing protocol, so design appropriate key management
scheme to strengthen its security is an important issue of current research.

1.1 System Model

The system architecture of the WSN is depicted in Fig. 1. In this model, a sensor
network consists of a large number of sensors distributed over an area of interest.
LEACH is a self-organizing, adaptive clustering protocol that uses randomization to
distribute the energy load evenly among the sensors in the network. The nodes organize
themselves into local clusters, with one node in each cluster acting as the cluster-head.

D. Jin and S. Lin (Eds.): Advances in CSIE, Vol. 2, AISC 169, pp. 253–258.
springerlink.com © Springer-Verlag Berlin Heidelberg 2012
254 J. Wang et al.

Cluster1

Base station

Member node
Cluster head

Cluster3 Cluster2

Fig. 1. Hierarchical architecture of Wireless Sensor Network

The cluster-heads fuse the data from the different sensors, perform mission-related data
processing, and send it to the base station via long-haul transmission. The cluster-head
nodes are not fixed but self-elected at different time intervals.

1.2 Related Work

Wireless sensor networks have a wide use on civil and military applications that call for
security, e.g., target surveillance in hostile environments. The resource constrained
environment has motivated extensive research that addresses energy-aware hardware
and software design issues [1], [2]. Much effort has been done on the energy-efficient
communication protocols [3], [4]. The energy-constrained nature of the sensor
networks makes the problem of incorporating security very challenging. The design of
the security protocols for sensor networks should be developed towards conservation of
the sensor resources. The level of security versus the consumption of energy,
computation and memory resources constitute a major design trade-off [10].
Recently, a number of solutions for securing WSNs have been proposed [5-9].
．
Ferreira A C etc. have proposed SLEACH, which use μ TESLA to authorize the
cluster head through the base station [6]. Leonardo B Oliveira presented a random key
distribution solution for securing clustered sensor networks which implemented the
authentication of cluster head to the members of the cluster, so as to ensure the
legitimacy of the cluster members [7]. Ding Han-cheng proposed a key management
for dynamically clustering WSN (KMDC) which adopts the EBS optimal combination
group key management algorithm, and can reduce the storage burden of the
management of the key and the key communication load of networks [8].

2 LEACH-Based Security Routing Protocol

A key management procedure is an essential constituent of network security. It is
necessary to maintain a balanced security level with respect to those constraints. In this
section we propose a LEACH-based security routing protocol for sensor networks,
whose objective is to minimize the sensor’s computation, communications and storage
overhead due to the key management operations.
 LEACH-Based Security Routing Protocol for WSNs 255

2.1 Exclusion Basis Systems

EBS was proposed by Eltoweissy in 2004, which based on a combination of group

communication principles [5]. Exclusion Basis Systems provide a general framework
for the investigation of key management systems. An EBS is defined as a collection of
Γ that denotes subsets of the set of members. Each subset corresponds to a key, and
the elements of a subset A ∈ Γ are the nodes have that key. An EBS Γ of dimension
(n, k, m) represents a situation in a secure group, n means the number of sensor nodes; k
means the number of keys assigned to each node and k+m means the total number of
keys. So it can be proved to be that:
1) When Ckk+ m ≥ n , any n combinations from Ckk+ m can constitute an EBS (n, k, m),
and then form a key distribution scheme.
2) By broadcast at most m packets, we can dynamically cancel and update the whole
key of any node, then drive out this node.
The base station is the only authority for key generation. It will be the direct service for
the administration keys for the cluster head and communication keys for the
inter-cluster head interaction and for message traffic. Although the head of a cluster
would be responsible for the key management for the sensors in the cluster, the keys
still have to be generated by the base station. Each cluster will be assigned a set of
distinct communication keys for data encryption. Sharing the same key among sensors
in a cluster will enable selective decryption of data messages for the purpose of
aggregation if instrumented in the network operation. The base station will periodically
renew keys for the inter-cluster head and cluster head to sensor nodes communication
to counter potential on-going spoofing.
It is proved in [5] that the overhead of an optimum EBS is half of that a binary key tree.
However EBS may suffer from collusion attacks. In [9], a special kind of polynomial, the
common trivariate polynomial, is presented, which can guarantee that all the nodes
having the same polynomial can get the same key. The common trivariate polynomial
keys are used in stead of the normal keys in EBS system and a new dynamic key
management scheme is designed for clustered wireless sensor networks, which can solve
the collusion attacks problem effectively. This problem is out the scope of our research.

2.2 System Initialization and Operation

The basic terminology in Table 1 is used for describing the key management protocol.

Table 1. Notation used in the Key management Protocols

Notation Description Notation Description
B Base station K int Initialization key
Ka (C j )
Cj The authentication key of cluster
Cluster j
j
Ni Sensor node i Mem ( C j )i Member node i of cluster j
Hj Cluster-head of cluster j K ebs EBS key management set
ID ( N i ) E ( K ,Data )
Encryption function of data
Sensor node i identifier
with key K
K master ( N i )
Key shared between node
Concatenation operator
i and BS
256 J. Wang et al.

We assume that the base station is secure. In the cluster establishment phase, sensor
nodes customize cluster head according to LEACH’s selection method and, then, the
cluster head broadcasts a hello packet. The Hello packet must be authenticated, and
encrypted through the initial key K int in the first cluster formation process,

H j → broadcast :E(K int ,Hello) . (1)

Member nodes receive the packet and then return the response to the cluster. Response
content includes their ID and Ack,

N i → H j :E ( K int ,ID ( N i ) Ack ) . (2)

And then cluster head sent the identification of all the members who want to join this
cluster to the base station,

(
H j → B: E K master ( H j ) ,ID ( N i ) ID ( N m ) " . ) (3)

The base station construct EBS, each cluster is assigned a set of distinct communication
keys for data encryption,

( (
B → H j : E Kmaster ( H j ) ,ID ( C j ) Ka ( C j ) K ebs E Kmaster ( Ni ) Ka ( C j ) K ebs ) ") (4)
.
At the network stable working stages, the member node i of cluster j sent the
authentication key of cluster j, identifier of the member node i of cluster j, EBS key
management set and data to the cluster-head of cluster j. Cluster-head of cluster j
sent K a ( C j ) , ID ( C j ) , K ebs , ID ( H j ) , K master ( H j ) and the fused information received
from cluster member nodes to base station,

( (
Mem ( C j ) → H j :E K a ( C j ) ,ID Mem ( C j )
i i
) )
K ebs ,Data . (5)

(
H j → B:E K a ( C j ) ,ID ( C j ) K ebs K master ( H j ) , ID ( H j ) ,Data ). (6)

Once the clusters are created and the TDMA schedule is fixed, data transmission can
begin. Assuming nodes always have data to send, they send it during their allocated
transmission time to the cluster head. The first round security LEACH cluster protocol
working process is shown in Fig. 2.
After a round of operation, the system reselects cluster head. Different from the
initial condition, the key K int will be erased for security reasons. Before the broadcast,
new cluster head request a radio key from base station, the μ TESLA (a
combinatorial optimization of the group key management problem) is to broadcast
K mac packet first, and then announced the keys by base station [11], to conform the
 LEACH-Based Security Routing Protocol for WSNs 257

Fig. 2. Flow map of the first round security LEACH cluster protocol constructing

attacker can't forge the correct broadcast packets before the key is announced. The K int
is replaced by K mac , and a new round of security LEACH become work.

3 Conclusion
In this paper, we present a LEACH-based security routing protocol for WSNs. We use
exclusion basis system for key generation and distribution. Exclusion Basis Systems
provide a general framework for the investigation of key management systems. By
using EBS, the storage requirements of storing keys is decreased, the network
communications load for updating cluster keys is reduced. The use of μ TESLA
guaranteed the cluster head update security after the first round. Such flexibility is
invaluable for the resource constrained sensor nodes.

References
1. Akyildiz, I.F., et al.: Wireless sensor networks: a survey. Computer Networks 38, 393–422
(2002)
2. Pottie, G.J., Kaiser, W.I.: Wireless integrated network sensors. Communications of the
ACM 43(5), 51–58 (2000)
3. Heinzelman, W.R., Wendi, B., et al.: Energy-Efficient Communication Protocol for
Wireless Microsensor Networks. Paper Presented at the Proceedings of the 33rd Annual
Hawaii International Conference on System Sciences, Maui, HI, pp. 1–10 (2000)
4. Younis, M., Youssef, M., Arisha, K.: Energy-Aware Routing in Cluster-Based Sensor
Networks. Energy-Awarerouting, 129–136 (2002)
258 J. Wang et al.

5. Eltoweissy, M., Heydari, H., Morales, L., Sudborough, H.: Combinatorial Optimization for
Key Management in Secure Multicast Environments. Network and System Management
(2004)
6. Ferreira, A.C., Vilaça, M.A., Oliveira, L.B., Habib, E., Wong, H.C., Loureiro, A.A.F.: On
the Security of Cluster-Based Communication Protocols for Wireless Sensor Networks. In:
Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3420, pp. 449–458. Springer, Heidelberg
(2005)
7. Oliveira, L.B., Wong, H.C., Bern, M., Loureiro, A.A.F.: SecLEACH-A Random Key
Distribution Solution for Securing Clustered Sensor Networks (2006)
8. Ding, H., Geng, Y., Bin, L.: Computer Engineering and Applications. Computer
Engineering and Applications, 157–160 (2008)
9. Kong, F., Li, C.-W., Ding, Q.-Q., et al.: An EBS-Based Dynamic Key Management Scheme
for Wireless Sensor Networks. Journal of Electronics & Information Technology 31(5)
(2009)
10. Eltoweissy, M., Youois, M., Ghumman, K.: Lightweight Key Management for Wireless
Sensor Networks, pp. 813–818 (2004)
11. Perrig, A., Szewczyk, R., et al.: SPINS: Security protocols for sensor networks. Wireless
Networks 8(5), 521–534 (2002)
12. Chorzempa, M., Park, J.-M., et al.: Key management for long-lived sensor networks in
hostile environments. Computer Communications 30(3), 1964–1979 (2007)
13. Cheng, H., Wang, J., Yang, G.: Research of Secure Frame Protocol Based on SPINS.
Computer Science 33(8) (2006)
14. Wang, J., Yang, G., Chen, S.: Secure LEACH Routing Protocol Based on Optimal Number
of Head Nodes for W ireless Sensor Network. Journal of Nanjing University of Posts and
Telecommunications (Natural Science) 28(3) (2008)