Abstract
Most of wireless sensor networks (WSNs) are deployed in an environment where communication between sensors may be monitored. For applications which require higher security, it is therefore necessary to employ some cryptographic scheme in the network. However, key management in WSNs is a challenging task due to the constrained resources. In this paper, based on the concept of small worlds, we present a group-based key predistribution scheme which enables any pair of sensors to establish a unique shared key. The key path establishment uses only local information with logarithmic memory overhead to the number of groups. Other performance, including communication and computing overhead, are evaluated also. The results show that the proposed key management method performs better than other known methods.
This work was supported in part by TWISC@NCKU, National Science Council under the Grants NSC 94-3114-P-006-001-Y and NSC 95-2221-E-110-083.
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
Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor networks. In: Proc. the 9th ACM Conference on Computer and Communication Security, Washington, DC, USA, pp. 41–47. ACM, New York (2002)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: Proc. IEEE Symposium on Security and Privacy, Oakland, California, USA, pp. 197–213. IEEE, Los Alamitos (2003)
Du, W., Deng, J., Han, Y., Varshney, P.: A pairwise key predistribution scheme for wireless sensor networks. In: Proc. the Tenth ACM Conference on Computer and Communications Security, Washington, DC, USA, pp. 42–51. ACM, New York (2003)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proc. the Tenth ACM Conference on Computer and Communications Security, Washington, DC, USA, pp. 52–61. ACM, New York (2003)
Milgram, S.: he Small world problem. Psychology Today 61(1), 60–67 (1967)
Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425–443 (1969)
Korte, C., Milgram, S.: Acquaintance networks between racial groups: Application of the small world method. J. Personality and Social Psychology 15(2), 101–108 (1978)
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)
Amaral, L.A.N., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small world networks. PNAS 97(21), 11149–11152 (2000)
Kleinberg, J.: The small-world phenomenon: An algorithm perspective. In: Proc. 32nd ACM Symposium on Theory of Computing, Portland, Oregon, USA, pp. 163–170. ACM, New York (2000)
Chan, H., Perrig, A.: PIKE: Peer intermediaries for key establishment in sensor networks. In: Proc. IEEE INFOCOM 2005, Miami, USA, pp. 524–535. IEEE, Los Alamitos (2005)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–114 (2002)
Ghosh, B.: Random Distances within a rectangle and between two rectangles. Bull. Calcutta Math. Soc. 43, 17–24 (1951)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proc. the Sixth International Conference on Mobile Computing and Networking (MobiCom 2000), Boston, Massachusetts, USA, pp. 243–254 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, YT., Chen, CM., Jeng, B. (2007). A Key Predistribution Scheme for Wireless Sensor Networks Using the Small-World Concept. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-74573-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74572-3
Online ISBN: 978-3-540-74573-0
eBook Packages: Computer ScienceComputer Science (R0)