DARWIN: Distributed and adaptive reputation mechanism for wireless ad-hoc networks

Juan José Jaramillo, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Mobile ad-hoc networks are deployed under the assumption that participating nodes are willing to forward other nodes' packets. In reputation-based mechanisms cooperation is induced by means of a threat of partial or total disconnection from the network if a node is non-cooperative; however packet collisions and interference may make cooperative nodes appear selfish sometimes. In this paper we use a simple network model to first study the performance of some proposed reputation strategies and then present a new mechanism that we call DARWIN (Distributed and Adaptive Reputation mechanism for WIreless ad-hoc Networks). The idea is to avoid a retaliation situation after a node has been falsely perceived as selfish so cooperation can be restored quickly. We prove that our strategy is robust to imperfect measurements, is collusion-resistant and can achieve full cooperation among nodes.

Original languageEnglish (US)
Title of host publicationMobiCom'07
Subtitle of host publicationProceedings of the Thirteenth ACM International Conference on Mobile Computing and Networking
Pages87-98
Number of pages12
DOIs
StatePublished - 2007
EventMobiCom'07: Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking - Montreal, QC, Canada
Duration: Sep 9 2007Sep 14 2007

Publication series

NameProceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Other

OtherMobiCom'07: Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking
Country/TerritoryCanada
CityMontreal, QC
Period9/9/079/14/07

Keywords

  • Algorithms
  • Design
  • Security
  • Theory

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'DARWIN: Distributed and adaptive reputation mechanism for wireless ad-hoc networks'. Together they form a unique fingerprint.

Cite this