Class Note for EECS 800 at KU
Popular in Course
Popular in Department
This 20 page Class Notes was uploaded by an elite notetaker on Friday February 6, 2015. The Class Notes belongs to a course at Kansas taught by a professor in Fall. Since its upload, it has received 14 views.
Reviews for Class Note for EECS 800 at KU
Report this Material
What is Karma?
Karma is the currency of StudySoup.
Date Created: 02/06/15
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks S Marti T Giuli K Lai and M Baker Mitigating routing misbehavior in mobile ad hoc networks in The 6th ACM International Conference on Mobile Computing and Networking August 2000 Student Lecture by Ragavendra Ananthapiadmanabhan EECS 800 Survivable Networking Department of Electrical Engineering and Computer Science University of Kansas OUTLINE Introduction Ad hoc networks Routing in ad hoc networks Types of nodes in ad hoc network Misbehaving nodes and their solution Assumptions and DSR Techniques followed to mitigate the misbehavior Methodology and metrics Simulation results Conclusion and future work Satisfying R s in Survivability References Introduction Ad hoc networks Routing in ad hoc networks Maximize throughput by routing through all available nodes More participating nodes more aggregate bandwidth Shorter the routing path smaller the network partition Types of nodes in the network Overloaded lacks CPU cycles buffer space available BW Selfish unwilling to spend CPU cycles battery life Malicious drops packets Broken software fault preventing fonvarding Misbehaving nodes and their solutions Decrease in throughput if 1040 of nodes misbehave Degradation of 1632 in throughput Solutions a priori trust relationships Trust relationships built outside of the context of the network Problems can happen due to authentication Another solution is to isolate these misbehaving nodes But this adds significant complexity to the routing protocol Techniques Watchdog identifies misbehaving nodes Path rater avoids routing through these nodes Assumptions and DSR Physical layer characteristics Bidirectional links between the node s In accordance with the 80211 and MACAW Interfaces supports promiscuous mode of operation Lucent Technologies WaveLAN have this capacity DSR Dynamic Source Routing Protocol OnDem and source routing protocol Route Discovery through ROUTE REQUEST packet Route Maintenance through ROUTE ERROR packet DSR Mechanism Techniques followed to mitigate the misleehavor Watchdog implementation A can overhear B and tell whether B has forwarded the packet Buffer is maintained for recently sent packets The overheard packet is compared with the sent packet If there is a match discard the packet If the packet stays till a timeout increment the failure tally for the node If tally exceeds a threshold declare the node as misbehaving Techniques followed to mitigate the misbehavior Weaknesses for Watchdog This will not detect the misbehaving node during Ambiguous collisions Collusion Receiver collisions False misbehavior Techniques followed to mitigate the rnisloehavor Ambiguous collisions A packet collision can occur at A while listening to does not know whether B has fonNarded the packet Due to this uncertainty A should not immediately accuse B Instead watch B over a period of time and decide later Collusion Multiple nodes can collude and present sophisticated attack Problem currently studied in CMU Technogues folowed to mitigate the misbehavior Receiver collision Node cannot tell whether receives the packet If collision occurs at cannot detect the collision B can leave A none the wiser doesn t retransmit selfishness B can wait to make a collision Misbehavin g node Not an Overloaded orselfish node Techngues tolovved to mitigate the misbehavior False misbehavior Nodes falsely report other nodes as misbehaving Node can report B as misbehaving when A isthe culprit This will be detected receives ACKs from D through and wonders why it receives ACKs if B drops the packets If A drops ACKs to hide from detects this and infOrms Techniques followed to mitigate the misbehavor Path rater Combines knowledge of misbehaving nodes to pick the route Each node maintains a rating for every other node CaICulate a path metric by averaging the node ratings 39This gives a comparison of39 overall reliability of different paths Ratings Algorithm A neutral rating of 05 is assigned to a node discovered Source rates itself with 10 to ensure shortest path Increment the rating of nodes in active path by 001 every 200ms Decrement the rating by 005 in case of broken link Assign quot100quot for misbehaving node When calculating metric negative value indicates misbehaving path Increase the negative rating to nonnegative value after long timeout Methodology and metrics NS 2 simulator 670 x 670 m 50 wireless nodes Movement patterns include random wraypoint model Communication pattern includes CBR flow 10 to 40 misbehaving nodes were included Metrics Throughput Overhead due to RREQ RREP RERR Watchdog false positives Simuaton results WD PR SRR everything on and everything off Network Throughput O and 60 sec pause time Same at 0 misbehaving nodes and diverges later Throughput increase of 27 in both scenarios Interdependency between WD and PR PD cannot function with no WD If either WDPD are off then it becomes a normal network Simulation results E s E 5 E E i 5 E 39Mlm FIREm S a a MZLCN m um 1 f n 392 Fllclu39 1 lithium ruin 0 sec pause time rhmxmmrmamranzku math1quot ma a I39liL39JN a aiia a MilCM WiGN SRiDF l n FFI EN ERiL JFF I I JJFVr aFF aIF u 12 3 4 Fll ll39 l nhh mv mm 60 sec pause time I15 Simuaton results Routing Overhead again everything on and off Graph WD only curve to study the overhead due to notifications Greatest effect only when SRR is on Overhead increase of 12 when SRR is actiVated on PR WD incurs very small overhead This behavior is not affected even by adding misbehaving nodes Overhead generally corresponds to battery usage in PDAs But net increase of throughput helps the network Simulation results main Fit cm 353 men mn R t DFF I ticu ms Jaw1 man amm5m3F a ma Inanu mean man manquot ERiQFF mgnmmu 39m amdzrasaam n E9 II39E Fund 11 39J harm min 0 sec pause time C 395 Flicl u lquot rfh l39mg min 60 sec pause time Related Work Work proposed only for DSDV till now Zhou and Haas on Cryptographic measures Stajano and Anderson on DDOS by nodes Conclusion and Future work Satisfying two R s in survivability requirement Resistance to attack Recovery from attack Effective increase in net throughput by 27 Done with no a priori trust relationships Working on different thresholds of WD Make PR to work with ACKs from upper layer TCP and FTP flows along with CBR flows References 1 S Marti T Giuli K Lai and M Baker Mitigating routing misbehavior in mobile ad hoc networks in The 6th ACM International Conference on Mobile Computing and Networking August 2000 2 D Johnson D A Maltz and J Broch The Dynamic Source outing Protocol for Mobile Ad Hoc Networks InternetDraft Mobile Adhoc Network MANET Working Group IETF October 1999