The threshold behaviour of the fixed radius random graph model and applications to the key management problem of sensor networks

Authors:
V. Liagkou;E. Makri;P. Spirakis;Y. C. Stamatiou
Affiliations:
,Department of computer Engineering, University of Patras, Rio, Patras, Greece;Department of Mathematics, University of the Aegean, Karlovassi, Samos, Greece;,Department of computer Engineering, University of Patras, Rio, Patras, Greece;,Mathematics Department, Ioannina, Greece
Venue:
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Year:
2006

Citing 2
Cited 1

Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
The Strange Logic of Random Graphs

The Strange Logic of Random Graphs

A Computational Model of Mitigating Disease Spread in Spatial Networks

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the threshold behavior of the fixed radius random graph model and its applications to the key management problem of sensor networks and, generally, for mobile ad-hoc networks. We show that this random graph model can realistically model the placement of nodes within a certain region and their interaction/sensing capabilities (i.e. transmission range, light sensing sensitivity etc.). We also show that this model can be used to define key sets for the network nodes that satisfy a number of good properties, allowing to set up secure communication with each other depending on randomly created sets of keys related to their current location. Our work hopes to inaugurate a study of key management schemes whose properties are related to properties of an appropriate random graph model and, thus, use the rich theory developed in the random graph literature in order to transfer “good” properties of the graph model to the key sets of the nodes.