【摘要】 提出了无线通信网络(RCN)的K 终点可靠性问题·给出最简树(ST)的概念,提出计算网络从源点(S)到特定终点集(T)的可靠性的一个新拓扑公式·该公式本质上是将容斥原理公式和不交和公式融合在一起,公式中各项和网络的一类特殊子网络一一对应,与相应的Satyanarayanna公式比较,该公式包含更少的项和更少的算术运算,并给出一个算例验证上述结论·更多还原

【Abstract】 The K -terminal reliability problem of radio-communication networks (RCN) w as considered. The concept of the simplest tree( ST ) was presented. A new top ological formula was presented to compute K -terminal reliability of radio- communication networks from sources S to terminal set T . Combining inclu sion-exclusion principle with disjoint sum of products formula, the formula con tains terms corresponding one by one to a class special subnetworks. For a given network, the terms of the formula are fewer than those of the corresponding Sat yanarayanna formula. Finally an example was given to illustrate our conclusion.更多还原