| 计算无线通信网络K-终点可靠性的拓扑公式 |
| |
| 引用本文： | 高飞,王光兴.计算无线通信网络K-终点可靠性的拓扑公式[J].东北大学学报(自然科学版),2003,24(6):535-538. |
| |
| 作者姓名： | 高飞 王光兴 |
| |
| 作者单位： | 东北大学,信息科学与工程学院,辽宁,沈阳,110004 |
| |
| 基金项目： | 国家自然科学基金资助项目(69973011) |
| |
| 摘 要： | 提出了无线通信网络(RCN)的K 终点可靠性问题·给出最简树(ST)的概念,提出计算网络从源点(S)到特定终点集(T)的可靠性的一个新拓扑公式·该公式本质上是将容斥原理公式和不交和公式融合在一起,公式中各项和网络的一类特殊子网络一一对应,与相应的Satyanarayanna公式比较,该公式包含更少的项和更少的算术运算,并给出一个算例验证上述结论·
|
| 关 键 词： | 算法 可靠性 可靠性表达式 容斥原理 无线通信网络 |
| 文章编号： | 1005-3026(2003)06-0535-04 |
| 修稿时间： | 2002年12月17日 |
New Topological Formula for K-Terminal Reliability of Radio-Communication Networks |
| |
| GAO Fei,WANG Guang-xing.New Topological Formula for K-Terminal Reliability of Radio-Communication Networks[J].Journal of Northeastern University(Natural Science),2003,24(6):535-538. |
| |
| Authors: | GAO Fei WANG Guang-xing |
| |
| 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. |
| |
| Keywords: | algorithm reliability reliability expression inclusion-exclusion principle radio-communication network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
