CRCMD&R: CLUSTER AND REPUTATION BASED COOPERATIVE MALICIOUS NODE DETECTION & REMOVAL SCHEME IN MANETS
ABSTRACT:
While mobile ad hoc networks have become amature & globally adopted technology due to its wide range ofapplications. Such environment has some basic differences incomparison to wired networks. Due to these little differences theMANETsare more prone to interception and manipulation. Thisfurther opens possibilities of insecure routing. For the efficientand secure delivery of data CRCMD&R (Cluster and Reputation based cooperative malicious node Detectionand Removal)scheme is proposed in this paper.CRCMD&R suggestsorganising the MANET into anumber of clusters and each nodein the network has a specific primenumber which acts as NodeIdentity.CRCMD&R uses Legitimacy value table andReputation level table maintained by each node in the network tofindand use a safe route between a source and a destination. Thecornerstones of our work are the various metrics which can befurther calculated by the values collected in Legitimacy valuetableand Reputation level table. Depending upon these metricsthe cluster head nodes exclude or include the nodes from thediscovered routeand select the most reliable route to a specificdestination.
EXISTING SYSTEM:
The notion of malicious node detection in MANETs hasbeen a subjectof interest for a number of years. A number ofresearchers have discussed the problems of malicious nodedetection in MANETs as follows. Saurabh Gupta et.al. proposed a AOMDV based novelapproach for black hole attack named as BAAP. BAAPintroduces the conceptof legitimacy table, which will bemaintained by each node. The good path statistics are basedon two different fields: Pathcount and Sentcount i.e. theLegitimacy Ratioof a node is calculated with the help ofpathcount & sentcount. Such count calculation gives thepictureof correct routing. RutvijH. Thaveri et. al. proposed an on-demand securerouting protocol for Gray Hole and Black Hole Attacks.It deals with the abnormal routing information provided by the
PROPOSED SYSTEM:
neighbor nodes during path setup and these abnormal nodeswill be considered as malicious nodes. The intermediate nodeuses the routing packets to pass routing and malicious nodeinformation to whole network. Subrat Kar at. e!’described a protocol WHOP. WHOPsuggests the useof hound packet to promote cooperationa nodes. Their routesel ection criteria are purely basedon node ID. That is each node must expose its ID during pathsetup. The meritof the protocol lies in the fact that it candetect hidden worm hole also. Adrian Perrig et. Al. proposed an on demand AODVlike protocol named as RAP.It uses highly efficient digitalsignature based cryptography for authentication purpose. Asimple delay timebased three step authentication neighbordetection protocolis designed to discover a legitimateneighbor. RAP at the costof higher overhead can find usableroutes, thus allowing successful routing and packet delivery.
CONCLUSION
This paper provides a secure routing protocol forpreventing the nodes from visiting through compromisednodes without any requirementof special hardware (forexample central coordinator). CRCMD&R rely on the Legitimacy value table and Reputation level table. The useof these two tables makes possibilities to analyze whether thenode is aimingfor correct routing or not. We applied twodifferent algorithms for malicious node detection and removal.As future workwe intend to include that currently dummydata packets are usedto calculate the reputation values ofnodes but it might be better if real data packets and routepackets are used to calculate the reputation value .
REFERENCES
[I] I.-P. Hubaux, T. Gross, I.-y. L. Boudec, and M. Vetterli, “Toward self organized mobile adhoc networks- the terminodes project,”iEEECommunications Magazine, vol. 39, no. 1, pp. 118- 124, Jan. 2001.
[2] G. S. Mamatha and Dr. S. C. Sharma ” Analyzing the MANETVariaitons, Challenges, Capacity and Protocol Issues”international Journal0/ Computer Science & Engineering Survey (fJCSES) , voU, no.1 , pp. 14-21 , August 2010.
[3] M. AI-Shurman, S.-M. Yoo, and S. Park, “Black hole attack in mobileadhoc networks,”in Proc. ACMSE ’04, 2004, p. 96-97.
[4] Saurabh Gupta, Subrat Kar, S Dharmaraja, “BAAP: Black hole AttackAvoidance Protocol for Wireless Network,”in Proc. iCCCT’ j j , 2011 , p.468-473 .
[5] Rutvij H. Ihaveri, Sankita J. Patel and Devesh C. linwala, ” A NovelApproach for GrayHole and BlackHole Attacks in Mobile Ad hoc Networks,”in Proc. ACCT ’12, 2012, p. 556-560.
[6] Saurabh Gupta, Subrat Kar, S Dharmaraja, “WHOP: Wormhole AttackDetection Protocol using Hound Packet,”in Proc. JJT’ll, 2011 , p. 226-231.
[7] Yih ChunHu, Adrian Perrig, DavidB. Johnson, “Rushing Attacks and Defense in WirelessAd hoc Network Routing Protocols,” in Proc. WiSe’03 , 2003, p. 30-40.
[8] Issa Khalil, Saurabh 8agchi, Ness B. Shroff, ” L1TEWORP: ALightweight Countermeasure for the Wormhole Attackin MultihopWireless Networks,”in Proc. DSN’05, 2005, p. 612-621.
[9] Radha Poovendran and Loukas Lazos, ” A graph theoretic fi’amework for preventing the wormhole attack in wireless ad hoc networks,”in A CM Journal on Wireless Networks (WINET) ,vol. 13, pp. 27 – 59, March2007.