K-terminal reliability in ring networks

Yin, Jiahnsheng; Shin, Changyong

doi:10.1109/24.326432

Cited by 12 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A classical model of network reliability is based on an undirected graph where nodes are perfect and edges operate with equal and independent probability [5], [6]. Generally, in this given model there are three different reliability measures, two-terminal [7], Kterminal [8] and all terminal reliability [9]. But for disconnected network, these three measures are not able to distinguish the difference of reliability very well.…”

Section: Introductionmentioning

confidence: 99%

The Reliability Measure of Disconnected Network Based on Surviving Edges

Meng

Wang

2013

AMR

View full text Add to dashboard Cite

In wireless sensor networks, the disconnected network is an important and special one. Generally, the disconnected network is often characterized as a graph in graph theory. Suppose that edges fail independently of each other with equal probability and nodes are perfect. In this paper, a new reliability measure of disconnected network is proposed and defined as the probability that the edge-induced subgraph induced by surviving edges is connected. Different from traditional all-terminal reliability, this new reliability measure focuses on residual edge connectedness and is able to distinguish the reliability of two disconnected networks which are in the same class. Furthermore, the partial-star S is also proved to be uniformly best disconnected network under our proposed reliability measure in its class.

show abstract