When Watchdog Meets Coding

We consider the problem of misbehavior detection in wireless networks. A commonly adopted approach is to exploit the broadcast nature of the wireless medium, where nodes monitor their downstream neighbors locally using overheard messages. We call such nodes the Watchdogs. We propose a lightweight 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 error detection code properly, an attacker can be detected with high probability while achieving throughput arbitrarily close to optimal. Such properties reduce the incentive for the attacker to attack. We then consider the problem of locating the misbehaving node and propose a simple protocol, which locates the misbehaving node with high probability. The protocol requires exactly two watchdogs per unreliable relay node.

[1]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  Muriel Médard,et al.  An algebraic watchdog for wireless network coding , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[6]  B SrivastavaMani,et al.  Reputation-based framework for high integrity sensor networks , 2008 .

[7]  Brian L. Mark,et al.  A quantitative trust establishment framework for reliable data packet delivery in MANETs , 2005, SASN '05.

[8]  Tracey Ho,et al.  Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Reza Curtmola,et al.  Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks , 2009, WiSec '09.

[11]  Jaewoo Chung,et al.  Mobile Computing Systems and Applications , 2011, IEEE Pervasive Comput..

[12]  Kamal Jain,et al.  Signatures for Network Coding , 2006 .

[13]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

[14]  Mani B. Srivastava,et al.  Reputation-based framework for high integrity sensor networks , 2004, SASN '04.

[15]  Niki Pissinou,et al.  Towards Designing a Trusted Routing Solution in Mobile Ad Hoc Networks , 2005, Mob. Networks Appl..

[16]  Fang Zhao,et al.  Signatures for Content Distribution with Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[17]  Yong Guan,et al.  An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  John C. S. Lui,et al.  On the Practical and Security Issues of Batch Content Distribution Via Network Coding , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[19]  Muriel Médard,et al.  Counteracting Byzantine adversaries with network coding: An overhead analysis , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[20]  Kamal Jain,et al.  Signatures for Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.