Adaptive Random Key Distribution Schemes for Wireless Sensor Networks

  • Shih-I Huang
  • Shiuhpyng Shieh
  • S.Y. Wu


Wireless Sensor Networks (WSNs) are formed by a set of small devices, called nodes, with limited computing power, storage space, and wireless communication capabilities. Most of these sensor nodes are deployed within a specific area to collect data or monitor a physical phenomenon. Data collected by each sensor node needs to be delivered and integrated to derive the whole picture of sensing phenomenon. To deliver data without being compromised, WSN services rely on secure communication and efficient key distribution. In this paper, we proposed two key distribution schemes for WSNs, which require less memory than existing schemes for the storage of keys. The Adaptive Random Pre-distributed scheme (ARP) is able to authenticate group membership and minimize the storage requirement for the resource limited sensor nodes. The Uniquely Assigned One-way Hash Function scheme (UAO) extends ARP to mutually authenticate the identity of individual sensors. The two proposed schemes are effective for the storage of keys in a wireless sensor network with a large number of sensors.


Sensor Network Sensor Node Wireless Sensor Network Connectivity Probability Random Graph Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Akyilidiz et al., 2002]
    F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. (2002). A Survey on Sensor Networks. In IEEE Communications Magazine, pages 102–114, August.Google Scholar
  2. [Estrin et al., 1999]
    D. Estrin, R. Govindan, J. Heidemann and S. Kumar. (1999). Next Century Challenges: Scalable Coordination in Sensor Networks, In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, August.Google Scholar
  3. [Slijepcevic et al., 2002]
    S. Slijepcevic, M. Potkonjak, V. Tsiatsis, S. Zimbeck, and M. B. Srivastava. (2002). On communication security in wireless ad-hoc sensor network, Eleventh IEEE International Workshops on Enabling Technologies: Infrastructure fbr Collaborative Enterprises (WETICE'02), June.Google Scholar
  4. [Tilak et al., 2002]
    S. Tilak, N. Abu-Ghazaleh, and W. Heinzelman. (2002). A taxonomy of wireless microsensor network models, A CM Mobile Computing and Communications Review (MC2R 2002).Google Scholar
  5. [Hodjat et al.^, 2002]
    Hodjat and I. Verbauwhede. (2002). The energy cost of secrets in ad-hoc networks, IEEE CAS Workshop on Wireless Communications and Networking, September.Google Scholar
  6. [He et al., 2003]
    T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher. (2003). Speed: A stateless protocol for real-time communication in sensor networks, In International Conference on Distributed Computing Systems (ICDCS 2003), May.Google Scholar
  7. [Heinelman et al., 2000]
    W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. (2000). Energy efficient communication protocols for wireless microsensor networks, Proc. Hawaaian Int'l Conf. on Systems Science, January.Google Scholar
  8. [Heinzelman et al., 1999]
    W. Heinzelman, J. Kulik, and H. Balakrishnan. (1999). Adaptive protocols for information dissemination in wireless sensor networks, In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, August.Google Scholar
  9. [Intanagonwiwat et al., 2000]
    C. Intanagonwiwat, R. Govindan, and D. Estrin. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks, In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM '00), August 2000.Google Scholar
  10. [Zhou et al., 1999]
    L. Zhou and Z. J. Haas. (1999) Securing ad hoc networks, IEEE Networks Magazine, vol. 13, no. 6, pages 24–30, November.CrossRefGoogle Scholar
  11. [Kong et al., 2001]
    J. Kong, P. Zerfos, H. Luo, S. Lu, and L. Zhang. (2001). Providing robust and ubiquitous security support for mobil ad-hoc network, Network Protocols Ninth International Conference on ICNP 2001.Google Scholar
  12. [Luo et al., 2002]
    H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang. (2002). Self-securing ad hoc wireless networks, In Proceedings of Seventh International Symposium on Computers and Communications (ISCC 2002), pages 567–574.Google Scholar
  13. [Hubaux et al., 2001]
    J.-P. Hubaux, L. Buttyan, and S. Capkun. (2001). The quest for security in mobile ad hoc networks, In Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing, October.Google Scholar
  14. [Asokan et al., 2000]
    N. Asokan and P. Ginzborg. (2000). in ad hoc networks, Computer Communications, vol. 23, pages 1627–1637.CrossRefGoogle Scholar
  15. [Yi et al., 2003]
    S. Yi and R. Kravets. (2003). Moca: Mobile certificate authority for wireless ad hoc networks, 2nd Annual PKI Research Workshop Program (PKIO03), April.Google Scholar
  16. [Yi et al., 2002]
    Seung Yi and Robin Kravets. (2002) Key management for heterogeneous ad hoc wireless networks, The 10th IEEE International Conference on Network Protocols (ICNP2002).Google Scholar
  17. [Basagni et al., 2001]
    S. Basagni, K. Herrin, E. Rosti, D. Bruschi, and E. Rosti. (2001). Secure pebblenets, In Proceedings of the 2001 A CM International Symposium on Mobile Ad Hoc Networking and Computing, pages 156–163.Google Scholar
  18. [Carman et al., 2000]
    D. W. Carman, P. S. Kruus, and B. J. Matt. (2000). Constraints and approaches for distributed sensor network security, NAI Labs Technical Report #00-010, September.Google Scholar
  19. [Carman et al., 2002]
    D. W. Carman, B. J. Matt, and G. H. Cirincione. (2002). Energy-efficient and low-latency key management for sensor networks, In Proceedings of 23rd Army Science Conference, December 2002.Google Scholar
  20. [Perrig et al., 2001]
    A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar, Spins: Security protocols for sensor networks, In Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking, July.Google Scholar
  21. [Liu et al., 2003]
    D. Liu and P. Ning. (2003). Efficient distribution of key chain commitments for broadcast authentication in distributed sensor networks, The 10th Annual Network and Distributed System Security Symposium, February.Google Scholar
  22. [Undercoffer et al., 2002]
    J. Undercoffer, S. Avancha, A. Joshi, and J. Pinkston. (2002). Security for sensor networks, 2002 CADIP Research Symposium.Google Scholar
  23. [Eschenauer et at., 2002]
    L. Eschenauer and V. D. Gligor. (2002). A key-management scheme for distributed sensor networks, In Proceedings of the 9th ACM Conference on Computer and Communication Security, pages 41–47, November.Google Scholar
  24. [Chan et al., 2003]
    H. Chan, A. Perrig, and D. Song. (2003). Random key predistribution schemes for sensor networks, IEEE Symposium on Security and Privacy, May.Google Scholar
  25. [Erdoos et al., 1960]
    P. Erdõs and A. Renyi. (1960). On the evolution of random graphs, Publ. Math. Inst. Hungat. Acad. Sci., vol. 5, pages 17–6.Google Scholar
  26. [Spencer, 2000]
    J. Spencer. (2000). The Strange Logic of Random Graphs. Springer-Verlag.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Shih-I Huang
    • 1
  • Shiuhpyng Shieh
    • 1
  • S.Y. Wu
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Chiao Tung UniversityTaiwan

Personalised recommendations