In this , we will analyses the effects of black-hole attacks on SW-WSN. Active attack such as black-hole attack in which the node shows that it has the best smallest path tp desired node in the given Networks even if it lacks it,hence all the data packets follows that fake path through it hence make black-hole node to forward or drop the packet during the data transmission.

1. ANALYSIS AND REACTIVE
MEASURES ON THE BLACKHOLE
ATTACK IN SMALL WORLD
WIRELESS SENSOR NETWORKS
Guide:
Dr. Sourabh Bharti
Assistant Professor
Presented By :
Jyoti Verma
00502052018
Major Project Presentation
JUNE 2020
IGDTUW

2. OUTLINE
• INTRODUCTION
• SW-WSN
• Problem Statement
• Black Hole Attack
• Simulator
• Routing Protocol
• AODV
• Ant colony optimization
• Flow of ACO working
• Performance Analysis on the Basis of PDR
• Throughput
• Energy consumption
• Output
• References

3. INTRODUCTION
• A WSN is a heterogeneous system consists of hundreds of low
cost and power tiny sensors to monitoring and gathering
information from deployed environment in real – time.
• Common function includes : broadcast , multicast ,routing ,
forwarding and route maintenance.
• Sensor components: Sensor unit , processing unit , memory unit
, power supply unit and wireless radio transceivers.

4. SW-WSN
Small World-WSN:
• Black dots represent sensor nodes, Conventional
links are denoted in black ,Long links (red or blue
links) are created to introduce SWC into the
network.
• SW-WSNs are developed by adding new links
between a selected fraction of nodes and the sink
and exhibits low average path length and high
average clustering coefficient and yields accurate
distance estimates between pairs of nodes.

5. SW-WSN:
• For the Watts and Strogatz’s (WS) model, 50 nodes form a network in a ring
formation.
• Each node is directly connected to other k/2 nodes in its neighborhood.
• The parameter, k, is an even number, which represents the degree of the
nodes.
• All the nodes will be randomly re-connected.
• In the WS SWN model, each edge is re-connected with a random
probability p.
• We also assume that there is only one edge between any two randomly
selected nodes in the network and no nodes in the network can be
connected to itself through its own connected edges.
• When p = 0, each node is connected to k/2 nodes in its neighborhood
directly and there is no re-connection between any two nodes. The WS SMN
model with p = 0 is a completely regular network.

6. PROBLEM STATEMENT
• Security of SW – WSN is essential to prevent the harm that could be
caused by different types of attacks. The black-hole attack is
considered to be one of the popular attacks that harm the network
and aim to prevent any connection in the network . AODV routing
protocol works to find the shortest path between any two nodes that
want to communicate in the network when the path is needed. AODV
protocol is not provided with an algorithm that helps in detecting and
preventing the black-hole attack. Here, we aim to enhance the AODV
routing protocol with a lightweight technique to detect the black-
hole attack and prevent its harm in the network.

7. BLACK HOLE ATTACK:
• A corrupted node advertises the wrong path as best path to the
source node during the path finding process.
• Thereafter source selects that wrong path guided by corrupted
node, the traffic starts passing through the malicious node and
this node(black hole node) starts dropping the packets
selectively or in whole.
• Black hole region is the entry point for a large number of
harmful attacks.

8. CONT..

9. CONT..
Single Black Hole attack:
• Corrupted node itself acts as a black hole node which hysterics into the routes between
source node and destination node.
Cooperative Black hole attack:
• Corrupted node act in a group here. Unlike single black hole attack, multiple node
absorb the packet sent for destination node from source node.

10. SIMULATOR AND PARAMETERS
• MATLAB is a multi-paradigm
numerical computing
environment and proprietary
programming language
developed by MathWorks.
• MATLAB allows matrix
manipulations, plotting of
functions and data,
implementation of algorithms,
creation of user interfaces, and
interfacing with programs
written in other languages.
Simulator MATLB 2018A
No. of Nodes 50
Topology 1000m x 1000m
Routing Protocol AODV
Packet Size 1024 Bytes
Model Random Waypoint
Maximum Speed 5 m/s
Energy 0.5j
Transmission Range 100m

11. ROUTING PROTOCOL:
• Small world – wireless sensor network is the
network based on concept of six degree
separation.
• Sociologists have said that any given two
persons, no matter how far away they are, can
usually be related within six steps (and thus the
term six degrees of separation).
• The key lies in the use of weak links, with which
people can often relate themselves to ones that
are distant away.

12. AODV
• The route is created whenever the data is to
be sent.
• Source node sends the route request message
i.e. RREQ message in the whole Networks.
• Destination as well as the intermediate nodes
sends the route responds i.e. RREP message
to the source node, source node receives the
RREP message from the nodes.
• Each route reply message consists of a
sequence no. The source node selects a path
with less intermediate hopes and hence the
connection is made.
• If there occur a path failure, the intermediate

13. ANT COLONY OPTIMIZATION:
• Ant colony optimization studies artificial systems that take
inspiration from the behavior of real ant colonies and which are
used to solve discrete optimization problems.
• It is a probabilistic technique for solving computational
problems which can be reduced to finding Good paths through
graphs.
• This algorithm is a member of the ant colony algorithms family
and it constitutes metaheuristic optimization.

14. CONT..

15. CONT..

16. CONT…
Suitability of Ant Colony Optimization Routing Algorithm towards
Wireless Sensor Networks
Ant Colony Optimization Routing Algorithm mentioned above is
highly suitable and performs well in Wireless Sensor Networks
because of the following reasons:
1) Provide traffic adaptive and multipath routing.
2) Rely on both passive and active information monitoring and
gathering.

17. FLOWCHART SHOWING THE WORKING OF
BASIC ANT COLONY ROUTING PROTOCOL

18. PERFORMANCE ANALYSIS ON THE BASIS OF
PDR
• It can be measured as the ratio of the received data packets by
destination nodes to the data packets sent by the source node.
• PDR = (no. of received data packets / no. of sent data packets) * 100
• Where, Ns , Nr node sent by the sender and the no. of application
data node received by the receiver, respectively for the ith
application, and n is the no. of applications. We attained packet
delivery ratio of the proposed algorithm is more than AODV routing
algorithm with black hole attacks. Black hole stimulate packet
dropping, the original AODV decreases packet delivery ratio with hike
in no. of nodes.

19. CONT…

20. THROUGHPUT
• Throughput is no. of bytes transmitted per second.
• Throughput = received node/simulation time.
• Where, Nr= average receiving node for the ith application, Ns =
average sending node for the ith application, and n = no. of
applications.
• Through proposed algorithm improved ,good throughput
compared to AODV with black hole attacks

21. CONT…

22. ENERGY CONSUMPTION
• Initial energy allocated to every sensor node. Specify a part of nodes,
that no. of nodes will be of higher initial energy (1+a)Eo ,where Eo is
starting energy of the normal sensor nodes.
• Then we began the rounds of operation.
• Within these rounds, equations of energy dissipation is Implemented
Subtract remaining energy dissipated from starting energy of every
round of operation.
• The value get after this is the energy remaining in a sensor
node(residual energy).We basically go about subtracting the energy
used from the residual energy per round.

23. CONT…

24. OUTPUT
• Optimisation path
• Hop count
• Dead node
• Router nodes
• Packet sent
• iterations

25. OUTPUT

26. CONT…

27. REFERENCES
• S. K. Arora, S. Vijan, and G. S. Gaba, “Detection and analysis of black hole attack using IDS,” Indian Journal of Science and
Technology,vol.9,no.20,pp.1–5,2016.
• H. Kaur and K. Mangat, “Black hole attack in mobile ad hoc networks:areview,”InternationalJournalofAdvanceResearch, Ideas and
Innovations in Technology, vol. 3, no. 2, pp. 189–191, 2017.
• Yu CW, Chen RH, Wu TK, Jin FW. A small-world routing protocol for wireless sensor networks. In2008 4th International Conference on
Wireless Communications, Networking and Mobile Computing 2008 Oct 12 (pp. 1-4). IEEE.
• Yin, R., Yin, X., Cui, M., & Xu, Y. (2019). Node importance evaluation method based on multi-attribute decision-making model in wireless sensor networks.
EURASIP Journal on Wireless Communications and Networking, 2019(1), 234.
• Araujo, A., Blesa, J., Romero, E., & Villanueva, D. (2012). Security in cognitive wireless sensor networks. Challenges and open problems. EURASIP Journal on
Wireless Communications and Networking, 2012(1), 48.
• C. E. Perkins, E. M. B. Royer, and S. R. Das, Ad hoc On-Demand Distance Vector (AODV) routing, RFC3561, July 2003
• zJ. Breckling, Ed., The Analysis of Directional Time Series: Applications to Wind Speed and Direction, ser. Lecture Notes in Statistics.
Berlin, Germany: Springer, 1989, vol. 61.
• S. Zhang, C. Zhu, J. K. O. Sin, and P. K. T. Mok, “A novel ultrathin elevated channel low-temperature poly-Si TFT,” IEEE Electron Device
Lett., vol. 20, pp. 569–571, Nov. 1999.
• I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, "Wireless sensor networks: a survey", Computer networks, vol. 38, no. 4, pp.
393- 422, 2002.
• Sahay, R., Geethakumari, G., Mitra, B., & Thejas, V. (2018, December). Exponential smoothing based approach for detection of blackhole
attacks in IoT. In 2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) (pp. 1-6). IEEE

28. Thank You