Abstract
For the secure transmission of information in the mobile wireless sensor network, the information between two nodes must be encrypted. To this end, nodes must share the common key necessary for encryption. At this time, the encryption algorithm should be symmetric cryptography rather than public-key cryptography in consideration of the process performance of sensor nodes, and the number of secret keys that each node must store and manage must be minimized in view of its memory capacity. In this paper, we propose a method of reducing the number of secret keys in spite of using the symmetric encryption algorithm. In this method, each node must store and manage by assigning a unique ID to it, and by ensuring that only those two nodes whose the Hamming Distance between their IDs is ”1” share the same secret key. According to this method, each node needs to store and manage only log 2 N symmetric secret keys so that two nodes participating in the mobile wireless sensor network can obtain a common key for secure transmission of information. In this paper, we also propose the protocol and algorithm for obtaining a common key between two nodes using their own secret keys and the secret keys acquired from their neighbor nodes, and evaluate the performance (including node connectivity, network resilience against node capture, memory capacity, and key pool size) of our proposing method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chan, S.P., Poovendran, R., Sun, M.T.: A key management scheme in distributed sensor networks using attack probabilities. IEEE Globecom (December 2005)
Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.K.: A key management scheme for wireless sensor networks using deployment knowledge. In: Proceedings of the IEEE INFOCOM, IEEE, Los Alamitos (2004)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, Berkeley, California, pp. 197–213. IEEE Computer Society Press, Los Alamitos (2003)
Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A pairwise key pre-distribution scheme for wireless sensor networks. In: Proceedings of the 10th ACM Confernce on Computer and Communications Security(CCS), Washington, DC, USA, pp. 42–51. ACM, New York (October 2003)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security(CCS), Washington, DC, USA, pp. 52–61. ACM, New York (October 2003)
Capkun, S., Buttyan, L., Hubaux, J.-P.: Self-Organized Public-Key Management for Mobile Ad Hoc Networks. IEEE Trans. on mobile computing 2(1) (2003)
Eschenauer, L., Gligor, V.D.: A Key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM conference on Computer and communication security, Washingto, DC, USA, pp. 41–47. ACM, New York (November 2002)
Akylidiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirici, E.: The survey on sensor networks. IEEE Communications Magzine 40(8), 114–120 (2002)
Luo, H., Lu, S.: Ubiquitous and robust authentication services for ad-hoc wireless networks, Technical Report 200030, UCLA Computer Science Department (October 2000)
Corson, S., Macker, J.: Mobile Ad-hoc Networking(MANET): Routing Protocol Performance issues and Evaluation Considerations, IETF RFC2501 (January 1999)
Stajano, F., Anderson, R.: The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks. In: Proc. seventh Int’l workshop security protocols (1999)
Blundo, C., Santis, A.D., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–496. Springer, Heidelberg (1993)
Jain, R.: The art of computer systems performance analysis. John Wiley & Sons, Chichester (1991)
Hamming, R.: Coding and Information Theory. Prentice-Hall, Englewood Cliffs (1980)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signature and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions in Information Theory 22, 644–654 (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, SL., Hwang, BS., Song, JS. (2007). A Secure Communication Scheme for Mobile Wireless Sensor Networks Using Hamming Distance. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)