Skip to main content

Research on Pairwise Key Establishment Model and Algorithm for Sensor Networks

  • Conference paper
Ubiquitous Intelligence and Computing (UIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4159))

Included in the following conference series:

  • 701 Accesses

Abstract

Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A new kind of pairwise key pre-distribution model for sensor networks is proposed. And in addition, based on which, an efficient dynamic key path establishment algorithm is designed. Theoretic analysis and experimental figures show that the new algorithm has better performance than those previous related works.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Eschenauer, L., Gligor, V.: A key-management scheme for distribute sensor networks. In: Atluri, V. (ed.) 9th ACM Conference on Computer and Communication Security, pp. 41–47. ACM Press, Washington (2002)

    Chapter  Google Scholar 

  2. Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: Maurer, U. (ed.) IEEE Symposium on Security and Privacy, pp. 197–213. IEEE Press, California (2003)

    Google Scholar 

  3. Blundo, C., Santis, A.D., Herzberg, A., et al.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)

    Google Scholar 

  4. Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Felten, A. S. (ed.) 10th ACM Conference on Computer and Communications Security, pp. 52–61. ACM Press, Washingtion (2003)

    Chapter  Google Scholar 

  5. Du, W., Deng, J., Han, Y., Varshney, P.: A pairwise key pre-distribution scheme for wireless sensor networks. In: Felten, A. S. (ed.) 10th ACM Conference on Computer and Communications Security, pp. 42–51. ACM Press, Washingtion (2003)

    Chapter  Google Scholar 

  6. Liu, D., Ning, P., Li, R.: Establishing Pairwise Keys in Distributed Sensor Networks. ACM Transactions on Information and System Security 20, 41–77 (2005)

    Article  Google Scholar 

  7. Fang, L., Du, W., Peng, N.: A Beacon-Less Location Discovery Scheme for Wireless Sensor Networks. In: Znati, T., Knightly, E., Makki, K. (eds.) INFOCOM 2005, pp. 161–171. IEEE Press, Miami (2005)

    Google Scholar 

  8. Lei, W., Ya-ping, L.: Maximum safety path matrix based fault-tolerant routing algorithm for hypercube interconnection network. Journal of software 15, 994–1004 (2004)

    MATH  Google Scholar 

  9. Lei, W., Ya-ping, L.: Maximum safety path vector based fault-tolerant routing algorithm for hypercube interconnection network. Journal of China Institute of Communications 16, 130–137 (2004)

    Google Scholar 

  10. Ya-ping, L., Lei, W.: Location information based hierarchical data congregation routing algorithm for sensor networks. Chinese Journal of electronics 32, 1801–1805 (2004)

    Google Scholar 

  11. Heinzelman, W., Kulik, J., Balakrishnan, H.: Negotiation Based Protocols for Disseminating Information in Wireless Sensor Networks. ACM Wireless Networks 8, 169–185 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, L., Lin, Y., Tan, M., Shi, C. (2006). Research on Pairwise Key Establishment Model and Algorithm for Sensor Networks. In: Ma, J., Jin, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_90

Download citation

  • DOI: https://doi.org/10.1007/11833529_90

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38091-7

  • Online ISBN: 978-3-540-38092-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics