Securing the wireless network from jamming Attacks using anonymity

Authors

  • T. K. P. Rajagopal  Department of Computer Science and Engineering, Kathir College of Engineering, Coimbatore, Tamil Nadu, India
  • Balaji R  Department of Computer Science and Engineering, Kathir College of Engineering, Coimbatore, Tamil Nadu, India
  • Ravikumar K  Department of Computer Science and Engineering, Kathir College of Engineering, Coimbatore, Tamil Nadu, India
  • Ranjith N. L  Department of Computer Science and Engineering, Kathir College of Engineering, Coimbatore, Tamil Nadu, India

Keywords:

IMPROVED IDENTITY ATTACKS, IDAS, XML, DIDAS, RePIDAS, LP

Abstract

Multiple-path source routing protocols allow a data source node todistribute traffic to available paths. We consider the problem ofproblem-free source routing, in which the source node carries out atraffic allocation based on empirical statistics on individual networknodes. This reduces the efficiency of the blocking attack. In thetraditional system, a reactive jammer blocks wireless channels onlywhen sending targets; compared to constant interfering, reactivejamming is more difficult to track and compensate. The transmission ofmessages by the use of the reaction time of a reactive jammingtransmitter. It does not accept a reactive jammer with limited rangeand transmission power and can therefore be used in scenarios wheretraditional approaches fail. In this paper, we are investigating theability of network nodes to characterize the congestion and ability ofmultiple source nodes to compensate for blocking in the allocation oftraffic over multiple routing paths. We formulate the problem ofallocating traffic across multiple routing paths in the presence ofjamming as a loss-rich network flow optimization problem. We model theproblem as a Bayesian game for a single time slot attack and reduce itto solving linear programming problems (LP). We show that inmultisource networks, this central optimization problem can be solvedwith an anti-jamming technique. Finally, we simulate the achievablethroughput using our proposed traffic allocation method in severalscenarios. We formulate the central traffic distribution problem forseveral source nodes as a convex optimization problem. We show thatthe multisource multipath optimal traffic allocation at the sourcenodes can be calculated using an anti-jamming technique.

References

  1. Anat Bremler-Barr, David Hay, Yaron Koral (2010),"CompactDFA: Generic State Machine Compression for Scalable Pattern Matching". IEEE INFOCOM Computer Architecture Lett., vol. 7, pp. 33–36.
  2. Aruna Jamdagni, Zhiyuan Tan, Xiangjian He, Priyadarsi Nanda , Ren Ping Liu (October 2012), "RePIDAS: A multitier Real-time Payload-based IDENTITY ATTACKS Detection System",Centre for Innovation in IT Services and Applications (iNEXT), University of Technology, Sydney, Australia. http://dx.doi.org/10.1016/j.comnet.2012.10.002, Vol. 2, Issue 2, pp.25-39
  3. Christopher R. Clark and David E. Schimmel (2003) "Efficient Reconfigurable Logic Circuits for Matching Complex Network IDENTITY ATTACKS Detection Patterns". In Proceedings of International Conference on Field-Programmable Logic and Applications (FPL), Lisbon, Portugal. Vol. 2778, pp 956-959.
  4. Cong Liu and Jie Wu (2011),"Fast Deep Packet Inspection with a Dual Finite Automata", IEEE Transactions on Computers.
  5. Fang Yu, Zhifeng Chen, Yanlei Diao, Lakshman T.V and Randy H. Katz (2006) "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection", San Jose, California, USA, pp 1-10.
  6. Hopcroft J. E.  and Ullman J. D. (1979) "Introduction to Automata Theory". Addison Wesley.
  7. Kedar  Namjoshi  and   Girija Narlikar (2010) ,"Robust and Fast Pattern Matching for IDENTITY ATTACKS Detection". In Proc. of IEEE, Vol.3, pp 740-748.
  8. Lin Tan and Timothy Sherwood (2005),"A High Throughput String Matching Architecture for IDENTITY ATTACKS Detection and Prevention". In Proc. of ISCA, Vol. 18, pp. 93-102.
  9. Martin Roesch (1999),"Snort: Lightweight IDENTITY ATTACKS Detection for Networks", In   Proceedings of LISA '99: 13th Systems Administration Conference Seattle, Washington, USA, November 7–12. Snort: http://www.Snort.org/.
  10. Masanori Bando, N.Sertac Artan, and H.Jonathan Chao (June 2012), "Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection", IEEE/ACM Transactions On Networking, Vol. 20, No. 3, pp. 699 - 714.
  11. Mehmet Altinel and Michael J. Franklin (2000),"Efficient Filtering of XML Documents for Selective Dissemination of Information". In Proc. of VLDB Conference.vol.8, pp.53-64.
  12. Michela Becchi and Patrick Crowley (2007),"A Hybrid Finite Automaton for Practical Deep Packet Inspection". In Proc. of CONEXT, MO 63130-4899+1-314-935-4306.
  13. Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese (2004),"Deterministic Memory-Efficient String Matching Algorithms for IDENTITY ATTACKS Detection". In Proc. of IEEE INFOCOM, Vol. 33, pp.333-343.
  14. Rafael Antonello, Stenio Fernandes, Carlos Kamienski, Djamel Sadok and Judith Kelner (November 2012), "Deep packet inspection tools and techniques in commodity platforms: Challenges and trends" , Journal of Network and Computer Applications, Vol. 35, No. 6, pp. 1863-1878.
  15. Randy Smith, Cristian Estan, Somesh Jha, Shijin Kong (2008),"Deflating the big bang: fast and scalable deep packet Inspection with extended finite automata" August 17–22, Seattle, Washington, USA.  LNCS 5352, pp. 158–172.
  16. Reetinder Sindhu and Viktor K.Prasanna (2001),"Fast Regular Expression Matching Using FPGAs". Contract no.DABT63-99-1-0004, In Proc. of FCCM, Volume 22, pp. 66–74.
  17. Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, Jonathan Turner (2006),"Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection". In Proc. of ACM SIGCOMM,        pp-339-350.
  18. Salvatore Pontarelli, Giuseppe Bianchi, Simone Teofili(May 2012), "Traffic-aware Design of a High Speed FPGA Network IDENTITY ATTACKS Detection System",   Consorzio Nazionale InterUniversitario per le Telecomunicazioni (CNIT) University of Rome "Tor Vergata" Via del Politecnico 1, 00133, Rome, ITALY,Vol-pp,Issue-99,pp.-13.
  19. SangKyun Yun, Member, IEEE Computer Society(February 2012), "An Efficient TCAM-Based Implementation of Multipattern Matching Using Covered State Encoding", IEEE Transactions On Computers, Vol. 61, No. 2, pp.213-221.
  20. Shijin Kong, Randy Smith, Cristian Estan (2008),"Efficient Signature Matching With Multiple Alphabet Compression Tables". In Proc. of Secure communication,Vol. 6307,pp.58-78.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-04-30

Issue

Volume 2, Issue 2, March-April-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
T. K. P. Rajagopal, Balaji R, Ravikumar K, Ranjith N. L, " Securing the wireless network from jamming Attacks using anonymity, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 2, pp.643-648, March-April-2017.