A Project Plan

On
INTRUSION DETECTION USING WIRELESS SENSOR NETWORKS

Submitted to
Amity University Uttar Pradesh

in partial fulfillment of the requirements for the award of the degree of

Bachelor of Technology
In
Electronics and Communication

RISHI DEB
under the guidance of
Prof (Col) R.K Kapur
DEPARMENT ………………………………………………………..
AMITY SCHOOL OF ENGINEERING AND TECHNOLOGY
AMITY UNIVERSITY UTTAR PRADESH,NOIDA (U.P.)
NOVEMBER 2019
 DECLARATION

I/We, ……………………….., student(s) of B.Tech (….) hereby declare that the project titled

“……………………………………………..” which is submitted by me/us to Department of

……………………………., Amity School of Engineering and Technology, Amity University Uttar Pradesh,
Noida, in partial fulfillment of requirement for the award of the degree of Bachelor of Technology in ….. ,
has not been previously formed the basis for the award of any degree, diploma or other similar title or recognition.

Noida

Date Name and signature of Student(s)

 AMITY SCHOOL OF ENGINEERING & TECHNOLOGY

CERTIFICATE

On the basis of declaration submitted by …………….., student(s) of B. Tech ….., I hereby

certify that the project titled “…………………………………………………...” which is submitted to
Department of ………………………………, Amity School of Engineering and Technology, Amity University Uttar
Pradesh, Noida, in partial fulfillment of the requirement for the award of the degree of Bachelor of Technology in
….., is an original contribution with existing knowledge and faithful record of work carried out by him/them under
my guidance and supervision.

To the best of my knowledge this work has not been submitted in part or full for any Degree or

Diploma to this University or elsewhere.

Noida

Department of ……………….
Amity School of Engineering and Technology
Amity University Uttar Pradesh, Noida
 Project Plan

TABLE OF CONTENTS

INTRODUCTION 1
PURPOSE OF PLAN 1
BACKGROUND INFORMATION/AVAILABLE ALTERNATIVES 1
PROJECT GOALS AND OBJECTIVES 1
SCOPE 2
SCOPE DEFINITION 2
PROJECTED BUDGET 2
CONSTRAINTS 2
PROJECT CONSTRAINTS 2
PROJECT MANAGEMENT APPROACH 3
PROJECT TIMELINE 3
PROJECT ROLES AND RESPONSIBILITIES 4
RISK ASSESSMENT 5
PROJECT RISK ASSESSMENT 5
LITERATURE REVIEW 3

INTRODUCTION

Purpose of Plan

This project proposes to reduce the rate of infiltration into protected areas. It makes
use of a network of sensors which will be planted in regions where the presence of
security forces is comparatively less in number. The aim of this project is to in turn
reduce the casualty rates in border areas by acting as reporting mechanism in the case
of any infiltration being picked up the system.

Background Information/Available Alternatives

In case of border areas where it is a geographical challenge to station armed

personnel in order to act as first warning measures as well as relay the information
back to base so that necessary arrangements can be made and the threat can be
neutralized, the only alternative to this is some kind of remote accessibility, as these
areas are essentially gaps which cannot be heavily guarded due to the geographical
constraints. Hence by using a wireless sensor network a security grid can be realized
which will relay instances of infiltration by using a dedicated gateway node.
GOALS AND OBJECTIVES
1. To cover the gaps between key defensive locations where the number of men
stationed are less in number.
2. To make the sensors capable of communicating with each other, in a way act
as routers in case a sensor in out of range from the main gateway, the trigger
signal from that very sensor will be routed by close by sensors to a gateway.
3. To establish a connectivity between a gateway and main system, Arduino or
raspberry pie which act as a device to notify the control room.
4. To come up with formulations to which could reduce the false alarm rates.
(Combination of sensors while implementing a working model.)

SCOPE

Scope Definition

The scope of the project is to realize a Wireless Sensor Network which will act as an
Early warning alarm system, covering at least 200-300 meters of length facing the
infiltration path, the sensor network will progress inwards by about 20 meters in a
grid fashion, so that there is some redundancy of sensors and the activity is picked by
one if missed by another, the inward progression of the sensor network will also act
as a path way for the distant sensors to relay any information to the gateway sensor.
The sensors in the middle will act as routers, routing the message to the gateway
node which has paramount connectivity.

Projected Budget
The budget includes several micro-controllers (7-10) and a host of sensors including
pressure, heat, humidity and a low powered camera which is triggered only when the
pressure and heat sensor pick up a relevant reading. The micro-controller of choice is
arduino uno, chosen considering the ease of modelling it as per our needs as well as
the digital and analog pins provided by it will suffice the needs of this project.
Furthermore Atmega-16 microprocessor is efficient and computationally capable
enough to run various WSN routing protocols needed for this project.
CONSTRAINTS

Project Constraints

Total area covered by the Wireless Sensor Network – 4000m^2

Packet Delivery ratio > 80%
Throughput – 15kb/s
Traffic type – CBR
Routing protocol - DSDV

APPROACH TO PROJECT MANAGEMENT

 Project Timeline

Responsibilities and Project Roles

In case if project is to be done in groups then the role and responsibility of each
member is defined in following table

Role Responsibilities Participant(s)

 Setting up the linux run time Rishi Deb
Simulations
environment on virtual box and
installing all the required packages
(NS2 , Network Scenario
Generator, analysis.awk,
Bonnmotion etc. )
Rishi Deb
Literature
Acquiring the required theoretical
review
knowledge of various routing
protocols and isolating the problem.
Rishi Deb
Determining which routing protocol
will be favourable in considering
Analysis
the project parameters and problem
in mind, the choice is made based
on the output of the simulations
after thorough comparisons.
Rishi Deb
Implementing the developments on
a micro-controller of choice.
Rishi Deb
Hardware
Detailed documentation of the
Implementation
project marking all the
developments.
Report Writing

Risk Assessment

Project Risk Assessment

 Risk Risk Level Likelihood of Mitigation Strategy
L/M/H Event
Connectivity issue due to Medium  Medium  Placing the nodes within range if it
limitations in range does not compromise on the length
between subsequent nodes covered, otherwise using Zigbee
module.

LITERATURE REVIEW

This review is based on a comparative study of mainly three prevalent routing

protocols used in wireless sensor networks.
1. AODV - Ad-HOC on Demand Distance Vector routing protocol.
2. DSR - Dynamic Source Routing.
3. DSDV - Destination Sequenced Distance Vector routing protocol.
Routing protocols perform the responsibility of discovering multi-hop paths and
greatly affect the performance of the wireless sensor network.

On demand or reactive routing protocols create routes only when they are needed
Reactive protocols use two different operations to find routes as well as maintain
them the first one is the route discovery process operation and the second one is the
route maintenance operation. When a node requires a route to the destination, it starts
the route discovery process inside the scope of the Ad-HOC network. This process is
completed as soon as a viable route is found to the destination node or all possible
route permutations are scrutinized.

Route maintenance is the process of reacting to changes in topology that happen after
the route was initially created. When link is broken, the nodes in the network detect
the link breakages on the already discovered routes.

5
The study is based on two different experiments which will help us decide which
protocol is better suited considering the requirements of the project. The two
experiments are stated as follows -
1. Number of nodes change ( keeping other parameters fixed )

This experiment will help in deciding which protocol would be better suited in
different case involving varying node density which in practical situations can arise
due to shortage of nodes available for deployment as well as in the off chance of
some nodes not working as time passes after the deployment.

2. Mobility of nodes change ( changing the pause time of mobile nodes )

Considering the use case of the project, the network deployed will be majorly static
with all the nodes being at their initial position. This test will give us an insight as to
which protocol will be the most robust if the nodes were displaced for their initial
position, though the displacement will not be continuous, the mobile node will
become static again and the system will become static again but in the spirit of
robustness this testing has also been performed.
The performance will be rated based on 4 parameters, namely -

Packet Delivery Ratio - Number of packets successfully receieved to the total

number of packets sent. This parameter will highlight the success rate of the
communication being carried out within the network.

Throughput- Number of successful transmissions per unit time. In otherwords this is

the effective bandwidth of the communication channel. This parameter will highlight
how well the traffic is being handled by the routing protocol and how efficient it is
with handling packets as well as routing them.

End to End Delay - Time taken by the packet to reach from source to
destination.
This parameter depends on the throughput as well, this will highlight high
buffer
times in the nodes if the throughput is not good.
Normalized Routing Load - Number of routing packets required for each data
packet
to be communicated successfully. This parameter directly effects throughput
which in
will effect Packet Delivery Ratio and End to End Delay.

The various protocols are divided into 3 categories -

On-Demand or Reactive Protocols - These are highly dynamic in nature and
construct routes on demand when communication is to take place. These type
of protocols are more suited to networks involving frequent topological
 changes, like in the case of a node switching of due to fault or slight mobility
being induced in the network due to environmental factors (considering the
network is suppose to be static), they are the go to choice for MANETS.
Table Driven or Proactive Protocols - These protocols as the name suggests
pro-actively make routing paths ready regardless of a transmission instance or
not. This is done using routing tables. These protocols belong to the category
of planning the route even before the communication request is received. This
enables this category of protocols to be faster in static networks, for Ad-HOC
networks static in nature, table driven proactive protocols are of choice.
Hybrid protocols - These are a blend of the above mentioned protocols. These
combine both the advantages of the table driven and reactive protocols, these
are relatively more complex as a result hence not a part of this study.

Destination Sequence Distance Vector (DSDV) - Each node in DSDV maintains a

routing table for the packets to be transmitted and also for the purpose of
maintenance of connectivity with different stations in the network. The table consists
of all the routes for various destinations. Each node also maintains consistency by
updating the routing table.

The destination sequenced distance vector (DSDV),a node-by-hop vector routing

protocol, that is needed to sporadically broadcast routing updates to every node. it's a
table-driven formula supported modifications created to the Bellman-Ford routing
mechanism. every node within the network maintains a routing table containing
entries {for every|for every} destination of the network and therefore the variety of
hops needed to succeed in each of them. A sequence variety is related to every entry
that helps establish stale entries. This mechanism permits the protocol to avoid the
formation of routing loops. every node sporadically sends labelled updates to the
network that incrementally serial variety to advertise its location. The new route
broadcast contains the address of the destination, the number of hops to succeed in
the destination, the sequence variety of data received concerning the destination,
furthermore as a replacement sequence variety for the published. The routeing
variety labelled with the foremost recent sequence is usually used. once broadcast
node's neighbours receive this update, they acknowledge that they're one hop far
from the supply node and embrace this data in their distance vectors. every node
stores a "next routing hop" for every approachable destination in its routing table. the
basis used is that the one with the best sequence variety i.e. the foremost recent.

When a neighbour B of A finds out that A isn't any longer accessible, it advertises
the route to A with AN infinite metric and a sequence favourite larger than the most
recent sequence range for the route forcing any nodes with B on the trail to A, to
reset their routing tables.

The routing table is updated in two ways, both of these ways involve varying levels
of traffic in the network.

Full Dump - This method is resorted to less frequently as it requires more number of
Network protocol data units, this is used when the update is big in size and all the
routing information is to be forwarded.

Incremental - This method is much more efficient as fas as the load on the network is
concerned, this broadcasts only that metric which has changed since the full dump
update.

Different Columns in the routing table -

The most important field determining performance in a major way is the sequence
number, the larger the sequence number the better and more tested the route will be,
this helps in avoiding stale routes which lead to degradation in performance. An even
sequence number symbolizes that the node is correctly working whereas an odd one
means malfunctioning node and the number of hops are subsequently set to infinity.

Ad-HOC on Demand Distance Vector routing - This protocol builds routes as and
when required by the network, control packets are used for the discovery and freeing
of routes.

AODV being a reactive protocol will find the route to the destination node when the
need arises. It will broadcast a route request packet in the wireless sensor network,
with the destination I.D of the desired destination node. This happens under the route
discovery process. If a node receives two of the same RREPs then the redundant
packet is pushed off the network this way unnecessary traffic is reduced in the
wireless sensor network.
After the route has been discovered by the matching of the destination I.D and the
node, the destination node unicasts the route reply packet back to the source node
and all the intermediate nodes store the immediate addresses of their respective
neighbours. Now the data packet is sent to the destination node on a hop by hop
basis..

6
Route Request ( RREQ ) : This packet is broadcasted throughout the network in
order to discover new routes, such a packet is discarded by a node if a similar one has
already been received by it, this reduces congestion and confusion within the
network. These packets have a TTL – time to live field, which is reduced by 1 after
each hop, if TTL becomes 0, the particular RREQ packet is dislodged form the
wireless sensor network, this way over population of RREQ packets is countered in
AODV.

A route reply packet (RREP) is unicasted to the source if a node has route with
sequence number greater than or equal to the sequence number of the route request
packet.

Hello messages ; These are broadcasted by active node to check the functionality of
the neighboring links as well as update the tables incase some node mal functions.

RERR - Nodes monitor the link standing of next hops in active routes. once a link
breakage in a lively route is detected, a RERR message is employed to send word
different nodes of the loss of the link. so as to modify this coverage mechanism,
every node keeps a ``precursor list'', containing the IP address {for every|for every}
its neighbours that area unit doubtless to use it as the next hop towards each
destination.

Diagramatic representation of AODV

Illustrates AN AODV route search session. Node A desires to initiate traffic to
node J that it's no route. A broadcasts a RREQ that is flooded to all or any
nodes within the network. once this request is forwarded to J from H, J
generates a RREP. This RREP is then unicasted back to A exploitation the
cached entries in nodes H, G and D.

Dynamic Source Routing – The only difference this has with AODV is that the
source node supplies the whole route to be taken by the packet in order to reach the
destination node, this increases the packet overhead and is heavily dependent on
making prior changes to the address which reduces the reactiveness of this protocol
as compared to AODV which is based on independent-hopping.

DSR is a reactive protocol for wireless sensor networks. This protocol decides the
route to a destination once the request on need is felt . Route Discovery phase is the
first process it runs, where it gets the route to the destination node, this route is
copied into the header of the data packet which is to be routed to the destination
node. Then comes the route maintenance process which keeps the stale routes off the
network and in turn keeps the throughput and Packet Delivery Ratio high..
DSR route discovery - Diagramatic representation.

Simulations
The following simulations are carried out in NS2 and the trace files generated are
passed as arguments to the GNUplot using which are graphs are made.
Scenario 1: Different Node Density

The parameters used in the simulation are mentioned above, only the number of
nodes is kept variable.

Packet Delivery Fraction -

Here DSR performs way better than the other two protocols when the number of
nodes are relatively less, as it caches the routes before sending the packet and that
works better incase the network size is less but as the network size increases, caching
the addresses becomes difficult in DSR and DSDV starts to perform better than the
other two, AODV also drops packets when the network size increases due to the
route discovery phase taking place in larger networks being chaotic.

End to End Delay-

DSDV performs the best in this case as it pro-actively finds the route and updates the
routing table in every node. AODV and DSR have to go through a route discovery
phase first before being able to transmit. As the network size increases DSR performs
worse than AODV as it is more aggressive in caching destination address at the
source node itself.
Normalized Routing load-

DSDV here also performs better than the other two as it needs to send less routing
packets for route discovery given it uses a pro-active approach to find routes. AODV
and DSR being reactive in nature need to use a lot of routing packets to finalize the
route for transmission to take place.
9

Data Packet Loss-

At smaller number of nodes all three protocols perform fairly similar but in a large
network DSDV performs better as it rules out stale routes based on sequence number
of the routes.

Scenario 2 : Different Pause time of mobile nodes

All the three protocols are tested based on varying pause time of mobile nodes. Rest of the
parameters are kept fixed in this testing.

10
Throughput

DSR’s aggressive caching provides benefit upto a certain extent only, AODV and
DSDV perform similarly but here the better one is AODV as it is much more
dynamic compared to DSDV and is able to counter mobility better, DSDV’s pro-
active approach is a bit rigid when it comes to better mobility of nodes in the
network.
End to End Delay-
Delay encountered in DSDV is less again because of no route discovery phase, DSR
suffers heavily as it is not based on independent hops as AODV.
Normalized Routing Load

As DSDV updates the routing tables pro-actively the number of routing packets sent
are high when the pause time is small ,whereas in AODV it is the small as it is the
most dynamic. As the pause time of the mobile node increases the performance of
DSDV becomes better

Data Packet Loss

Data packet loss is the most is DSR as it’s address header is not as flexible when
mobility is involved in the network, AODV and DSDV perform similarly but here
AODV is better as it handles mobility better than DSDV because of it’s independent
routing for every subsequent hop.
Conclusion – Taking into consideration the above graphs and performance
parameters, AODV and DSDV will be the best suited protocol for the project. Since
project spefic changes will also be made to the working of the protocol, the
parameters affecting the packet delivery ratio, throughput and end to end delay will
be optimized for the best use case.

Working Model Architecture

The choice of components in dictated by a number of factors explained as follows -

Energy-efficiency
This factor is the most important factor which will determine the life of the wireless
sensor network, in order for this network to be feasible the its life span should be
long otherwise it would require redeployment and that would be problematic, hence
battery consumption should be optimized and the protocol used should also foster
energy savings.
Low Cost
Since a lot of nodes will be deployed in the wireless sensor network, the cost per
sensor node should be justified taking into consideration its utility and the host of
sensors it possesses.
Distributed sensing
A host of sensors should be interfaced with each node, this would increase the
robustness of the node as it would detect more parameters and then fire up the
protocol, it will also reduce the false alarm rate as the decision of an alarm will be
taken after processing various readings.
Wireless
The medium of communication should be majorly wireless as the infrastructure is minimal is the wireless sensor
network. So appropriate wireless modules need to be interfaced to provide the required range.

Multi-hop
The communication channel length should be broken between a number of
intermediate nodes, this will reduce the stress on just two nodes acting as receiver
and transmitter.
Architecture of the node

Components required

Arduino nano - for the nodes as well as the gate way node.
Wireless Transciever - module for carrying out communication ( REES52 )

Temperature, Video and humidity sensor

LM - 35 is the temperature sensor

DH11 is the humidity sensor

OV7670 is the video sensor ( camera )