Randomized Fault Tolerant Group Testing and Advanced Security

In this chapter, we further optimize the time complexity of the scheme discussed in Chap. 3 and provide more advanced solutions. In detail, a randomized fault-tolerant group testing construction to reduce the computational cost, compared to the one using irreducible polynomials on Galois Field is introduced. Based on such a new GT construction, a more robust defense solution to an advanced jamming attack is presented for various network scenarios. Theoretical analysis and simulation results are included to validate the performance of this framework.

[1]  Wenyuan Xu,et al.  Jamming sensor networks: attack and defense strategies , 2006, IEEE Network.

[2]  Wenyuan Xu,et al.  Channel surfing and spatial retreats: defenses against wireless denial of service , 2004, WiSe '04.

[3]  Vyas Sekar,et al.  LADS: Large-scale Automated DDoS Detection System , 2006, USENIX Annual Technical Conference, General Track.

[4]  Radha Poovendran,et al.  Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection , 2011, IEEE/ACM Transactions on Networking.

[5]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[6]  Rami G. Melhem,et al.  Roaming honeypots for mitigating service-level denial-of-service attacks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[7]  Radha Poovendran,et al.  Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.