摘要： 提出了无线通信网络(RCN)的2-终点可靠性问题。给出了最简路(SP)和最简路有序根树(SPRT)的概念,介绍了一个找出最简路有序根树和计算RCN2-终点可靠性的有效算法。

关键词: 算法, 可靠性, 无线通信网络

Abstract: The problem of radio-communication networks (RCN) reliability with 2 terminal is considered. The paper presents new concepts of the simplest path(SP) and the simplest path rooted directed tree(SPRT), introduces an algorithm looking for SPRT and computing 2-terminal reliability of RCN.

中图分类号: 

• TN925