MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks (2003) [110 citations — 2 self]

Download:
Download as a PDF
by Sheng Zhong
in Proceedings of IEEE INFOCOM
http://www.ieee-infocom.org/2003/papers/48_04.PDF
Add To MetaCart

Abstract:

Abstract — Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheat-proof, creditbased system for stimulating cooperation among selfish nodes in mobile ad hoc networks. Our system provides incentive for mobile nodes to cooperate and report actions honestly. Compared with previous approaches, our system does not require any tamperproof hardware at any node. Furthermore, we present a formal model of our system and prove its properties. Evaluations of a prototype implementation show that the overhead of our system is small. Simulations and analysis show that mobile nodes can cooperate and forward each other’s messages, unless the resource of each node is extremely low. I.

Citations

672 A Course in Game Theory – Osborne, Rubinstein - 1994
339 Algorithmic mechanism design – Nisan, Ronen - 1999
306 Ariadne: A secure on-demand routing protocol for ad hoc networks – Hu, Perrig, et al. - 2002
296 Ad Hoc Networking – Perkins, Ed - 2001
257 How bad is selfish routing – Roughgarden, Tardos - 2002
164 the internet – Algorithms - 2001
137 H.Katz, “Vertical handoffs in wireless overlay networks – Stemm, Randy - 1998
118 A BGP-based mechanism for lowest-cost routing – Feigenbaum, Papadimitriou, et al. - 2002
59 Vickrey prices and shortest paths: What is an edge worth – Hershberger, Suri - 2001
58 Performance analysis of the CONFIDANT protocol: Cooperation of nodes – fairness in dynamic ad hoc networks – Buchegger, Boudec
35 Algorithms for selfish agents – Nisan - 1999
33 C.S.Raghavendra, ”Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas – Spyropoulos - 2002
29 Performance Comparison of Cellular and Multi-hop Wireless Networks: A Quantitative Study – Hsieh, Sivakumar - 2001
12 Towards mobile ad-hoc WANs: Terminodes – Hubaux, Boudec, et al. - 2000
3 Incentives in Peer-to-Peer File Sharing – Golle, Leyton-Brown, et al. - 2001
1 http://www.monarch.cs.cmu.edu/monarch-papers/ kluwer-adhoc.ps [29 – Available - 2001
1 http://andrew2.andrew.cmu.edu/rfc/rfc1321.htm [33] Secure hash standard, Federal Information Processing Standards Publication 180-1 – Available - 1995
1 P1363 standard,” Available at http://grouper.ieee.org/groups/1363/index.html. A. Proof of Theorem 1 IX. APPENDIX Proof: Consider a strategy profile of all of the rest players, in which each player, nj (j �= i), tells the truth with probability xj. We dist – Group, “IEEE