<abstract xmlns="http://www.w3.org/1999/xhtml"><p>Suppose n nodes with n0 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 form a random graph, while the physical communication links constitute a random geometric graph. To get a fully connected and secure graph, we introduce a secrecy transfer algorithm which combines the random graph and the random geometric graph via an introduction process to produce an acquaintanceship graph Gn,n0. We find that the maximum component of graph Gn,n0 transitions rapidly from small components to a giant component when n0 is larger than a threshold, the threshold is derived, and applications for sensor networks are presented.</p></abstract>

Suppose n nodes with n0 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 form a random graph, while the physical communication links constitute a random geometric graph. To get a fully connected and secure graph, we introduce a secrecy transfer algorithm which combines the random graph and the random geometric graph via an introduction process to produce an acquaintanceship graph Gn,n0. We find that the maximum component of graph Gn,n0 transitions rapidly from small components to a giant component when n0 is larger than a threshold, the threshold is derived, and applications for sensor networks are presented.

Secrecy Transfer for Sensor Networks: From Random Graphs to Secure Random Geometric Graphs

International Journal on Smart Sensing and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Suppose n nodes with n0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of...

Secrecy Transfer for Sensor Networks: From Random Graphs to Secure Random Geometric Graphs

Publié en ligne: 20 févr. 2013

Pages: 77 - 94

Reçu: 02 oct. 2012

Accepté: 06 janv. 2013

DOI: https://doi.org/10.21307/ijssis-2017-529

Mots clés
Random graph, Random geometric graph, Sensor networks, Security

© 2013 Zhihong Liu et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Secrecy Transfer for Sensor Networks: From Random Graphs to Secure Random Geometric Graphs

Publié en ligne: 20 févr. 2013

Pages: 77 - 94

Reçu: 02 oct. 2012

Accepté: 06 janv. 2013

DOI: https://doi.org/10.21307/ijssis-2017-529

Mots clésRandom graph, Random geometric graph, Sensor networks, Security

© 2013 Zhihong Liu et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Mots clés
Random graph, Random geometric graph, Sensor networks, Security