Inherent Security Benefits of Analog Network Coding for the Detection of Byzantine Attacks in Multi-Hop Wireless Networks

Modern multi-hop wireless networks employ a number of sophisticated schemes to secure the network against hostile attacks. However, constant improvements in any security mechanism is matched by ever increasing sophisticated attacks. Therefore, there is a constant need to develop innovative schemes, especially for applications where the integrity of the message is vital. Attacks from trusted byzantine nodes that belong to the network itself are particularly challenging, as these nodes have a hidden malicious component and have complete access to the network resources. Previous works have studied these attacks and countermeasures for multi-hop networks and on networks capable of performing Network Coding. In this paper, we identify an inherent security benefit of Analog Network Coding and show how it can be used to design a novel Dual Non-adjacent Watchdog scheme that can detect a set of malicious byzantine attacks.

[1]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[2]  Donald F. Towsley,et al.  Reliability Gain of Network Coding in Lossy Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Panagiotis Papadimitratos,et al.  Secure data transmission in mobile ad hoc networks , 2003, WiSe '03.

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

[5]  Tracey Ho,et al.  Byzantine Modification Detection in Multicast Networks With Random Network Coding , 2008, IEEE Transactions on Information Theory.

[6]  Prasanna Chaporkar,et al.  Adaptive network coding and scheduling for maximizing throughput in wireless networks , 2007, MobiCom '07.

[7]  Sachin Katti,et al.  Embracing wireless interference: analog network coding , 2007, SIGCOMM.

[8]  Nitin H. Vaidya,et al.  When Watchdog Meets Coding , 2009, 2010 Proceedings IEEE INFOCOM.

[9]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[10]  John C. S. Lui,et al.  How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[11]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[12]  Soung Chang Liew,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2022 .

[13]  Calvin Ko,et al.  Challenges in intrusion detection for wireless ad-hoc networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[14]  Radia J. Perlman,et al.  Network layer protocols with Byzantine robustness , 1988 .

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

[16]  Soung Chang Liew,et al.  Hot topic: physical-layer network coding , 2006, MobiCom '06.

[17]  Haiyun Luo,et al.  Security in mobile ad hoc networks: challenges and solutions , 2004, IEEE Wireless Communications.

[18]  Reza Curtmola,et al.  Mitigating Byzantine Attacks in Ad Hoc Wireless Networks , 2004 .

[19]  Reza Curtmola,et al.  ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks , 2008, TSEC.

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

[21]  Muriel Medard,et al.  On network coding for security , 2007, MILCOM 2007 - IEEE Military Communications Conference.