REAct
Authors:
Open Access
- 16 March 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 103-110
Abstract
Wireless ad hoc networks rely on multi-hop routes to transport data from source to destination. The routing function is implemented in a collaborative manner, with each node responsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access to commercial wireless devices, combined with the poor physical and software security of the devices, can lead to node misconfiguration or misbehavior. A misbehaving node may refuse to forward packets in order to conserve its energy (selfishness), or simply degrade network performance (maliciousness). In this paper, we investigate the problem of uniquely identifying the set of misbehaving nodes who refuse to forward packets. We propose a novel misbehavior identification scheme called REAct that provides resource-efficient accountability for node misbehavior. REAct identifies misbehaving nodes based on a series of random audits triggered upon a performance drop. We show that a source-destination pair using REAct can identify any number of independently misbehaving nodes based on behavioral proofs provided by nodes. Proofs are constructed using Bloom filters which are storage-efficient membership structures, thus significantly reducing the communication overhead for misbehavior detection.Keywords
This publication has 15 references indexed in Scilit:
- TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks2008
- Providing Fault-Tolerant Ad hoc Routing Service in Adversarial EnvironmentsWireless Personal Communications, 2004
- Network Applications of Bloom Filters: A SurveyInternet Mathematics, 2004
- Secure traceroute to detect faulty or malicious routingACM SIGCOMM Computer Communication Review, 2003
- A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks2003
- Investigating the energy consumption of a wireless network interface in an ad hoc networking environment2002
- An on-demand secure routing protocol resilient to byzantine failures2002
- Building the IBM 4758 secure coprocessorComputer, 2001
- Mitigating routing misbehavior in mobile ad hoc networks2000
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970