Fault Tolerant Routing in Mobile Ad hoc Networks

Download Fault Tolerant Routing in Mobile Ad hoc Networks

Post on 12-Jan-2016

31 views

Category:

Documents

7 download

DESCRIPTION

Fault Tolerant Routing in Mobile Ad hoc Networks. Yuan Xue and Klara Nahrstedt xue,klara@cs.uiuc.edu Computer Science Department University of Illinois at Urbana-Champaign http://cairo.cs.uiuc.edu. - PowerPoint PPT Presentation

TRANSCRIPT

<ul><li><p>Fault Tolerant Routing in Mobile Ad hoc NetworksYuan Xue and Klara Nahrstedtxue,klara@cs.uiuc.eduComputer Science DepartmentUniversity of Illinois at Urbana-Champaignhttp://cairo.cs.uiuc.eduThis research was supported by the ONR MURI NAVY CU 37515-6281 grant, and the NSF EIA 99-72884EQ grant. Any opinions, findings, and conclusions are those of the authors and do not necessarily reflect the views of the above agencies</p></li><li><p>OutlineMotivationModel and problem formulationAlgorithm and its analysisExampleDiscussionSimulation resultsRelated work Conclusion</p></li><li><p>MotivationMost existing routing protocols need mobile nodes to cooperate with each other.If there exist non-cooperative nodes or faulty nodes, then the performance of the current routing protocols will degrade.</p></li><li><p>Our approach tolerating faulty nodesObservation: Ad hoc networks are highly redundant there exist multiple paths between source and destination.Approach:Exploring the network redundancy through multipath routing.Challenge:Trade off between effectiveness (packet delivery rate) and efficiency (packet overhead).</p></li><li><p>ModelNetwork Model Faulty Node Model </p></li><li><p>Problem FormulationAssumptionPerfect knowledge of faulty nodes behaviorsPacket-delivery-rate-constrained overhead-minimization problem (PCOO)</p><p>PCOO problem is NP-complete</p></li><li><p>E2FT Algorithm (I)Challenges revisitNo precise knowledge of nodes behaviorsNP-complete complexityAlgorithm overviewRoute estimation (end-to-end estimation)Estimate Route selectionSelect so that and can be reduced</p></li><li><p>E2FT Algorithm (II) route estimation raw estimationEstimation Raw estimation Iterative estimation method</p><p>Problem: different estimation accuracy a-estimationDefinition</p><p>Property</p></li><li><p>E2FT Algorithm (III) route selectionInitially Progressive route refinement viaConfirmationConfirm a path p if DroppingDrop a path pmin if satisfies</p></li><li><p>Property analysisBounded packet delivery rate</p><p>Bounded route selection overhead</p></li><li><p>Example (I)</p></li><li><p>Example (II)</p></li><li><p>DiscussionAccommodation to node mobility Node estimation (max-min rule)</p><p>Path estimation</p><p>Accommodation to node behavior dynamicsSoft state long term dynamicsDynamics during estimation</p><p>Route set discoveryNeeds to integrate with route discovery protocol</p></li><li><p>Simulation SetupNetwork settings700m*700m50 nodesM faulty nodes simulation parameterMobility modelRandom waypointSpeed: 20m/sPause time simulation parameterDefault values</p></li><li><p>Result (I) packet delivery rate</p></li><li><p>Result (II) -- overhead</p></li><li><p>Result (III) node mobility</p></li><li><p>Result (IV) node mobility</p></li><li><p>Other ApproachesProtectionSAR (Security-Aware Routing) by S. Yi et al.Secure route discovery by Papadimitratos and HassURSA (Ubiquitous and Robust Security Architecture) by H. Luo et al.DetectionIntrusion detection by Zhang and LeeDetect misbehaving nodes by S. Marti et al.TolerationBlind multipath routing by Z. Hass et al.</p></li><li><p>ConclusionFault tolerant routing is an effective approach to address the problem of faulty/misbehaving nodes in ad hoc networksE2FT can obtain high and stable packet delivery rate and acceptable additional overhead simultaneously</p></li><li><p>Thank you very much!</p></li></ul>