The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2011 vol.22)
pp: 176-184
Amar Rasheed , Texas A&M University, College Station
Rabi N. Mahapatra , Texas A&M University, College Station
ABSTRACT
Security services such as authentication and pairwise key establishment are critical to sensor networks. They enable sensor nodes to communicate securely with each other using cryptographic techniques. In this paper, we propose two key predistribution schemes that enable a mobile sink to establish a secure data-communication link, on the fly, with any sensor nodes. The proposed schemes are based on the polynomial pool-based key predistribution scheme, the probabilistic generation key predistribution scheme, and the Q-composite scheme. The security analysis in this paper indicates that these two proposed predistribution schemes assure, with high probability and low communication overhead, that any sensor node can establish a pairwise key with the mobile sink. Comparing the two proposed key predistribution schemes with the Q-composite scheme, the probabilistic key predistribution scheme, and the polynomial pool-based scheme, our analytical results clearly show that our schemes perform better in terms of network resilience to node capture than existing schemes if used in wireless sensor networks with mobile sinks.
INDEX TERMS
Distributed systems, sensor networks.
CITATION
Amar Rasheed, Rabi N. Mahapatra, "Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 1, pp. 176-184, January 2011, doi:10.1109/TPDS.2010.57
REFERENCES
[1] G.J. Pottie and W.J. Kaiser, "Wireless Integrated Network Sensors," Comm. ACM, vol. 43, pp. 51-58, 2000.
[2] T. Gao, D. Greenspan, M. Welesh, R.R. Juang, and A. Alm, "Vital Signs Monitoring and Patient Tracking Over a Wireless Network," Proc. 27th Ann. Int'l Conf. IEEE Eng. in Medicine and Biology Soc. (EMBS), Sept. 2005.
[3] L. Gu, D. Jia, P. Vicaire, T. Yan, L. Luo, A. Tirumala, Q. Cao, T. He, J.A. Stankovic, T. Abdelzaher, and B.H. Krogh, "Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments," Proc. Third ACM Conf. Embedded Networked Sensor Systems, Nov. 2005.
[4] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[5] J. Kahn, R. Katz, and K. Pister, "Next Century Challenges: Mobile Networking for Smart Dust," Proc. ACM MobiCom '99, Aug. 1999.
[6] T. Small and Z. Haas, "The Shared Wireless Infostation Model—A New Ad Hoc Networking Paradigm (or Where there is a Whale, there is a Way)," Proc. ACM MobiHoc, 2003.
[7] P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet," Proc. 10th Ann. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
[8] A. Chakrabarti, A. Sabharwal, and B. Aazhang, "Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks," Proc. Second Int'l Workshop Information Processing in Sensor Networks (IPSN), 2003.
[9] A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin, "Intelligent Fluid Infrastructure for Embedded Networks," Proc. Second Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), 2004.
[10] W. Zhao, M. Ammar, and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks," Proc. ACM MobiHoc, 2004.
[11] J. Luo and J.-P. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[12] S. Jain, R.C. Shah, W. Brunette, G. Borriello, and S. Roy, "Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks," Mobile Networks and Applications, vol. 11, no. 3, pp. 327-339, 2006.
[13] A. Somasundara, A. Kansal, D. Jea, D. Estrin, and M. Srivastava, "Controllably Mobile Infrastructure for Low Energy Embedded Networks," IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 958-973, Aug. 2006.
[14] A.A. Rasheed and R.N. Mahapatra, "An Energy-Efficient Hybrid Data Collection Scheme in Wireless Sensor Networks," Proc. Third IEEE Int'l Conf. Intelligent Sensors, Sensor Networks and Information Processing, 2007.
[15] A. Chakrabarti, A. Sabharwal, and B. Aazhang, "Communication Power Optimization in a Sensor Network with a Path-Constrained Mobile Observer," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 297-324, Aug. 2006.
[16] C. Karlof and D. Wagner, "Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures," AdHoc Networks J., special issue on sensor network applications and protocols, vol. 1, pp. 293-315, 2003.
[17] S. Hussain, F. Kausar, and A. Massod, "An Efficient Key Distribution Scheme for Heterogeneous Sensor Networks," Proc. Int'l Conf. Wireless Comm. and Mobile Computing (IWCMC), 2007.
[18] D. Liu, P. Ning, and R. Li, "Establishing Pairwise Keys in Distributed Sensor Networks," Proc. 10th ACM Conf. Computers and Comm. Security (CCS '03), pp. 52-61, Oct. 2003.
[19] L. Eschenauer and V.D. Gligor, "A Key-Management Scheme for Distributed Sensor Networks," Proc. ACM Conf. Computer Comm. Security (CCS '02), pp. 41-47, 2002.
[20] H. Chan, A. Perrig, and D. Song, "Random Key Pre-Distribution Schemes for Sensor Networks," Proc. IEEE Symp. Security and Privacy, 2003.
[21] R. Blom, "Non-Public Key Distribution," Advances in Cryptology—CRYPTO '82, D. Chaum, R.L. Rivest, and A.T. Sherman, eds., pp. 231-236, Plenum Publishing, 1982.
[22] C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, "Perfectly Secure Key Distribution for Dynamic Conferences," Advances in Cryptology—CRYPTO '92, E.F. Brickell, ed., pp. 471-486, Springer-Verlag, 1992.
[23] K. Ren, K. Zeng, and W. Lou, "A New Approach for Random Key Pre-Distribution in Large-Scale Wireless Sensor Networks," Wireless Comm. and Mobile Computing, vol. 6, no. 3, pp. 307-318, 2006.
[24] R. Merkle, "Secure Communication over Insecure Channels," Comm. ACM, vol. 21, no. 4, pp. 294-299, 1978.
[25] W. Du, J. Deng, Y.S. Han, P.K. Varshney, J. Katz, and A. Khalili, "A Pairwise Key Predistribution Scheme for Wireless Sensor Networks," ACM Trans. Information and System Security, vol. 8, no. 2, pp. 228-258, May 2005.
[26] A.A. Rasheed and R.N. Mahapatra, "An Efficient Key Distribution Scheme for Establishing Pairwise Keys with a Mobile Sink in Distributed Sensor Networks," Proc. 27th IEEE Int'l Performance Computing and Comm. Conf. (IPCCC '08), pp. 264-270, Dec. 2008.
[27] S. Ruj and B. Roy, "Key Predistribution Using Combinational Designs for Grid-Group Deployment Scheme in Wireless Sensor Networks," ACM Trans. Sensor Networks, vol. 6, no. 1, Dec. 2009.
[28] M. Albrecht, C. Gentry, S. Halevi, and J. Katz, "Attacking Cryptographic Schemes Based on Perturbation Polynomials," Proc. 16th ACM Conf. Computer and Comm. Security, pp. 1-10, 2009.
[29] P. De, Y. Liu, and S.K. Das, "Deployment-Aware Modeling of Node Compromise Spread in Wireless Sensor Networks Using Epidemic Theory," ACM Trans. Sensor Networks, vol. 5, no. 3, May 2009.
[30] H. Song, S. Zhu, W. Zhang, and G. Cao, "Least Privilege and Privilege Deprivation: Toward Tolerating Mobile Sink Compromises in Wireless Sensor Networks," ACM Trans. Sensor Networks, vol. 4, no. 4, Aug. 2008.
[31] D. Liu, P. Ning, and W. Du, "Group-Based Key Predistribution for Wireless Sensor Networks," ACM Trans. Sensor Networks, vol. 4, no. 2, pp. 1-30, Mar. 2008.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool