Secure Selective Exclusion in Ad Hoc Wireless Network

A wireless sensor network can be seen as a large number (hundreds of thousand) of small (a few cubic millimetres) devices, battery powered, with very limited hardware resources. Such a network has been studied specifically in the ad hoc model, where the sensors autonomously set up a network infrastructure. We propose here an extension to the current wireless ad hoc sensor network (WSN) model (in particular the base station model), by introducing a Supervisor which has very few interactions with the network, it is mobile in itself, it could have more powerful hardware and it is asynchronous with respect to the sensors. Nevertheless, the Supervisor has to interact with the sensor network, for example to invoke the command to exclude from the network a selected sensor. We believe such a model is particularly suitable for, but not limited to, military applications. We then propose a distributed, cooperative, parallel algorithm for this model that assures the following properties: it enforces both the secure exclusion of a selected compromised sensor from the network and the rekeying of the remaining sensors. It has an overall low overhead both in terms of computation and required transmitted messages. It is scalable, since the algorithm requires only limited, local knowledge of the network topology. Finally, it can be adopted, as an independent layer, to enforce secure exclusion in other models.

[1]  David E. Culler,et al.  SPINS: security protocols for sensor networks , 2001, MobiCom '01.

[2]  Pietro Michiardi,et al.  Security in ad hoc networks , 2003 .

[3]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[4]  David A. Wagner,et al.  Intercepting mobile communications: the insecurity of 802.11 , 2001, MobiCom '01.

[5]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[6]  Alok Aggarwal,et al.  Clustering algorithms for wireless ad hoc networks , 2000, DIALM '00.

[7]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[8]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[9]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[10]  Peter J. Denning,et al.  Fault Tolerant Operating Systems , 1976, CSUR.

[11]  Neil Haller,et al.  The S/KEY One-Time Password System , 1995, RFC.

[12]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Josef Pieprzyk,et al.  Multiparty key agreement protocols , 2000 .

[14]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .