Volume 103, Number 2, July 2013
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||13 August 2013|
k-connectivity for confined random networks
1 Toshiba Telecommunications Research Laboratory - 32 Queens Square, Bristol, BS1 4ND, UK, EU
2 School of Mathematics, University of Bristol - University Walk, Bristol BS8 1TW, UK, EU
3 Department of Electrical and Electronic Engineering, University of Bristol - BS8 1UB, Bristol, UK, EU
Received: 26 March 2013
Accepted: 19 July 2013
k-connectivity is an important measure of network robustness and resilience to random faults and disruptions. We undertake both local and global approaches to k-connectivity and calculate closed-form analytic formulas for the probability that a confined random network remains fully connected after the removal of k − 1 nodes. Our analysis reveals that k-connectivity is governed by microscopic details of the network domain such as sharp corners rather than the macroscopic total volume. Hence, our results can aid in the design of reliable networks, an important problem in, e.g., wireless ad hoc and sensor networks.
PACS: 89.70.Hj – Communication complexity / 89.75.Kd – Patterns / 64.60.aq – Networks
© EPLA, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.