Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

›› 2004, Vol. 30 ›› Issue (03): 38-.

• Papers • Previous Articles     Next Articles

An Algorithm for Computing RCN Reliability with 2 Terminal

GAO Fei,WANG Guangxing   

  1. (Department of Computer, Northeastern University,Shenyang 110003)
  • Published:2004-02-15

一种计算RCN2-终点可靠性的算法

高飞,王光兴   

  1. 东北大学计算机系,东北大学计算机系 沈阳 11000

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.

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

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

CLC Number: