Identifying Pollution Attackers in Network-Coding Enabled Wireless Mesh Networks

Pollution attack is a severe security problem in network-coding enabled wireless mesh networks (WMNs). Under such form of attack, malicious nodes can easily create an epidemic spreading of polluted packets to deplete network resources. We address this security problem even when the attackers are "intelligent" in the sense that they may pretend to be legitimate nodes to probabilistically transmit valid packets so as to reduce the chance of being detected. We use the batch verification technique to determine the existence of polluted packets, and propose fully "distributed" and "randomized" detection algorithms to identify the attackers who inject polluted packets, and purge them for future communication. Formal analysis is provided to quantify performance measures of the algorithms, e.g., probability of false positive and probability of false negative, as well as the probability distribution of time needed to identify all malicious nodes. Simulation and system prototype are carried out to show the effectiveness and efficiency of the detection algorithms.

[1]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[2]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[3]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[4]  C. Fragouli,et al.  On Locating Byzantine Attackers , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

[5]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[6]  John C. S. Lui,et al.  On the Performance Bounds of Practical Wireless Network Coding , 2010, IEEE Transactions on Mobile Computing.

[7]  Christos Gkantsidis,et al.  Multipath code casting for wireless mesh networks , 2007, CoNEXT '07.

[8]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[9]  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.

[10]  Jing Dong,et al.  Toward secure network coding in wireless networks: Threats and challenges , 2008, 2008 4th Workshop on Secure Network Protocols.

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

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

[13]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[14]  Tracey Ho,et al.  On combining information-theoretic and cryptographic approaches to network coding security against the pollution attack , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[15]  Baochun Li,et al.  Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding , 2009, IEEE INFOCOM 2009.

[16]  John C. S. Lui,et al.  DCAR: Distributed Coding-Aware Routing in Wireless Networks , 2010, IEEE Trans. Mob. Comput..

[17]  Michael B. Matthews Proceedings of the 43rd Asilomar conference on Signals, systems and computers , 2009 .

[18]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[19]  John C. S. Lui,et al.  Stochastic analysis of a randomized detection algorithm for pollution attack in P2P live streaming systems , 2010, Perform. Evaluation.

[20]  Athina Markopoulou,et al.  Locating Byzantine Attackers in Intra-Session Network Coding Using SpaceMac , 2010, 2010 IEEE International Symposium on Network Coding (NetCod).

[21]  John C. S. Lui,et al.  On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks , 2007, IEEE Transactions on Computers.

[22]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[23]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .