节点文献
计算无线通信网络2—终点可靠性的快速算法
Rapid Algorithm for Computing ST Reliability of Radio-Communication Networks
【摘要】 提出计算无线通信网络从源点到汇点(ST)可靠性的一个新拓扑公式.该公式中各项和网络的一类特殊子网络一一对应,与相应的Satyanarayanna公式比较,该公式包含更少的项和更少的算术运算.提出一个计算从网络源点到汇点(ST)可靠性算法.这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其ST可靠性或生成可靠性表达式.由于所需枚举的子网络数量小于相应的Satyanarayanna算法需枚举的子网络数量,因此新算法性能优于Satyanarayanna算法.最后通过一个具体例子说明了这个结论.
【Abstract】 A new topological formula for computing ST reliability of radio-communication networks (RCN) from source s to terminal t was presented. The new formula contains terms which correspond one by one to a class special subnetworks. For a given network , terms of the new formula are fewer than those corresponding Satyaranayanna formula .An algorithm for computing ST reliability was presented ,it computed ST reliability or produced a ST reliability expression by enumerating a class of special subnetworks of given networks. Because the number of this class of subnetworks which need to be enumerated was relativity small ,the new algorithm’s performance was better than Satyaranayanna ’s algorithm .Finally an example illustrates our conclusion
【Key words】 algorithm; reliability; reliability expression; inclusion exclusion principle; radio-communication network;
- 【文献出处】 小型微型计算机系统 ,Mini-micro Systems , 编辑部邮箱 ,2005年03期
- 【分类号】TP393
- 【被引频次】9
- 【下载频次】95