distributed detectection of alicious nodes in wirless sensor networks

Transcription

distributed detectection of alicious nodes in wirless sensor networks
M. Deepa* et al. International Journal Of Pharmacy & Technology
Available Online through
www.ijptonline.com
ISSN: 0975-766X
CODEN: IJPTFI
Research Article
DISTRIBUTED DETECTECTION OF ALICIOUS NODES IN WIRLESS SENSOR
NETWORKS UNDER BYZANTINE ATTACK
*M. Deepa1, K. Santhi2, M. B. BenjulaAnbu Malar3, M. Lawanya Shri4
School of Information Technology, VIT University, Tamilnadu, India.
Email: mdeepa@vit. ac. in
Received on 19-05-2016
Accepted on 25-06-2016
1, 2, 3, 4
Abstract
In wireless sensor network the mobility of the sensor nodes are the basis of information gathering and passing of
information and this wireless architecture has its own advantage and disadvantage.Wireless nodes can be easily laid
architecture but at the same time its vulnerable to various attacks.the mobile nodes of the wireless networks are easily
attacked by attaker and its vulnerable to changes and thus cause wrong information passing and it makes final decision
made by the fusion center very much wronger and that shud be avoided completly.so we use adaption fusion technique
which uses q out of m rule.
Introduction
The mobile nodes under wireless sesor networks are vulnerable to various attacks.the nodes which are suppose to help the
fusion center to make the right decision is been compromised under attacks. Any authorised node under attack is
compromised to pass wrong information to other sensor nodes.hence each node in the wirelss sensor network should be
under scan and the honestness of each of the node should be checked and we have to decide whether a particular node can
be relied upon for decision making.hence adaptive fusion method collects report of each and every node and checks how
many times the node has passed wrong information and that particular node is determined and removed from the network
using q out of m rule.
Scope of the Paper:
We use adaptive fusion method of q out of m rule.upon larger wirless network any n number of nodes under wireless
network is monitored.upon n number of nodes m number of nodes are taken under scan for monitor among those m
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13546
M. Deepa* et al. International Journal Of Pharmacy & Technology
number of nodes we see any node is under control of hacker or attacker we see the message passed by each node to the
another node how many times the wrong information has conveyed and that particular is been removed from the network.
Existing System
The existing system scans the whole network and result collector was used to monitor the whole network and scan the
nodes for truthfulness.the message a node gets and the message a node passes to the other nodes both are collected in
result collector amd sees how many times a particular node has changed the message and
passed the wrong
message.That particular node is identified and removed.
Proposed System
Existing system works better when its smaller networks.but for lager networks that wont work hence we use adaptive
fusion method and which uses q out of m rule this method works good and effectively when its for larger networks it
considers n number of nodes in the network from those nodes it considers m number of nodes from m number of nodes it
detects the q node that is the malicious node and removes that node from the network.
Literature Survey
Title
: Mobile Nodes in Sensor Wireless Network
Author
: Lang Tong, Qing Zhao, and SrihariAdireddy
Year
: Feb. 2013.
Description
The mobile nodes in the wirelesssensor networks have very poor battery.the nodes are very cheap so as their power to
withstand large nwtworks hence this architecture in sensor nodes with mbile agents deals with the large networks with
primitive mobile nodes which are expensive are laid in the network.and the costlier mobile nodes have high power hence
the cheaper and lower power holding nodes are given lower functionality and the few highly costed nodes are given more
functionality to fullfill the task given to wirelss sensor network.
Title
: Mitigating Byzantine Attacks in Ad HocWireless Networks
Author : BaruchAwerbuch,RezaCurtmola,DavidHolmer ,Cristina Nita-Rotaru.
Year
: Mar 2011.
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13547
M. Deepa* et al. International Journal Of Pharmacy & Technology
Description
Most attacks caused in the wireless sensor networks is because of the compromised nodes under byzantine attacks which
cause compromised nodes to pass wrong information which causes the decision making harder for the fusion center.we
consider various loopholes in the wireless sensor network which may cause attacker to easily compromise the
authenticatednodes to compromise the nodes like (blackhole,worm,etc.). Hence we consider a solution by using on
demand routing protocol which reduces the attaker on compromising the nodes and make them pass worng information
passing these problems, and it is shown that lower rates can be achieved with randomized coding.
Modules
 User Interface
 Malicious Node Detection Scheme
 Data fusion System
 Distributed System
 Attacker identifier
Module Description
User Interface Design:
To connect with server user must give their username and password then only they can able to connect the server. If the
user already exits directly can login into the server else user must register their details such as username, password and
Email id, into the server. Server will create the account for the entire user to maintain upload and download rate. Name
will be set as user id. . Logging in is usually used to enter a specific page.
Malicious Node Detection Scheme:
The sensor network that communicate only radio communication signal.The communication
between sensor will be
cover only certain feet only. Sensor communicate with another sensor with 0 and 1. The detection malicious node
Scheme is to pinpoint the attacker and remover.
Data fusion technique
By using this technique, data get combine from previous network and pass the data to the another node .if the data passed
only 0&1.if no attacker came then intimate 0 otherwise it will be 1.
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13548
M. Deepa* et al. International Journal Of Pharmacy & Technology
Distributed System
In this distributed system we used a algorithm are q out of m scheme By using the scheme it never said false report to the
user. And also represent the accurate the current position of the attackers.
Attacker identifier
In this module the attacker can be detected by with the help of of adaptive fusion technique method and identifier the
attacker and remove them. After that result will be store as a one in server.
Snapshots
Node Registration:
Attacker Login
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13549
M. Deepa* et al. International Journal Of Pharmacy & Technology
Network Node
Sender Node
Node Creation
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13550
M. Deepa* et al. International Journal Of Pharmacy & Technology
Data Base Table Structure
Software Testing
Application
This project may help in various wireless sensor networks like military where the attaker finds numerous ways to
compromise nodes and start passing wrong information hence detecting and removing the malicious nodes using adaptive
fusion method will be very beneficial and really important in military.
Future Enhancement
We can furthermore enhance the functionality by restricting more on byzantine attacks rather than detecting and removing
later.we will restrict the entry of byzantine attack and we can further more implement using more restrictions on routing
the messages.
References
1.
Y.-C. Wang and Y.-C. Tseng, “Distributed deployment schemes for mobile wireless sensor networks to ensure
multilevel coverage,”IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 9, pp. 1280 –1294, Sept.
2008.
2.
P. Barooah, H. Chenji, R. Stoleru, and T. Kalmar-Nagy, “Cut detection in wireless sensor networks,” IEEE
Transactions on Paralleland Distributed Systems, vol. 23, no. 3, pp. 483 –490, Mar. 2012.
3.
A. Bharathidasas and V. Anand, “Sensor networks: An overview,” Technical report, Dept. of Computer Science,
University of Californiaat Davis, 2002.
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13551
4.
M. Deepa* et al. International Journal Of Pharmacy & Technology
C. Chong and S. Kumar, “Sensor networks: evolution, opportunities, and challenges,” Proceedings of the IEEE, vol.
91, no. 8, pp.1247 –2056, Aug. 2003.
5.
A. Perrig, R. Szewczyk, J. D. Tygar, V. Wen, and D. E. Culler, “Spins: security protocols for sensor networks,”
WirelessNetworks, vol. 8, pp. 521–534, Sept. 2002. [Online]. Available:
http://dx.doi.org/10.1023/A:1016598314198
6.
C. Karlof, N. Sastry, and D. Wagner, “Tinysec: a link layer security architecture for wireless sensor
networks,”Proceedings of the 2nd international conference on Embedded networked sensor systems, pp. 162–175,
2004. [Online]. Available: http://doi.acm.org/10.1145/1031495.1031515
7.
L. Lightfoot, J. Ren, and T. Li, “An energy efficient link-layer security protocol for wireless sensor networks,” IEEE
InternationalConference on Electro/Information Technology, EIT 2007, pp. 233 –238, May 2007.
Corresponding Author:
M. Deepa*,
Email: mdeepa@vit. ac. in
IJPT| June-2016 | Vol. 8 | Issue No.2 | 13546-13552
Page 13552