文章基本信息

标题：Secrecy Transfer
本地全文：下载
作者：Zhihong Liu ; Jianfeng Ma ; Yong Zeng 等
期刊名称：International Journal of Distributed Sensor Networks
印刷版ISSN：1550-1329
电子版ISSN：1550-1477
出版年度：2012
卷号：2012
DOI：10.1155/2012/847805
出版社：Hindawi Publishing Corporation
摘要：Suppose that n nodes with 𝑛0 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 𝐺𝑛,𝑛0, a kind of random geometric graph with each edge representing an acquaintanceship between two nodes. We find that components of graph 𝐺𝑛,𝑛0 that undergoes a phase transition from small components to a giant component when 𝑛0 is larger than a threshold, the threshold for 𝐺𝑛,𝑛0 to be a connected graph is derived. In addition, we present its implementation method and applications in wireless sensor networks.