, Volume 85, Issue 1–2, pp 57–76 | Cite as

Random key predistribution for wireless sensor networks using deployment knowledge

  • J. Jaworski
  • M. Ren
  • K. Rybarczyk


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.


Wireless sensor network Deployment knowledge Random key predistribution Random intersection graph Connectivity Diameter 

Mathematics Subject Classification (2000)

68R01 90B15 05C62 05C80 60C05 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blackburn SR, Gerke S (2008) Connectivity of the uniform random intersection graph, Discrete Mathematics. arXiv:0805.2814v2 (to appear)Google Scholar
  2. 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–338Google Scholar
  3. 3.
    Bloznelis M (2008) Degree distribution of a typical vertex in a general random intersection graph. Lith Math J 48(1): 38–45zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bloznelis M Component evolution in a general random intersection graph (to appear)Google Scholar
  5. 5.
    Bloznelis M, Jaworski J, Rybarczyk K (2009) Component evolution in a secure wireless sensor networks. Networks 53(1): 19–26CrossRefMathSciNetGoogle Scholar
  6. 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–23zbMATHCrossRefGoogle Scholar
  7. 7.
    Britton T, Deijfen M, Lageras A, Lindholm M (2008) Epidemics on random graphs with tunable clustering. J Appl Probab 45(3): 743–756zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Deijfen M, Kets W (2007) Random intersection graphs with tunable degree distribution and clustering. Prob Eng Inform Sci (to appear)Google Scholar
  9. 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 networksGoogle Scholar
  10. 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–258CrossRefGoogle Scholar
  11. 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–77CrossRefGoogle Scholar
  12. 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–47Google Scholar
  13. 13.
    Janson S, Łuczak T, Ruciński A (2001) Random graphs. Wiley, New YorkGoogle Scholar
  14. 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–180Google Scholar
  15. 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–61Google Scholar
  16. 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–268Google Scholar
  17. 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–1455Google Scholar
  18. 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–1926Google Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoznanPoland

Personalised recommendations