Secrecy Transfer

Zhihong Liu, Jianfeng Ma, Yong Zeng, Li Yang and YoungHo Park

International Journal of Distributed Sensor Networks, 2012, vol. 8, issue 7, 847805

Abstract: Suppose that n nodes with n 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 G n , n 0 , a kind of random geometric graph with each edge representing an acquaintanceship between two nodes. We find that components of graph G n , n 0 that undergoes a phase transition from small components to a giant component when n 0 is larger than a threshold, the threshold for G n , n 0 to be a connected graph is derived. In addition, we present its implementation method and applications in wireless sensor networks.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2012/847805 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:8:y:2012:i:7:p:847805

DOI: 10.1155/2012/847805

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().