The Community for Technology Leaders
Subscribe
Issue No.09 - September (2009 vol.8)
pp: 1221-1234
Patrick Tague , University of Washington, Seattle
Mingyan Li , Boeing Phantom Works and University of Washington, Seattle
Radha Poovendran , Unversity of Washington, Seattle
ABSTRACT
Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users is not deterred by spread spectrum, as they know the required spreading sequences. For the case of internal adversaries, we propose a framework for control channel access schemes using the random assignment of cryptographic keys to hide the location of control channels. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jamming by malicious or compromised users and show that the availability of service degrades gracefully as the number of colluding insiders or compromised users increases. We propose an algorithm called GUIDE for the identification of compromised users in the system based on the set of control channels that are jammed. We evaluate the estimation error using the GUIDE algorithm in terms of the false alarm and miss rates in the identification problem. We discuss various design trade-offs between robustness to control channel jamming and resource expenditure.
INDEX TERMS
Wireless multiple access, control channel jamming, security, node capture attacks, probabilistic metrics.
CITATION
Patrick Tague, Mingyan Li, Radha Poovendran, "Mitigation of Control Channel Jamming under Node Capture Attacks", IEEE Transactions on Mobile Computing, vol.8, no. 9, pp. 1221-1234, September 2009, doi:10.1109/TMC.2009.33
REFERENCES
 [1] P. Tague, M. Li, and R. Poovendran, “Probabilistic Mitigation of Control Channel Jamming via Random Key Distribution,” Proc. 18th Ann. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC '07), Sept. 2007. [2] K. Fazel and S. Kaiser, Multi-Carrier and Spread Spectrum Systems. Wiley, 2003. [3] T.S. Rappaport, Wireless Communications: Principles and Practice, second ed. Prentice Hall, 2001. [4] J. Schiller, Mobile Communications. Addison-Wesley, 2000. [5] G.L. Stüber, Principles of Mobile Communications, second ed. Kluwer, 2001. [6] R. Anderson, Security Engineering: A Guide to Building Dependable Distributed Systems. John Wiley & Sons, Inc., 2001. [7] A. Chan, X. Liu, G. Noubir, and B. Thapa, “Control Channel Jamming: Resilience and Identification of Traitors,” Proc. IEEE Int'l Symp. Information Theory (ISIT '07), June 2007. [8] A. Perrig, J. Stankovic, and D. Wagner, “Security in Wireless Sensor Networks,” Comm. ACM, vol. 47, no. 6, pp. 53-57, June 2004. [9] W. Xu, W. Trappe, and Y. Zhang, “Channel Surfing: Defending Wireless Sensor Networks from Interference,” Proc. Sixth Int'l Conf. Information Processing in Sensor Networks (IPSN '07), pp. 499-508, Apr. 2007. [10] M. agalj, S. apkun, and J.-P. Hubaux, “Wormhole-Based Antijamming Techniques in Sensor Networks,” IEEE Trans. Mobile Computing, vol. 6, no. 1, pp. 100-114, Jan. 2007. [11] L. Eschenauer and V.D. Gligor, “A Key-Management Scheme for Distributed Sensor Networks,” Proc. Ninth ACM Conf. Computer and Communications Security (CCS '02), pp. 41-47, Nov. 2002. [12] B. Parno, A. Perrig, and V. Gligor, “Distributed Detection of Node Replication Attacks in Sensor Networks,” Proc. IEEE Symp. Security and Privacy, pp. 49-63, May 2005. [13] P. Erdös, P. Frankl, and Z. Füredi, “Families of Finite Sets in Which No Set is Covered by the Union of $r$ Others,” Israel J. Math., vol. 51, nos. 1/2, pp. 79-89, 1985. [14] D.J.C. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge Univ. Press, 2003. [15] R. Diestel, Graph Theory, third ed. Springer, 2005. [16] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996. [17] P. Tague and R. Poovendran, “A Canonical Seed Assignment Model for Key Predistribution in Wireless Sensor Networks,” ACM Trans. Sensor Networks, vol. 3, no. 4, pp. 19:1-19:39, Oct. 2007. [18] P. Tague and R. Poovendran, “Modeling Adaptive Node Capture Attacks in Multi-Hop Wireless Networks,” Ad Hoc Networks, vol. 5, no. 6, pp. 801-814, Aug. 2007. [19] W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. John Wiley & Sons, Inc., 1957. [20] H.A. David and H.N. Nagaraja, Order Statistics, third ed. John Wiley & Sons, Inc., 2003.