When the spatial networks split?

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider a three dimensional spatial network, where N nodes are randomly distributed within a cube L×L×L. Each two nodes are connected if their mutual distance does not excess a given cutoff a. We analyse numerically the probability distribution of the critical density , where one or more nodes become separated; ρ c is found to increase with N as N 0.105, where N is between 20 and 300. The results can be useful for a design of protocols to control sets of wearable sensors. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Natkaniec, J., & Kułakowski, K. (2008). When the spatial networks split? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5102 LNCS, pp. 545–550). https://doi.org/10.1007/978-3-540-69387-1_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free