sathish front page

Upload: kavitha-ravikumar

Post on 02-Jun-2018

215 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/10/2019 Sathish Front Page

    1/8

    PROVIDING NETWORK SECURITY BY PREVENTING

    SELECTIVE JAMMING ATTACK

    Submitted by

    G. SATHISH KUMAR

    ( 11MCS1027 )

    in partial fulfillment for the award of the degree

    of

    MASTER OF ENGINEERING

    in

    COMPUTER SCIENCE AND ENGINEERING

    NOVEMBER 2012

    DEPARTMENT OF

    COMPUTER SCIENCE AND ENGINEERING

    M.KUMARASAMY COLLEGE OF ENGINEERING

    (A A!"##$#!% I%"&"!" A''&&"*+ "# A U&,*-%&"/ C*&)

    KARUR34 113

    M.KUMARASAMY COLLEGE OF ENGINEERING

    i

  • 8/10/2019 Sathish Front Page

    2/8

    (A A!"##$#!% I%"&"!")

    KARUR34 113

    Department of Computer Science and Engineering

    PROJECT WORK

    PHASE I

    PROVIDING NETWORK SECURITY BY PREVENTING

    SELECTIVE JAMMING ATTACK

    Bonafide record of work done by

    G. SATHISH KUMAR

    ( 11MCS1027 )

    Dissertation submitted in partial fulfilment for the award of the degree

    of

    MASTER OF ENGINEERING

    in

    COMPUTER SCIENCE AND ENGINEERING

    NOVEMBER 2012

    Supervisor Head of the Department

    Mrs.V.Durgadevi M.ech. Dr.!.Sudhakar M.ech."!h.D.

    #ssistant professor$CSE H%D$CSE

    C*-"&'&*+ "" "* 5+&+"* 6% *$&*+ & "* ,&,,#5* *$&" *+ # 08.11.2012

    (I"*- E$&*-) (E"*- E$&*-)

    ii

  • 8/10/2019 Sathish Front Page

    3/8

    DECLARATION

    & affirm that the pro'ect work tit(ed PROVIDING NETWORK SECURITY BY

    PREVENTING SELECTIVE JAMMING ATTACK being submitted in partia(

    fu(fi((ment for the award of M.E (COMPUTER SCIENCE AND

    ENGINEERING) is the origina( work carried out by me. &t has not formed thepart of any other pro'ect work submitted for award of any degree or dip(oma" either

    in this or any other )niversity.

    *. S#H&SH +)M#,

    - MCS/01 2

    & certify that the dec(aration made above by the candidate is true.

    Mrs.V.Durgadevi M.ech.

    #ssistant !rofessor"

    Department of CSE"

    M.+umarasamy Co((ege of Engineering"

    +arur 3 456 5.

    ACKNOWLEDGEMENTiii

  • 8/10/2019 Sathish Front Page

    4/8

  • 8/10/2019 Sathish Front Page

    5/8

    9ire(ess networks are susceptib(e to numerous security threats due to the open nature of

    the wire(ess medium. #nyone with a transceiver can eavesdrop on ongoing transmissions" in'ect

    spurious messages" or b(ock the transmission of (egitimate ones. he open nature of the wire(ess

    medium (eaves it vu(nerab(e to intentiona( interference attacks" typica((y referred to as 'amming.

    :amming can interrupt wire(ess transmission and occur by mistake in form of interference" noise

    or as co((ision at the receiver or in the circumstance of an attack. his intentiona( interference

    with wire(ess transmissions can be used as a (aunch pad for mounting Denia(7of7Service attacks

    on wire(ess networks. ypica((y" 'amming has been addressed under an e8terna( threat mode(.

    However" adversaries with interna( know(edge of protoco( specifications and network secrets can

    (aunch (ow7effort 'amming attacks that are difficu(t to detect and counter. &n se(ective 'amming

    attacks" an active 'ammerturns on and off the 'amming signa(s periodica((y or random(y" so the

    energy consumption wi(( be (ess and the identification of such a node wi(( be harder. &n the

    se(ective 'amming attacks" the adversary is active on(y for a short period of time" se(ective(y

    targeting messages of high importance. hose se(ective 'amming attacks can be (aunched by

    performing rea(7time packet c(assification at the physica( (ayer. &n this paper" mu(tip(e7path

    source routing protoco(s is proposed to a((ow a data source node to distribute the tota( traffic

    among avai(ab(e paths. :amming7aware source routing is proposed" in which the source node

    performs traffic a((ocation based on empirica( 'amming statistics at individua( nodes and f(ow

    optimi;ation prob(em using portfo(io se(ection theory. Here" in mu(ti7source networks" the

    centra(i;ed optimi;ation prob(em can be so(ved using a distributed a(gorithm based on

    decomposition in

  • 8/10/2019 Sathish Front Page

    6/8

    CHAPTER

    NO

    TITLE PAGE

    NO

    & ?

    5 E@&S&SEM A

    ? !,%B=EM DESC,&!&%< /

    E@EC)&%< % !H#SE7&& 0

    4 ,EE,E

  • 8/10/2019 Sathish Front Page

    7/8

    ,E#=&%< % # SE=EC&VE :#MM&

  • 8/10/2019 Sathish Front Page

    8/8

    HSS reuency Hopping Spread Spectrum

    M#C Medium #ccess Contro(