SpringerLink
Log in

Random key predistribution for wireless sensor networks using deployment knowledge

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We consider a key distribution scheme for wireless sensor networks which uses deployment knowledge. Deployment is modeled as a grid of hexagonal clusters, into centers of which the sensor nodes are dropped according to a given probability distribution (e.g. a Gaussian one). We consider sensor connectivity in a random intersection graph model, instead of the more commonly used in literature G(n, p) graph model. While the latter is easier to analyze, the former is much more suitable to modeling sensor network key distribution. We provide analytical, asymptotic results showing how to pick parameters (key pool size |S|, the number of chosen keys d) depending on the number of deployed nodes in order to assure global connectivity of the network, and estimate the diameter of the network for the given parameters.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blackburn SR, Gerke S (2008) Connectivity of the uniform random intersection graph, Discrete Mathematics. ar**v:0805.2814v2 (to appear)

  2. Blom R (1985) An optimal class of symmetric key generation systems. In: Proceedings of the EUROCRYPT 84 workshop on Advances in cryptology. Springer-Verlag New York, Inc., pp 335–338

  3. Bloznelis M (2008) Degree distribution of a typical vertex in a general random intersection graph. Lith Math J 48(1): 38–45

    Article  MATH  MathSciNet  Google Scholar 

  4. Bloznelis M Component evolution in a general random intersection graph (to appear)

  5. Bloznelis M, Jaworski J, Rybarczyk K (2009) Component evolution in a secure wireless sensor networks. Networks 53(1): 19–26

    Article  MathSciNet  Google Scholar 

  6. Blundo C, De Santis A, Vaccaro U, Herzberg A, Kutten S, Yong M (1998) Perfectly secure key distribution for dynamic conferences. Inf Comput 146(1): 1–23

    Article  MATH  Google Scholar 

  7. Britton T, Deijfen M, Lageras A, Lindholm M (2008) Epidemics on random graphs with tunable clustering. J Appl Probab 45(3): 743–756

    Article  MATH  MathSciNet  Google Scholar 

  8. Deijfen M, Kets W (2007) Random intersection graphs with tunable degree distribution and clustering. Prob Eng Inform Sci (to appear)

  9. Di Pietro R, Mancini L, Mei A, Panconesi A, Radhakrishnan J (2006) How to design connected sensor networks that are provably secure. In: Proceedings of Secure Comm, The 2nd IEEE/CreateNet international on security and privacy in communication networks

  10. Du W, Deng J, Han YS, Varshney PK, Katz J, Khalili A (2005) A pairwise key predistribution scheme for wireless sensor networks. ACM Trans Inf Syst Secur 8(2): 228–258

    Article  Google Scholar 

  11. Du W, Deng J, Han YS, Varshney PK (2006) A key predistribution scheme for sensor networks using deployment knowledge. IEEE Trans Dependable Secur Comput 3(1): 62–77

    Article  Google Scholar 

  12. Eschenauer L, Gligor VD (2002) A key-management scheme for distributed sensor networks. In: CCS’02: proceedings of the 9th ACM conference on Computer and communications security. ACM Press, New York, pp 41–47

  13. Janson S, Łuczak T, Ruciński A (2001) Random graphs. Wiley, New York

    Google Scholar 

  14. Li G, He J, Fu Y (2006) A hexagon-based key predistribution scheme in sensor networks. In: He J (ed) Proceedings of ICPP 2006 workshops, pp 175–180

  15. Liu D, Ning P (2003) Establishing pairwise keys in distributed sensor networks. In: CCS’03: proceedings of the 10th ACM conference on Computer and communications security. ACM Press, New York, pp 52–61

  16. Yu Z, Guan Y (2005) A key pre-distribution scheme using deployment knowledge for wireless sensor networks. In: Guan Y (ed) Proceedings of fourth international symposium on information processing in sensor networks IPSN 2005, pp 261–268

  17. Yun Z, Yanchao Z, Yuguang F (2005) Key establishment in sensor networks based on triangle grid deployment model. In: Zhang Y (ed) Proceedings of IEEE military communications conference MILCOM 2005, vol 3, pp 1450–1455

  18. Yun Z, Yanchao Z, Yuguang F (2005) LLK: a link-layer key establishment scheme for wireless sensor networks. In: Zhang Y (ed) Proceedings of IEEE wireless communications and networking conference, vol 4, pp 1921–1926

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, ul. Umultowska 87, 61-614, Poznan, Poland

    J. Jaworski, M. Ren & K. Rybarczyk

Authors
  1. J. Jaworski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Rybarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Ren.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaworski, J., Ren, M. & Rybarczyk, K. Random key predistribution for wireless sensor networks using deployment knowledge. Computing 85, 57–76 (2009). https://doi.org/10.1007/s00607-009-0036-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-009-0036-9

Keywords

Mathematics Subject Classification (2000)

Search

Navigation