About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 847805, 12 pages
http://dx.doi.org/10.1155/2012/847805
Research Article

Secrecy Transfer

1School of Computer Science and Technology, Xidian University, Xi’an 710071, China
2Department of Electrical Engineering, Kyungpook National University, Daegu 702-701, Republic of Korea

Received 7 March 2012; Revised 8 June 2012; Accepted 10 June 2012

Academic Editor: Mihui Kim

Copyright © 2012 Zhihong Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Suppose that n nodes with acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at most r, the acquaintanceship between nodes forms a random graph, while the physical communication links constitute a random geometric graph. To get a fully connected and secure network, we introduce secrecy transfer which combines random graph and random geometric graph via the propagation of acquaintanceship to produce an acquaintanceship graph , a kind of random geometric graph with each edge representing an acquaintanceship between two nodes. We find that components of graph that undergoes a phase transition from small components to a giant component when is larger than a threshold, the threshold for to be a connected graph is derived. In addition, we present its implementation method and applications in wireless sensor networks.