Virus Attack Identification And Representation In Sensor Network

Chintha Venkata Ramana, B.P.N Madhu Kumar

Abstract


Clusters consist of circulated sensors and motor that interact with each other via wireless network. The use of open wireless intermediate and unattended deployment  leaves these systems vulnerable  to intelligent adversary whose goal is to disrupt the system performance. Here we study the virus attack on a networked control system, in which an opponent establishes a link between two physically different areas of the network by using either high-gain antennas, as in the out of band, or colluding network nodes as in the in-band virus. Virus allow the adversary to violate the timing constraints of real-time control systems by first creating low latency links, which attack network traffic, and then delaying or dropping packets.

The requester and responder in between the data sending through a transport channel then data can be destroyed or modified, so to avoid those problems we are proposing a new system by using NS2 features. Our approach is based on the analysis of the two-hop neighbours forwarding Route Reply packet. To check the validity of the sender, a unique key between the individual sensor node and the base station is required to be generated by suitable scheme. In our proposed work detection of virus attack is done through observing the performance of the route under various metrics those are packet delivery fraction, end-to-end delay and throughput. If the route having high end-to-end delay and low packet delivery fraction and low throughput that route must contains a virus nodes. So we can avoid those routes in the routing.


Keywords


Wireless Sensor Network, Sensor Nodes, Base Station, Virus

References


DemaAldhobaiban , Khaled Elleithy and LaialiAlmazaydeh “Prevention of Virus Attacks in Wireless Sensor Networks†978-1-4799-7600-3/14 $31.00 © 2014 IEEEDOI 10.1109/AIMS.2014.57.

Y. C. Hu, A. Perrig and D.B. Johnson, “Packet Leashes: A Defenseagainst Virus Attacks in Wireless Networks,†Wireless andMobile Communications. ICWMC’08, pp.13-18, 2008.

M. Taheri, M. Naderi and M.Barekatain , "New Approach for Detection and defending the Virus Attacks in Wireless Ad HocNetworks," Proc. of IEEE International Conference on Communications, Vol. 10, pp. 3201–3205, June 2001.

P.V. Tran , L. X. Hung ,Y.K. Lee, S. Y. Lee and H. Lee, "TTM: An Efficient Mechanism to Detect Virus Attacks in Wireless Ad-hoc Networks ," 4th IEEE conference on Consumer Communications and Networking Conference, pp. 593-598, 2007.

A. Singh, K. S. Vaisla “A Mechanism for detecting Virus Attacks on Wireless Ad Hoc Network,†International Journal of Computer and Network Security, Vol. 2, no. 9, pp. 27-31, September 2010.

L. Hu and D. Evans, “Using Directional Antennas to Prevent Virus Attacks,†Network and Distributed System Security Symposium (NDSS), February2004.

I. Khalil, S. Bagchi and N. Shroff, “LITEWORP: A Light weight Counter measure for the Virus Attack in Multi hop Wireless Network , “International Conference on Dependable Systems and

Networks(DSN), pp.1-22, 2005.

I .Khalil, S. Bagchi and N. Shroff , †MOBIWORP: Mitigation of the Virus Attack in Mobile Multihop Wireless Networks,†international Conference on Depend able Systems and Networks(DSN), pp. 1-12, 2006.

H. Chen, W. Lou, Z. Wang, “SLAW: Secure Localization against Virus Attacks Using Conflicting Sets,†Technical Report, The Hong Kong Poly technic University, pp.111, 2010.

KritiPatidar and Vandana Dubey “Modification in Routing Mechanism of AODV for Defending Blackhole and Virus Attacks†978-1-4799-3064-7/14/$31. 00©20 14 IEEE


Full Text: PDF [FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â