fault tolerant routing in mobile ad hoc networks
Post on 12-Jan-2016
Embed Size (px)
DESCRIPTIONFault Tolerant Routing in Mobile Ad hoc Networks. Yuan Xue and Klara Nahrstedt xue,firstname.lastname@example.org Computer Science Department University of Illinois at Urbana-Champaign http://cairo.cs.uiuc.edu. - PowerPoint PPT Presentation
Fault Tolerant Routing in Mobile Ad hoc NetworksYuan Xue and Klara Nahrstedtxue,email@example.comComputer 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
OutlineMotivationModel and problem formulationAlgorithm and its analysisExampleDiscussionSimulation resultsRelated work Conclusion
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.
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).
ModelNetwork Model Faulty Node Model
Problem FormulationAssumptionPerfect knowledge of faulty nodes behaviorsPacket-delivery-rate-constrained overhead-minimization problem (PCOO)
PCOO problem is NP-complete
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
E2FT Algorithm (II) route estimation raw estimationEstimation Raw estimation Iterative estimation method
Problem: different estimation accuracy a-estimationDefinition
E2FT Algorithm (III) route selectionInitially Progressive route refinement viaConfirmationConfirm a path p if DroppingDrop a path pmin if satisfies
Property analysisBounded packet delivery rate
Bounded route selection overhead
DiscussionAccommodation to node mobility Node estimation (max-min rule)
Accommodation to node behavior dynamicsSoft state long term dynamicsDynamics during estimation
Route set discoveryNeeds to integrate with route discovery protocol
Simulation SetupNetwork settings700m*700m50 nodesM faulty nodes simulation parameterMobility modelRandom waypointSpeed: 20m/sPause time simulation parameterDefault values
Result (I) packet delivery rate
Result (II) -- overhead
Result (III) node mobility
Result (IV) node mobility
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.
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
Thank you very much!