1 / 26

Enforce Collaboration in Mobile Ad Hoc Network

Enforce Collaboration in Mobile Ad Hoc Network. Ning Jiang School of Computer Science University of Central Florida njiang@cs.ucf.edu. Outline. Mobile Ad Hoc Network Existing Techniques DSG Approach Conclusion. Mobile Ad Hoc Network.

ayala
Télécharger la présentation

Enforce Collaboration in Mobile Ad Hoc Network

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. Enforce Collaboration in Mobile Ad Hoc Network Ning Jiang School of Computer Science University of Central Florida njiang@cs.ucf.edu

  2. Outline • Mobile Ad Hoc Network • Existing Techniques • DSG Approach • Conclusion

  3. Mobile Ad Hoc Network • A collection of devices equipped with wireless communications and networking capability • Devices heterogeneity • Palm, laptop, mobile phone, etc. • Infrastructureless • Self-organizing and adaptive • Nodes relay data packets for each other • Energy critical

  4. Mobile Ad Hoc Network

  5. Mobile Ad Hoc Network Applications • Office • Traveling • Wireless home network • Location/context based services • Battlefield

  6. Data Communication in Mobile Ad Hoc Network • Routing • Dynamic Source Routing • Route Request • Route Reply • Packet forwarding

  7. Collaboration Enforcement in Mobile Ad Hoc Network • Nodes tend to be selfish • Nodes relay data packets for each other • Energy critical

  8. Collaboration Enforcement in Mobile Ad Hoc Networks • Two approaches • Money incentive • Misbehavior detection and penalty

  9. Packet Purse Model • Reward the packet forwarding service • The originator loads each packet with a number of “nuggets” • Each forwarding node acquires one or more nuggets • Packets with insufficient nuggets are discarded • Relies on a temper resistant security module • Cryptographic techniques are applied to prevent protocol abuse

  10. Packet Purse Model • Advantages • Secure • Nodes are motivated to collaborate • Disadvantages • Needs tamper proof security module • Cryptographic overhead • Generally, nodes have no knowledge of other selfish nodes

  11. Penalize Selfishness • Marti et al. ACM MOBICOM, 2001 • Watchdog • Each node in promiscuous mode • Each node verifies whether its downstream node forwards packets • Packet loss threshold • Inform the source node of the misbehaving node • Path Rater • Nodes select paths without selfish nodes

  12. Drawbacks of the Approach • No punishment to selfish nodes • Slow propagation of warning information

  13. CONFIDANT Protocol • Birds and Mobile Ad Hoc Network • Naïve birds • Cheating birds • Grudger birds • Interesting observation: starting with a majority of cheating birds, grudger birds finally win over • Can Mobile Ad Hoc nodes also act like grudger birds? – Yes!!

  14. CONFIDANT Protocol • Sonja et al. MOBIHOC 2002 • Monitor • Neighbor watch • Reputation System • Evaluates selfish behaviors

  15. CONFIDANT Protocol • Trust Manager • Sends alarms to “friend” nodes • A friend list • Checks the trustiness of incoming alarms • Several levels of trustness • Maintains a trust table of nodes • Path Manager • Path ranking and management

  16. CONFIDANT Protocol • Drawbacks • Scalability • Needs to flood reputation information • Security • Reputation poisoning attacks

  17. DSG Approach • No reputation dissemination! • Basic observations • A’s neighboring nodes can overhear its packet transmission. • Each packet transmitted by A to a destination node more than one hop away must go through one of A’s neighboring nodes.

  18. DSG Approach • Node assumptions • Omni-directional antenna • DSR • Knowledge of neighboring nodes

  19. DSG Approach – Detecting Mechanism

  20. DSG Approach – Selfish Node Penalty • Selfish nodes are penalized by their neighboring nodes • Discard packets originated by selfish nodes • Penalty lasts as long as the node misbehaves

  21. DSG Approach – Selfish Node Avoidance • Proxy nodes • Route Redirect packet (RRDIR) • Circumvent selfish node

  22. DSG Approach – Rerouting Enforcement • Selfish proxy node • Forward to selfish node • No RRDIR • RRDIR but no rerouting • Rerouting using fabricated route

  23. DSG Approach - Analysis • Instant selfish node avoidance • Minimum control packets transmission • No need to inform nodes about a selfish node • Node rejoin supported

  24. Experimental Results • Experimental results illustrate a 40% increase in throughput under 20% selfish nodes configuration • Not influenced by cheating nodes

  25. Experimental Results – cont’d • Very low false alarm • Very low overhead

  26. Conclusion • Collaboration is critical to the good performance of Mobile Ad Hoc network • Existing techniques cannot solve the problem well enough • DSG Approach is effective, efficient and robust

More Related