1 / 11

MobileMan Meeting

MobileMan Meeting. March 6th/7th 2003 Institut Eurecom. Outline. Analysis and validation of cooperation enforcement mechanisms. Common game theoretical (GT) model. Implementation and simulation study of CORE. New ideas for Secure Routing. Game theoretical models for cooperation.

perryc
Download Presentation

MobileMan Meeting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MobileMan Meeting March 6th/7th 2003 Institut Eurecom

  2. Outline Analysis and validation of cooperation enforcement mechanisms. Common game theoretical (GT) model. • Implementation and simulation study of CORE. • New ideas for Secure Routing.

  3. Game theoretical models for cooperation • Which approach should we take in MobileMan? Specific GT Model Mechanism Validation/Analysis Feedback Generic GT Model Guidelines to Design Mechanism Validation/Analysis Feedback ?

  4. Lessons learned from WiOpt’03 • Jon & Sven’s approach • Suppose we have a mechanism that works. • Study performances based on a very accurate model. • Capacity, interference… • Alessandro & Silvia’s approach • Provide a generic GT model. • Energy classes, strategy ≡ fraction of forwarded packets • Analyze existing mechanisms.

  5. Joint “Cooperation Model”? • Joint vision of GT models of cooperation enforcement mechanisms for MobileMan. • CORE as the cooperation enforcement mechanism? • Develop a GT model combining features of three approaches.

  6. CORE: implementation • QualNet Network Simulator. • 2 Final year students: • Implementation of a new node model for 3 types of selfishness. • Black hole attacker, Systematic reject RREQ, Energy Based Model. • Implementation of Watchdog Mechanism. • Buffered information: hash of the message, UID of the message. • Time out for the WD mechanism. • Neighbor discovery mechanism. • DSR broadcasts a RREQ with TTL=1 : quickly discovers neighbors. • We need something different.

  7. CORE: implementation (2) • Implementation of reputation mechanism to enforce participation to Routing (DIFFICULT). • How to avoid false detections due DSR loop avoidance mech.? • Implementation of reputation mechanism to enforce participation to Packet Forwarding. • Problem: are we going to set a WD per packet? • TODO: implementation of the complete reputation mechanism  functional reputation concept (derived from simulation-based analysis of exposures in MANET)

  8. CORE: implementation (3) • Keep things as simple as possible. • Sampling frequency of WD mech. as low as possible. • Energy is precious, don’t want to waste it to observe and punish. • Trade-off: accurate & fast detection vs. complexity of mechanism.

  9. CORE: simulations • Highlight features of cooperation enforcement mechanism. • Detection & punishment speed. • Compare performance metrics: selfish nodes, with/without cooperation enforcement. • Energy consumption: selfish nodes, with/without cooperation enforcement. • Modify DSR for multiple routes?

  10. Secure Routing • Solutions proposed in literature NOT practical. • Ideas: • Minimize needs of bootstrap phase. • Avoid (if possible) to use centralized administration and temporary infrastructure. • Avoid time synchronization issues. • Bivariate Polynomial Key Distribution.

  11. Conclusions

More Related