See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/288315770

Secure Low Energy Adaptive Clustering Hierarchy Routing Protocol Ensuring

Data Freshness in Wireless Sensor Network

Article · December 2015

CITATIONS READS

0 116

2 authors, including:

Souvik Chatterjee
University of Engineering & Management, Kolkata, India
13 PUBLICATIONS   82 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

ECG SIGNAL PROCESSING, BIOMEDICAL ENGINEERING View project

All content following this page was uploaded by Souvik Chatterjee on 27 December 2015.

The user has requested enhancement of the downloaded file.

 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com
Secure Low Energy Adaptive Clustering Hierarchy Routing
Protocol Ensuring Data Freshness in Wireless Sensor Network
1
Sumita Pani and 2Souvik Chattejee,
1
School of Education Technology, Jadavpur University, Kolkata, India
2
Dept. of CSE, University of Engineering & Management, Kolkata, India
Abstract: Wireless sensor networks embodies of small,
inexpensive and shallow power sensor nodes with limited
resources, uses in many paramount application like forest
fire detection, remote patient monitoring in medicine,
battlefield surveillance etc. But the efficiency of sensor
networks strongly clings to routing protocol. Due to
application of Wireless Sensor Network (WSN) in critical
areas secure message communication and fresh data is
very important. This work shows an algorithm which
depicts secured routing protocol ensuring data freshness
in WSN. This work not only reveals the secured message
communication but also accepts fresh data.
Keywords: Security, Attack, Routing, Cluster, Temporal
Leashes, Data Freshness.
I. INTRODUCTION
Wireless sensor nodes consist of distributed autonomous
sensor to monitor physical or environmental conditions
and co-operatively pass their data to the base station
through the network. These sensor nodes can sense,
measure and gather information from the environment
and transit the sensed data to the base station. Sensor
replacing man power which can be deployed where
human interaction is not possible. Due to the broadcast
nature of transmission medium wireless sensor network
vulnerable to security attacks like wormhole attack,
replay attack, selective forwarding attack etc.
Routing protocol is used to increase the efficiency of
WSN. Cluster based routing protocol is suitable for WSN
because it gives a good organization of networks nodes
resources and ensures efficient routing. Low Energy
Adaptive Clustering Hierarchy routing protocol
(LEACH) is the first network routing protocol that uses
hierarchical routing for Wireless Sensor Networks to
increase the life time of network. All the nodes in a
network organize themselves into local clusters, with one
node acting as the cluster head. All non-cluster head
nodes transmit their data to the cluster-head, while the
cluster head node receive data from all the cluster
members, performs signal processing functions on the
data and transmit data to the remote base station. LEACH
incorporates randomized rotation of the high energy
cluster head position such that it rotates among the
sensors in order to avoid draining the battery of any one
IJTRD | Nov - Dec 2015
Available Online@www.ijtrd.com
sensor in the network. This paper used LEACH routing
protocol to increase the network life time. Due to
application of WSNs in mission critical areas, secured
message communication is very important, for that
different security mechanism have been developed. This
paper proposed an algorithm to detect malicious node
using secured LEACH protocol in WSNs which ensures
data freshness and analysis the performance by
comparing the results between two secure LEACH
algorithms.
This manuscript is organized as follows. Section 2
contains related work. In Section 3, it implements the
proposed work. Section 4 has given comparative
experiment results. Section 5 draws conclusion and
contains reference papers.
II. RELATED WORK
A lot of research work carried out in wireless sensor
networks. Initially this section describes different security
mechanism in wireless sensor networks and later this
paper proposed a new secure algorithm.
Cluster routing model is efficient model still there are
some issues. Wang Xiao-yunet. al. [12] proposed
SLEACH: Secure Low Energy Adaptive Clustering
Hierarchy. Here SLEACH is implemented using
inexpensive symmetric key. SLEACH provide security in
LEACH by using the building block of SPINS (security
protocol for sensor networks).SLEACH protects against
different type of attacks but SLEACH cannot prevent to
crow the time slot schedule of a cluster and does not
guarantee data confidentiality. Cluster could not change
dynamically and it does not provide more nodes, which
are nearer to base station to distribute high overhead.
Nishant Sharma et.al.[13] proposed various approaches to
detecting wormhole attacks in WSNs. In this paper a time
based approach is used to detect malicious node. In this
approach the sending node includes in the packet the time
at which it send the packet ts. When receiving a packet,
the receiving node compares this value to the time at
which it received the packet. tr. The receiver is thus able
to detect the malicious node. But this approach does not
ensures data freshness that means it cannot prevent replay
attack. It does not ensures data is recent.
229
 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com
Mandicou Ba et. al. [15] proposed a deterministic key
management scheme for securing cluster based sensor
networks .This paper proposed a deterministic key
management scheme, called DKS-LEACH, to secure
LEACH protocol against malicious attacks. The results
indicate clear advantage of their approach in preventing
the election of untrustworthy cluster head as well
different kind of attacks from malicious sensor nodes.
But there is a disadvantage. Here managing of keys
between base station and cluster head, cluster head and its
member nodes take more time.
Leonardo B. Oliveriaet. al. [16] proposed Sec LEACH –
a random key distribution solution for securing clustered
sensor networks .this paper proposed a random key pre-
distribution to set up keys for securing node to CH
communication in LEACH The solution is meant to
protect the network from attacks by outsider’s that is
adversaries that do not have credentials to show that they
are member of the network. Another assumption is that
BS is trusted. Random key pre-distribution has a
disadvantage. In this approach a common key is not
guaranteed to be found between any two nodes wanting
to communicate.
Kun Zunget. al. [17] proposed a secure routing protocol
for cluster based wireless sensor networks using group
key management .This scheme proposed a random pair-
wise keys (RPK) scheme, an optimized security scheme
that relays on symmetric-key methods, is lightweight and
preserves the core of the original LEACH, Simulations
show that security of RLEACH has been improved, with
less energy consumption and lighter overhead. The main
drawback of the pair wise scheme is scalability. In those
networks, if the size of network increases, the number of
keys required to be stored in each sensor will increased.
Xueying Zhang et. al. [18] worked on an energy
efficiency of symmetric key cryptographic algorithms in
wireless sensor network. It consider both stream ciphers
and block ciphers .This paper shows that the lightweight
block cipher, BSPN, achieves good performance,
providing energy efficiency as well as suitable security
for sensor nodes in a WSN. Symmetric key
authentication scheme cannot applied to LEACH because
the key chain would require significant storage space in
the broadcasting CHs and all nodes in the network would
need to store one key for each node in the network which
is neither practical nor scalable.
Sencun Zhu et. al. [19] worked on a LEAP: Efficient
Security Mechanisms for Sensor Networks. A sensor
network is self-possessed of a huge amount of sensor
nodes. LEAP, is a key management protocol for sensor
network that is designed to support in-network
IJTRD | Nov - Dec 2015
Available Online@www.ijtrd.com
processing, while at the same time restricting of the
security impact of a node compromise to the immediate
network neighbored of the compromised node. But there
are disadvantages. If LEAP were used to secure
communication in LEACH, a new KD could be require
per round. This not only would be inefficient but also
infeasible as LEAP relies on a master key that is erased
from nodes memory as soon as the first KD is performed.
In LEACH communication pattern, two different types of
authentication are required. Authenticated broadcast, for
broadcasts from the CHs to the rest of the network and
pair wise authentication for the remaining (node to CH
and CH to BS) communication.
III. PORPOSED MODELLING
Secure data transmission is critical issue for WSN. The
main idea behind LEACH is to form clusters of the
sensor nodes based on the received signal strength
indicator and used cluster heads for routing data toward
the sink.. This technique is more energy efficient because
only selected cluster heads perform the routing. The
important factor of LEACH is security. To secure
LEACH protocol, authentication of node is needed to
check that the sensor node is intruder or not before
joining to cluster head. For that this paper proposed a
time based authentication LEACH protocol. This
protocol tells that if message is received by cluster head
within a packet expiration time then particular node is
authenticate otherwise that particular node is malicious
.Only authentication is not sufficient to secure LEACH
protocol in WSNs. To discard duplicate packets and old
packets, there is a need of data freshness. Data freshness
ensures that data is recent. For that, data freshness is used
with this secured LEACH protocol.
A time based approach termed as Temporal leashes is
used to secure LEACH protocol. In this approach the
sending node includes sending time in the packet at
which time it sent the packet (ts).When receiving a
packet, the receiving nodes compares this value to the
time at which it received the packet (tr).Temporal leashes
can be constructed by including packet expiration time
(te), after which the receiver should not accept the packet
that means if (tr,<te) then receiver receives the packet
otherwise drops the packet. Packet expiration time is
calculated using this formula:-
te =ts +L/C -
Where, L=Prevents the packet from travelling further
than distance L, C= Propagation speed of wireless signal
and = Clock synchronization error.
230
 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com

START

READ r,p

RANDOMLY TAKE n NUMBER OF SENSOR NODE IN THE SQUARE FIELD xm*ym.

SET THE LOCATION OF BS

YES NO
IF(r>0)

CALCULATE T(S)=p/(1-p*(r%(1/p)))

SiGENERATE A RANDOM NUMBER RAND WHEREi = 1, 2, 3, ……n.

NO
IFRAND<T(S)?
YES

NODE Si IS NORMAL SENSOR NODE

NODE Si IS CH

CH BROADCAST WAIT FOR CH

ADV MESSAGE ADVMESSAGE

WAIT FOR JOIN FIND THE NEAREST CLUSTER HEAD

REQUEST MESSAGE AND SEND JOIN REQUEST MESSAGE

YES WAIT FOR REQUEST

IF Si SEND TIME
SLOT TO Si MESSAGE AND TIME SLOT
AUTHENTICATE?

NO
WAIT FOR PACKET FROM SEND PACKET TO CH
SENSOR NODE
MALICIOUS=MALICIOUS+1

NO IF PACKET
RECENT?

YES

Aggregate sensed data and send to BS

r=r-1
END

IJTRD | Nov - Dec 2015

Available Online@www.ijtrd.com 231
 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com
Initially all nodes are deployed in a sensor network. All The following conditions are assumed in this proposed
sensor nodes are same initial energy. All sensor nodes algorithm.
are static and have an ID.A particular node is chosen as
1. Sensor nodes are homogeneous, randomly
BS.After deployment of sensor node, they should have
distributed in square field and have a unique ID.
able to form the clusters. When clusters are being
2. The base station is fixed and may be placed at
created, each node decides whether or not to become a
any location of the square field.
cluster head for the current round. This decision is made
3. Sensor nodes are stationary.
by the node n choosing a random no. between o and 1. If
4. All sensor node send their data to the
the no. is less than threshold T (n) the node became
corresponding cluster head through single hop
cluster head for the current round.
except base station.
5. Initially all the sensor node have same energy.
T(n)= p/(1-p*(r%1/p)) , if n € G. The simulation was run with the standard simulation
parameters as mentioned below.
= 0 , if n € G.
Table 1: Simulation Parameters

Where, p is desired percentage of cluster head,r is the Parameter Value

current round,G is the set of nodes that have not been area 100 X 100
cluster heads in the last 1/p rounds.Sensor node find its
cluster using nearest distance b/w sensor node and No. of nodes 100
cluster head. Then cluster is formed. Packet size 2000
Authentication of sensor node is done using temporal Control packet size 200
leashes.It includes packet sending time(ts),packet
receiving time (tr) and packet expiration time(te).Te is E0 0.5J
calculated using this formula. ETX 5 X 108
Te= ts+ L/C - ERX 5 X 108
L=Prevents the packet from travelling further than Emp 1.3 X10-15
distance L.
Efs 10-11
C= Propagation speed of wireless signal.
EDA 5 X 10-9
=Clock synchronization error.
P 0.05
If tr<te then accept the packet otherwise drop them.
rmax 90
After authentication, cluster head check that the data is
fresh or not using nonce, a random time variable. For C 3 x 108 m/s
each round nonce is incremented (nonce+j) and check 0.3
with the previous nonce value. If both values is not same
then accept the packet otherwise discard them.
IV. RESULTS AND DISCUSSIONS In this paper temporal leashes is used to authentic the
sensor node is includes packet sending time ts, takes
This paper provides security services in both setup
receiving time tr.Then calculates te.
phase and steady state phase. Temporal leashes is used
to authenticate the sensor node during setup phase and Te=ts +L/C – ……………………………(i)
nonce, a random time based variable is used for data Where L=Prevents the packet from travelling further
freshness in steady state phase. Java development toolkit than distance L,C=Propagation speed of wireless
and Microsoft excel is used to run the algorithm and signal.= Clock synchronization error.
compare the results.This algorithm evaluates the
performance by analyzing and comparing the results of If tr<te then accept the packet otherwise drops the
two secure algorithm 1)secured LEACH protocol using packet.
temporal leashes but has no data freshness mechanism Secured leach using temporal leashes only authenticate
incorporated and 2) secured LEACH protocol using the sensor node does not prevent replay attack means it
temporal leashes with data freshness. does not contain fresh data.To get fresh data,data

IJTRD | Nov - Dec 2015

Available Online@www.ijtrd.com 232
 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com
freshness is used in secured LEACH to reduce traffic [2] I.F.Akyildiz et al.,”wireless sensor
and get fresh data.Nonce,a time based random variable networks:asurvey”,in proceedings of computer
is include to prevent replay attackingeach round j, the networks,vol.38,2002,pp.393-422.
value of the freshness token(nonce+j) incremented by [3] J.N Al-karaki and A.E.Kamal,”routing techniques in
1.For each round value of the nonce is change.If the wireless sensor networks:asurvey”,in proceedings of
value of the nonce is same with the previous value of IEEE,vol.11,No.6,2004,pp.6-20.
any round then this packet is discarded although it is [4] Vinod Kumar Jatav, MeenakshiTripathi , and M S
authenticated. Gaur and Vijay Laxmi, “Wireless Sensor Networks:
Attack Models and Detection”, in proceedings of
IACSIT Hong Kong Conferences, vol.30,2012,.pp.
144-148.
[5] Min-kyu-choi,Rosslin John Robles,Chang-
hwaHong,Tai-hoonKim,”Wireless sensor
security:Vulnerabilities,Threatsand
Countermeasures”,in proceedings of international
journal of Multimedia and ubiquitious
Engineering,vol.3 No. 3,pp.77-84,2008.
[6] Zoran S.Bojkovic,BojanM.Bakmaz and Miodrag
R.Bakmaz,”security issues in wireless sensor
networks”,in proceedings of international journal of
communications,vol.2 No.1,pp.106-112,2008.
Figure 2: Comparison of Detection Ratio of Malicious [7] Al-Sakib Khan Pathan,Hyung-woo
Node Between Secured Algorithm Using Data L&R,ChoongSeonHong,”security in wireless sensor
Freshness And Without Data Freshness. networks”,in proceedings of
The resultant graph draws on two aspects. Round and ISBN,vol.89,2006,pp.1043-1048.
detection ratio of malicious node.The result [8] Dr.Gpadmavathi,Mrs. D. Shanmugapriya,”a survey
demonstrates that the proposedalgorithm detects more of attacks,security mechanisms and challenges in
no. of malicious node because this algorithm adds wireless sensor networks”,in proceedings of
nonce, a random time variable for data freshness and international journal of computer science and
there is no duplicate packet using this proposed information security,vol.4,no.1 & 2,2009,pp.1-9.
algorithm. [9] MahendraS.Thakare,RageshrivBakhare,”Security of
cluster based wireless sensor routing”,in
CONCLUSION proceedings of international journal of latest trends
In continuous monitoring application in wireless sensor in engineering and
network, each sensor nodes transmits its sensed data to technology,vol.2,No.3,2013,pp.134-138.
the sink node periodically, such application required [10] Rabia Noor Enam,MumtazulInam and
fresh data. Security is important in these application. RehanInamQureshi,”Energy consumption in random
But only security cannot remove duplicate packet that cluster head selection phase of wireless sensor
means cannot get fresh data. To improve security and to network”,in proceedings of
get fresh data, data freshness is used in this paper.The IPCSIT,vol.30,2012,pp.38-42.
detection ratio of malicious node using secured LEACH [11] Ali
ensuring data freshness is more than secured LEACH Modirkhazeni,Mohammadjavadabbasi,”secure
without data freshness in WSNs. It also reduces high hierarchical routing protocols in wireless sensor
traffic and network congestion. This paper works on networks”,in proceedings of international journal of
static sensor node. This algorithm can be extended computer communication and
further in a secure multi hop LEACH protocol in WSNs networks,vol.2,No.1,2012,pp.6-15.
and also node mobility can be incorporated. [12] Wang Xiao-yun,Yang Li-zhan,Chenke-
References fei,”SLEACH: Secure Low Energy Adaptive
Clustering Hierarchy Protocol”, in proceedings of
[1] Prabhatkumar,M.P Singh and V.STriar,”A review of the national natural science Foundation of
routing protocols in wireless sensor networks”,in China,vol.10,No.1, 2005, pp.127-131.
proceedings of international journal of engineering [13] NishantSharma,UpinderpalSingh,”various
research and technology,vol.1,No.4,2012,pp.1-10. approaches to detect wormhole attack in wireless
sensor networks”,in proceedings of international

IJTRD | Nov - Dec 2015

Available Online@www.ijtrd.com 233
 International Journal of Trend in Research and Development, Volume-2 Issue-6, ISSN: 2394-9333
www.ijtrd.com
journal of computer science and mobile (I4C), 21 - 22 November 2014, MSRIT, Bangalore,
computing,vol.3,No.2,2014,pp.29-33. India, pp. 247 - 252, DOI:
[14] YurongXu,GuanlingChen,James Ford and Filler 10.1109/CIMCA.2014.7057799, Print ISBN: 978-1-
Makedon,”Detecting wormhole attacks in wireless 4799-6545-8.
sensor networks”,in proceedings of international [23] Mukherjee A, Chakraborty S, Azar AT,
federation for information Bhattacharyay SK, Chatterjee B, Dey N (2014)
processing,vol.253,2008,pp.267-279. Unmanned Aerial System for Post Disaster
[15] MandicouBa,IbrahimaNiang,BambaGueye and Identification. The International Conference on
Thomas Noel,”A Deterministic Key Management Circuits, Communication, Control and Computing
Scheme for Securing Cluster Based Sensors (I4C), 21 – 22 November 2014, MSRIT, Bangalore,
Networks”,in proceedings of IEEE international India, pp. 247 – 252, DOI:
conference on Embedded and Ubiquitous 10.1109/CIMCA.2014.7057799, Print ISBN: 978-1-
Computing,2010,pp.422-427. 4799-6545-8.
[16] Leonardo B.Oliveria, Hao Chi Wong, Marshall [24] Roy P., Goswami S., Chakraborty S, Azar AT,
Bern.Eduardo Habib, Antonio A.F.Loureiro,Ricardo Dey N (2014) Image Segmentation Using Rough
Dahab,”secLeach:a random key distribution solution Set Theory: A Review. International Journal of
for securing clustered sensor networks”,in Rough Sets and Data Analysis, 1(2): 62-74.
proceedings of fifth IEEE international symposium [25] Chowdhuri S, Roy P, Goswami S, Azar AT,
on network Computing and applications,2006,pp.1- Dey N (2014) Rough Set Based Ad Hoc Network: A
8. Review. International Journal of Service Science,
[17] Kun Zhang, Cong Wang and CuirongWang,”A Management, Engineering, and Technology. 5(4):
secure Routing Protocol for Clustered-Based 66--76.
Wireless Sensor Networks using Group key
Management”,in proceedings of IEEE,pp.1-5,2008.
[18] Xueyingzhang,HowardM.Heys and Cheng
Li,”Energy Efficiency Of Symmetric Key
Cryptographic Algorithms In Wireless Sensor
Networks”,in proceedings of 25th Biennial
Symposium On Communications,pp.168-172,2010.
[19] SencunZhu,SanjeevSetia and Sushil
Jajodia,”LEAP: Efficient Security Mechanisms For
Large Scale Distributed Sensor Networks”, in
proceedings of a Conference of ACM.
[20] Dey N, Karaa WBA, Chakraborty S, Banerjee
S, Salem MAM, Azar AT (2015) Image Mining
Framework and Techniques: A Review.
International Journal of Image Mining,
Indersceince, 1(1): 45–64.
[21] Acharjee S, Chakraborty S, Samanta S, Azar
AT, Dey N, Hassanien AE (2014) Highly secured
multilayered motion vector watermarking. In: AE
Hassanien, M Tolba, AT Azar (eds.) Advanced
Machine Learning Technologies and Applications:
Second International Conference, AMLTA 2014,
Cairo, Egypt, November 28-30, 2014. Proceedings,
Communications in Computer and Information
Science, Vol. 488, Springer-Verlag GmbH
Berlin/Heidelberg. ISBN: 978-3-319-13460-4
[22] Amartya Mukherjee, Sayan Chakraborty,
Ahmad Taher Azar, SoumyaKantiBhattacharyay,
Basukinath Chatterjee, NilanjanDey (2014)
Unmanned Aerial System for Post Disaster
Identification. The International Conference on
Circuits, Communication, Control and Computing

IJTRD | Nov - Dec 2015

Available Online@www.ijtrd.com 234
View publication stats