pith. sign in

arxiv: 0910.0881 · v2 · submitted 2009-10-05 · 💻 cs.CR · cs.IT· cs.NI· math.IT

When Watchdog Meets Coding

classification 💻 cs.CR cs.ITcs.NImath.IT
keywords detectionwatchdogattackercodingevenmisbehaviornodespackets
0
0 comments X
read the original abstract

In this work we study the problem of misbehavior detection in wireless networks. A commonly adopted approach is to utilize the broadcasting nature of the wireless medium and have nodes monitor their neighborhood. We call such nodes the Watchdogs. In this paper, we first show that even if a watchdog can overhear all packet transmissions of a flow, any linear operation of the overheard packets can not eliminate miss-detection and is inefficient in terms of bandwidth. We propose a light-weigh misbehavior detection scheme which integrates the idea of watchdogs and error detection coding. We show that even if the watchdog can only observe a fraction of packets, by choosing the encoder properly, an attacker will be detected with high probability while achieving throughput arbitrarily close to optimal. Such properties reduce the incentive for the attacker to attack.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.