1 / 1

The Effect of Mobility on Cooperation in Ad Hoc Networks

The Effect of Mobility on Cooperation in Ad Hoc Networks. Márk Félegyházi 1 , Jean-Pierre Hubaux 1 , Levente Buttyán 2 1 École Polytechnique Fédérale de Lausanne – Laboratory for Computer Communications and Applications

aleron
Download Presentation

The Effect of Mobility on Cooperation in Ad Hoc Networks

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. The Effect of Mobility on Cooperation in Ad Hoc Networks Márk Félegyházi1, Jean-Pierre Hubaux1,Levente Buttyán2 1École Polytechnique Fédérale de Lausanne – Laboratory for Computer Communications and Applications 2Budapest University of Technology and Economics – Laboratory of Cryptography and System Security Ad hoc networks Game-theoretic model for packet forwarding self-organizing network each networking service is provided by the nodes • mobile network scenario • we assume that the nodes are rational • time is divided into time slots We focus on packet forwarding Problem of non-cooperation Concept: The node plays against the rest of the network Nodes are selfish = they try to save resources by not contributing to packet forwarding. Incentive techniques to stimulate cooperation No authentication of the nodes is needed Question:Do we need these incentive mechanisms or can cooperation exist based on the self-interest of the nodes? Interaction: Result βi (k): benefit of node i until step k γi (k): contribution of node i until step k ρi (k): interaction ratio of node i until step k Strategy: For each step k: IF ρi (k) ≥ кiFORWARD in step k+1 ELSE DROP in step k+1 The Generous Tit-For-Tat (GTFT) strategy: L: average length of the connections g: generosity of the node Step duration increases => mobility increases 1. Required generosity decreases as mobility increases. Hence, mobility has a beneficial effect on cooperation. 2. But, generosity is always needed to bootstrap cooperation. Goal of the nodes: Conclusion B: benefit for node i if a packet arrives C: cost for node i if it forwards a packet Incentive techniques are required to motivate nodes to cooperate in a mobile ad hoc network.

More Related