Secure pebblenets

  • Authors:
  • Stefano Basagni;Kris Herrin;Danilo Bruschi;Emilia Rosti

  • Affiliations:
  • Department of Computer Science, The University of Texas at Dallas;Department of Computer Science, The University of Texas at Dallas;Dipartimento di Scienze dell'Informazione, Universitàa degli Studi di Milano, Italy;Dipartimento di Scienze dell'Informazione, Universitàa degli Studi di Milano, Italy

  • Venue:
  • MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of securing communication in large ad hoc networks, i.e., wireless networks with no fixed, wired infrastructure and with multi-hop routes. Such networks, e.g., networks of sensors, are deployed for applications such as microsensing, monitoring and control, and for extending the peer-to-peer communication capability of smaller group of network users. Because the nodes of these networks, which we term pebbles for their very limited size and large number, are resource constrained, only symmetric key cryptography is feasible. We propose a key management scheme to periodically update the symmetric keys used by all pebbles. By combining mobility-adaptive clustering and an effective probabilistic selection of the key-generating node, the proposed scheme meets the requirements of efficiency, scalability and security needed for the survivability of networks of pebbles (pebblenets)