Completely independent spanning trees for enhancing the robustness in ad-hoc Networks

Abstract

Abstract-We investigate the problem of computing Completely Independent Spanning Trees (CIST) under a practical approach. We aim to show that despite CISTs are very challenging to exhibit in some networks, they present a real interest in ad-hoc networks and can be computed to enhance the network robustness. We propose an original ILP formulation for CISTs and we show through simulation results on representative network models that several CISTs can be computed when the network density is sufficiently high. These results tend to reinforce the interest of CISTs for various network operations such as robustness, load-balancing, traffic splitting, . . . As an important point, our results show that both the density and the number of nodes have an impact on the number of CISTs that can be found on ad-hoc networks.

Analysis of Temporal Robustness in Massive Machine Type Communications

“…The earliest works exploit graph topology for quantifying the network robustness, namely, the vertex (edge) connectivity [11], heterogeneity [12], clustering coefficient [13], closeness [14], betweenness [14], diameter [15], algebraic connectivity [16], network criticality [17], effective graph resistance [18], number of spanning trees [19], largest subgraph [20], etc. Later works introduce some advanced metrics of network robustness, like, toughness [21], scattering number [22], tenacity [23], which quantify both the cost of damage and the degree of impairment in networks [24].…”