Reactive identification of misbehavior in ad hoc networks based on random audits

William Kozma, Loukas Lazos

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

4 Scopus citations

Abstract

We address the problem of identifying misbehaving nodes that (selectively) drop packets, in order to degrade the network performance. Such nodes may agree to forward packets by participating in the route discovery process, but refuse to do so once the packets have been received. We propose a reactive approach where the source initiates an audit process if a significant performance degradation is observed. We employ a compact representation of the behavioral proof of a node by adopting Bloom filter structures and show that the misbehaving node can be identified based on random audits. Our approach provides significant energy savings compared to previously proposed methods that rely on reputation systems, or intensive acknowledgment schemes.

Original languageEnglish (US)
Title of host publication2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
Pages612-614
Number of pages3
DOIs
StatePublished - 2008
Event5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008 - San Francisco, CA, United States
Duration: Jun 16 2008Jun 20 2008

Publication series

Name2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON

Other

Other5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008
Country/TerritoryUnited States
CitySan Francisco, CA
Period6/16/086/20/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Reactive identification of misbehavior in ad hoc networks based on random audits'. Together they form a unique fingerprint.

Cite this