International Journal on Future Revolution in Computer Science & Communication Engineering ISSN: 2454-4248

Volume: 4 Issue: 3 545 – 550

_______________________________________________________________________________________________
Low Cost, Efficient Output- Only Infrastructure Damage Detection with
Wireless Sensor Networks
K R N Aswini Dr. J M Mathana Dr. Alladi Viswanadham
PG Scholar Professor Research Scholar
Dept. of Electronics and Dept. of Electronics and Dept. of Computer Science Engineering
Communication Engineering Communication Engineering SRM University,
S A Engineering College, S A Engineering College, Chennai
Chennai Chennai vishwanath_alladi@yahoo.com
krnaswini@gmail.com jm.mathana@gmail.com

Abstract - Sensor network comprises of sensors and actuators with universally useful processing components to agreeably screen physical or
ecological conditions, for example, temperature, pressure, and so on. Wireless Sensor Networks are particularly portrayed by properties like the
constrained power they can reap or store, dynamic network topology, expansive size of the arrangement. Sensor networks have an enormous
application in fields which incorporates territory observing, object tracking, fire detection, landslide recognition and activity observing. Given
the network topology, directing conventions in sensor networks can be named at based steering, various levelled based directing and area-based
directing. Low Energy Adaptive Clustering Hierarchy (LEACH) is a vitality productive various levelled based steering convention. Our prime
spotlight was on the examination of LEACH given specific parameters like network lifetime, soundness period, and so forth and furthermore the
impact of particular sending assault and level of heterogeneity on LEACH convention.

________________________________________*****__________________________________________

I. INTRODUCTION OF WIRELESS SENSOR NETWORKS Sensor nodes, as mention earlier, are low-cost and low-
power devices used to accumulate the desired data and
A. Introduction
forward it to the base station. A sensor node is composed of
A wireless sensor network (WSN) is a wireless network four parts as shown in Fig.2; the nodes are equipped with a
that comprises of dispersed sensor hubs that screen particular sensing unit, a radio transceiver or other wireless
physical or natural events or marvels, for example, communications device, a small microcontroller, and an
temperature, sound, vibration, pressure, or motion, at various energy source, usually a battery, some sensor nodes have an
areas [1]. The major advancement of WSN was first spurred additional memory component[4].
by military purposes to do war zone reconnaissance. These
days, new advancements have diminished the size, cost and
energy of these sensor hubs other than the improvement of
wireless interfaces making the WSN one of the most smoking
points of wireless correspondence. [2].
There are four essential parts in any WSN: (1) a gathering
of circulated sensor nodes; (2) an interconnecting wireless
network; (3) a social affair data base station(Sink); (4) an
arrangement of registering devices at the base station (or past)
to decipher and break down the got information from the Fig 2: Blocks of Wireless Sensor Nodes
nodes; some of the time the processing is done through the
Properties of sensor nodes lie behind the capacity of the
network itself.[3]
node to either being the wellspring of the information (i.e.
faculties the occasion) at that point transmits it, or simply
being an unadulterated handset that got information from
different sources then advances it to different nodes to achieve
the base station. This property relies upon the network
engineering that depends thus on the application. Fig.3
demonstrates distinctive accessible sensor nodes in the market
took after by demonstrating the determinations for each
node[5].
Fig 1: Structure of a WSN

545

IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)

_______________________________________________________________________________________
International Journal on Future Revolution in Computer Science & Communication Engineering
Volume: 4 Issue: 3
_______________________________________________________________________________________________
Fig 3: List of Sensor Nodes
The extent of an individual sensor node can fluctuate from
shoebox-sized hubs to the span of a clean. The cost of sensor
hubs is comparably factor, running from several dollars to a
couple of cents, contingent upon the measure of the sensor
network and the many-sided quality of individual sensor
nodes[6].
B. Motivation
Wireless Sensor Networks (WSN) is a dynamic research
territory in today's software engineering and media
transmission. The advancement of clustered sensor networks
has as of late been appeared to decrease framework delay,
reduce energy while performing information aggregation and
increment framework throughput. These are solid motivational
focuses on choosing LEACH as the standard convention for
the investigative examination. Additionally LEACH has a
couple however extremely critical disservices like it expect
every one of the hubs to have same vitality, which isn't the
situation dependably progressively issues, it can't be connected
for versatile nodes, disappointment of cluster heads makes a
considerable measure of issues and it doesn't consider that the
frameworks may have different base stations.
II. APPLICATION OF WIRELESS SENSOR NETWORK
Wireless Sensor Networks (WSN) offers a rich, multi-
disciplinary zone of research, in which various devices and
ideas can be connected to address an entirely different
arrangement of uses. Sensor networks may comprise a wide
range of sorts of sensors, for example, attractive, warm, visual,
seismic, infrared and radar, which can screen a wide
assortment of conditions. These sensor hubs can be put for
constant detecting, area detecting, movement detecting and
event location. The possibility of miniaturised scale detecting
and wireless association of these sensor hubs guarantees
numerous new application territories. A couple of cases of
their applications are as per the following:
A. Area Monitoring Applications
Area monitoring is an extremely basic utilisation of WSNs.
In territory monitoring, the WSN is conveyed over an area
where some physical movement or marvel is to be checked. At
IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)
_______________________________________________________________________________________
ISSN: 2454-4248
545 – 550
the point when the sensors recognise the occasion being
observed (sound, vibration), the occasion is accounted for to
the base station, which at that point takes proper action (e.g.,
communicate something specific on the web or to a satellite).
So also, wireless sensor networks can be sent in security
frameworks to distinguish movement of the undesirable,
activity control framework to identify the nearness of fast
vehicles. Likewise, WSNs finds large application in the
military territory for battlefield observation, checking
neighbourly powers, surveillance of restricting powers and
landscape, focusing on and fight harm appraisal.
B. Environmental Applications
A couple of environmental applications of sensor networks
incorporate woods fire discovery, green-house checking,
avalanche identification, air contamination recognition and
surge location. They can likewise be utilised for following the
development of bugs, winged animals and little creatures,
planetary investigation, observing conditions that influence
harvests and domesticated animals and encouraging water
system.
C. Health Applications
A portion of the healthcare applications for sensor
networks is giving interfaces to the disabled, incorporated
patient observing, diagnostics, tranquillise organisation in
healing facilities, checking the developments and inward
procedures of insects or other little creatures, telemonitoring
of human physiological information; and tracking and
monitoring doctors and patients inside a clinic.
D. Industrial Applications
WSNs are utilised as a part of development, for instance in
hardware condition-based upkeep. Already blocked off areas,
pivoting apparatus, perilous or limited regions, and portable
resources would now be able to become with wireless sensors.
They can likewise be utilised to gauge and screen the water
levels inside all ground wells and screen leachate aggregation
and expulsion.
E. Other Applications
Sensor networks now find immense application in our
everyday apparatuses like vacuum cleaners, miniaturised scale
wave stoves, VCRs and iceboxes. Other business applications
incorporate developing savvy once spaces, checking item
quality, overseeing stock, production line instrumentation and
some more.
III. ROUTING PROTOCOLS
The routing protocols for WSNs can be ordered into two
classifications; each has its subcategories as appeared in Fig.4.
546
International Journal on Future Revolution in Computer Science & Communication Engineering ISSN: 2454-4248
Volume: 4 Issue: 3 545 – 550
_______________________________________________________________________________________________
 Use of data aggregation
To accomplish these destinations, LEACH embraces a
various levelled plan where the system is composed of
clusters. Each cluster is overseen by a cluster head, which
plays out a few undertakings. One is the intermittent
accumulation of information from alternate individuals from
the cluster and totals it. Second, is sending the accumulated
Fig 4: Classification of Routing Algorithm in WSN information toward the base station as shown in Fig.6. [2]

A. Flat Routing Protocols

1) Flooding and Gossiping
Flooding is an outstanding strategy used to disperse data
over a system. It is a basic, simple to actualise procedure
that could be utilised for routing in WSNs yet it has
extreme drawbacks, for example,

Implosion – At the point when copied messages are sent

to a similar node

Overlap – Whenever at least two nodes share the same

watching zone, they may detect a similar occasion in the
Fig 6: Cluster based WSN
meantime. Thus, neighbour nodes get copied messages

Resource blindness – Does not think about the accessible The third process is to allocate an availability for every
energy resource. part for transmission purposes as demonstrated as follows. [4]

Gossiping is a variety of flooding, endeavouring to revise

some of its hindrances. Nodes do not communicate however
rather send a packet to a haphazardly chosen neighbour who
once it gets the packet it rehashes the procedure. It is not as
easy to execute as the flooding system, and it takes more time
for the engendering of messages over the system. Look at the
example in Figure5. [2]
Fig 5: Flooding System
B. Hierarchical Routing Protocols
a) Low-Energy Adaptive Clustering Hierarchy (LEACH)
LEACH is a routing protocol intended for gathering and
conveying it to the base station. The principle targets of
LEACH are:
 Extension of the network lifetime
 Reduce energy consumption
Fig 7: Time Frame for Cluster Formation
C. Location-Based Routing Protocols
1) Geographical Adaptive Fidelity (GAF)
GAF is a protocol that can be used in routing information
in WSN; area data is utilised to ascertain the separation
between two hubs so the vitality utilisation can be assessed. In
this way, the inspiration was that sit out of gear energy
overwhelms energy utilisation in WSN systems. The
arrangement was to utilise excess nodes in rest mode by
utilising Virtual Grid. [6]
GAF experiences three states amid task; Sleeping,
Discovery and Active. Initially, hub begins in revelation state
and after Td communicates disclosure message. From that
point forward, it enters the dynamic state when it sets Timer
Ta. Next, hub occasionally re-communicates disclosure
message while it is in the dynamic state. At long last, after Ta,
node comes back to revelation state and the dynamic node can
change to rest state when a higher-positioned node handles
routing as shown in Fig8.[6]

547

IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)

_______________________________________________________________________________________
International Journal on Future Revolution in Computer Science & Communication Engineering ISSN: 2454-4248
Volume: 4 Issue: 3 545 – 550
_______________________________________________________________________________________________

Fig 8: States of WSN Nodes

Here is a table comparing the three previous routing protocols:

TABLE 1: Comparision of Routing Protocols

Position Power Data

Classification Mobility Localization Complexity Multipath
Awareness Usage Aggregation

Flooding
Flat Possible No Limited Yes No Low Yes
&gossiping

LEACH Hierarchical Fixed No Maximum Yes Yes High No

GAF Location Limited No Limited No No Low No

IV. LEACH
A. Introduction
Heinzelman et al. [5] introduced a hierarchical clustering
algorithm for sensor systems, called Low Energy Adaptive
Clustering Hierarchy (LEACH). Drain orchestrates the nodes
in the system into small clusters and picks one of them as the
cluster-head. Node first faculties its objective and afterwards
sends the significant data to its cluster-head. At that point, the
cluster head totals and packs the data got from every one of
the nodes and sent it to the base station. The nodes picked as
the cluster take deplete off more energy when contrasted with
alternate nodes as it is required to send information to the base
station which might be far found. Henceforth LEACH utilises
arbitrary turn of the nodes required to be the cluster-heads to
equally circulate energy utilisation in the system. After the
various number of trials, it was discovered that 5% of the
aggregate number of nodes needs to go about as the cluster-
heads. TDMA/CDMA MAC is utilised to decrease between
the cluster and intra-cluster impacts. This convention is
utilised were a steady checking by the sensor nodes are
required as information gathering is concentrated (at the base
station) and is performed intermittently.
B. Operation
LEACH operations can be divided into two phases:-
1. Setup phase
2. Steady phase
In the setup stage, the clusters are shaped, and a cluster-
head (CH) is decided for each cluster. While in the relentless
stage, information is detected and sent to the local base station.
The steady stage is longer than the setup stage. This is done
with a specific end goal to limit the overhead cost.
1. Setup stage:- During the setup stage, a foreordained part of
nodes, p, pick themselves as cluster-heads. This is finished by
a limit threshold, T(n). The limit threshold relies on the
coveted rate to wind up noticeably a cluster-head-p, the
current round r, and the arrangement of nodes that have not
548

IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)

_______________________________________________________________________________________
International Journal on Future Revolution in Computer Science & Communication Engineering
Volume: 4 Issue: 3
_______________________________________________________________________________________________
turned into the cluster-head in the last 1/p rounds, which is
indicated by G. The formulae is as follows :
(1)
Each node needs to be the cluster-head picks esteem, in the
vicinity of 0 and 1. Random chance that this arbitrary number
is not as much as the edge esteem, T(n), at that point the node
turns into the cluster set out toward the current round. At that
point each chose CH communicates a promotion message to
whatever remains of the nodes in the system to welcome them
to join his or her clusters. In light of the quality of the request
flag, the non-cluster head nodes choose to join the clusters.
The non-cluster head nodes at that point illuminate their
particular cluster-heads that they will be under their cluster by
sending an affirmation message. In the wake of accepting the
affirmation message, contingent on the quantity of nodes
under their cluster and the kind of data required by the
framework (in which the WSN is setup), the cluster-heads
makes a TDMA plan and assigns every node availability in
which it can transmit the detected information. The TDMA
plan is communicated to all the cluster-individuals. If the span
of any cluster turns out to be too expansive, the cluster-head
may pick another cluster set out toward its cluster. The cluster-
set out picked toward the current round cannot again turn into
the cluster-head until the point that the various nodes in the
system have not turned into the cluster head.
2. Steady phase:- During the steady phase, the sensor nodes,
i.e. the non-cluster head nodes begins detecting information
and sends it to their cluster-make a beeline for the TDMA
plan. The cluster-head node, in the wake of getting
information from all the part nodes, totals it and after that
sends it to the base-station After a specific time, which is
resolved from the earlier, the system again backpedals into the
setup stage, and new cluster-heads are picked. Each cluster
imparts utilising diverse CDMA codes with a specific end goal
to lessen impedance from nodes having a place with different
clusters.
V. RESULTS AND DISCUSSIONS
The results are calculated and analyzed based on the
above mentioned procedures.
Fig 9: Node Placement and Initialization using NS2
IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)
_______________________________________________________________________________________
ISSN: 2454-4248
545 – 550
A. Residual Energy:
Fig 10: Residual Energy Curve
The energy model speaks to the energy level of nodes in
the system. The energy model characterised in a node has an
underlying worth that is the level of energy the node has
toward the start of the reproduction. This energy is named as
initial Energy_. In reproduction, the variable "energy" speaks
to the energy level in a node at any predefined time. The
estimation of initial Energy_ is passed as an info contention. A
hub loses a specific measure of energy for each packet
transmitted, and each bundle got. Accordingly, the estimation
of initial Energy in a node gets diminished. The present
estimation of energy in a hub in the wake of getting or
transmitting directing parcels is the remaining energy.
Information Transmission is set up between nodes utilising
UDP operator and CBR movement. Remaining energy of the
hub is assessed by getting to inbuilt variable "energy" in wind
energy methodology at various circumstances.
B. Packet Loss Ratio:
Fig 11: Packet Loss Ratio Curve
Packet loss occurs when at least one packet of information
traversing system neglect to achieve their goal. Packet loss is
ordinarily caused by organising clog, however, can likewise
have different causes. Packet loss is estimated as a level of
packet loss as for packets sent.
C. Packet Delivery Ratio:
The proportion of packets that are effectively conveyed to
a destination contrasted with the quantity of packets that have
been conveyed by the sender. The extent of the number of
packets conveyed against the quantity of packets sent.
549
International Journal on Future Revolution in Computer Science & Communication Engineering ISSN: 2454-4248
Volume: 4 Issue: 3 545 – 550
_______________________________________________________________________________________________
REFERENCES
[1] Yingshu Li, My T.Thai, Weili Wu, “Wireless Sensor Networks
and Applications”, 2008.
[2] Kazem S., Daniel M., Taieb Z., “Wireless Sensor Networks:
Technology, Protocols and Applications”, 2007.
[3] Carlos Pomalaza-Ráez, " Wireless Sensor Networks", University
of Oulu, Finland, 2004.
[4] Mikio Takizawa, "Survey: Wireless Sensor Network (WS)",
Senior Capstone Seminar, 2008.
[5] Katia Obraczka, "Tutorial: WSN", University of California, May
2006.
[6] Matthias Handy, “Routing in Wireless Sensor Network”,
Fig 12: Packet Delivery Ratio Curve University of Rostock.

D. End to End Delay:

End-to-end delay or one-way delay (OWD) alludes to the
time taken for a packet to be transmitted over a system from
source to sink node.

Fig 13: End to End Delay

E. Throughput:
Throughput is a unit of what number of units of
information a system can process in a given measure of time.
It is associated exhaustively to systems going from different
parts of nodes and network frameworks to associations.
Related measures of framework profitability incorporate, the
speed with which some particular workload can be finished,
and reaction time, the measure of time between a solitary
intelligent client demand and receipt of the reaction.

Fig 14: Throughput

550

IJFRCSCE | March 2018, Available @ http://www.ijfrcsce.org (Special Issue)

_______________________________________________________________________________________