A Reputation-based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks

  • Authors:
  • M. Tamer Refaei;Vivek Srivastava;Luiz DaSilva;Mohamed Eltoweissy

  • Affiliations:
  • Department of Electrical and Computer Engineering Virginia Tech;Department of Electrical and Computer Engineering Virginia Tech;Department of Electrical and Computer Engineering Virginia Tech;Department of Computer Science Virginia Tech

  • Venue:
  • MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

For ad hoc networks to realize their potential in commercial deployments, it is important that they incorporate adequate security measures. Selfish behavior of autonomous network nodes could greatly disrupt network operation. Such behavior should be discouraged, detected, and isolated. In this paper, we propose a reputation-based mechanism to detect and isolate selfish nodes in an ad hoc network. The proposed mechanism allows a node to autonomously evaluate the "reputation" of its neighbors based on the completion of the requested service. The underlying principle is that when a node forwards a packet through one of its neighbors, it holds that neighbor responsible for the correct delivery of the packet to the destination. Our mechanism is efficient and immune to node collusion since, unlike most contemporary mechanisms for reputation-based trust, it does not depend on exchanging reputation information among nodes. We also explore various reputation functions and report on their effectiveness in isolating selfish nodes and reducing false positives. Our simulation results demonstrate that the choice of the reputation function greatly impacts performance and that the proposed mechanism, with a carefully selected function, is successful in isolating selfish nodes while maintaining false positives at a reasonably low level.