The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks
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.
KeywordsSensor Network Random Graph Network Node Threshold Behaviour Random Graph Model
Unable to display preview. Download preview PDF.
- 1.Abramowitz, M., Stegun, I.E. (eds.): Handbook of Mathematical Functions. U.S. Department of Commerce, National Bureau of Standards, Washington, DC (1972)Google Scholar
- 2.Andrews, G.E.: Number Theory. W.B Saunders Company (1971); Also by Dover Publications (1994)Google Scholar
- 4.Çamtepe, S.A., Yener, B.: Key distribution mechanisms for Wireless Sensor Networks: A Survey. Technical Report TR-05-07, Rensselaer Polytechnic Institute, Computer Science DepartmentGoogle Scholar
- 5.Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: Proceedings of the IEEE Symposium of Privacy and Security, 11–14 May, pp. 197–213 (2003)Google Scholar
- 6.Chan, A.C.-F., Rogers Sr., E.S.: Distributed Symmetric Key Management for Mobile Ad-hoc Networks. In: INFOCOM 2004. 23rd Annual Conference of the IEEE Computer and Communications Societies, pp. 2414–2424 (2004)Google Scholar
- 7.Goel, A., Rai, S., Krishnamachari, B.: Monotone properties of random geometric graphs have sharp thresholds (manuscript)Google Scholar
- 8.Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity. In: Proc. of Conf. on Decision and Control, Tampa, USA (1998)Google Scholar
- 9.Harris, J.W., Stocker, H.: Segment of a Circle, Section 3.8.6. In: Handbook of Mathematics and Computational Science, pp. 92–93. Springer, New York (1999)Google Scholar
- 10.Li, L., Alderson, D., Tanaka, R., Doyle, J., Willinger, W.: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (extended version). Technical Report Technical Report CIT-CDS-04-006, Engineering & Applied Sciences Division California Institute of Technology, USAGoogle Scholar
- 13.Weisstein, E.W.: Circle lattice points. From MathWorld–A Wolfram Web Resource, http://mathworld.wolfram.com/CircleLatticePoints.html