k-connectivity for confined random networks

Orestis Georgiou*, Carl P. Dettmann, Justin P. Coon

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

7 Citations (Scopus)

Abstract

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.
Original languageEnglish
Article number28006
Number of pages6
JournalEPL
Volume103
Issue number2
DOIs
Publication statusPublished - Jul 2013

Bibliographical note

6 pages, 4 figures

Keywords

  • cond-mat.dis-nn
  • cs.DM
  • math-ph
  • math.MP
  • math.PR
  • SENSOR
  • NETWORKS
  • wireless

Fingerprint Dive into the research topics of 'k-connectivity for confined random networks'. Together they form a unique fingerprint.

Cite this