论文标题
新颖的二进制二元树算法（BAT）二进制网络可靠性问题
Novel Binary-Addition Tree Algorithm (BAT) for Binary-State Network Reliability Problem
论文作者
论文摘要
网络结构和模型已被广泛采用，例如，对于物联网，无线传感器网络，智能电网，运输网络，通信网络，社交网络和计算机网格系统。网络可靠性是一种有效而流行的技术，可以估计网络仍在运行的可能性。由二进制组成的网络（例如工作或失败）组件（弧和/或节点）称为二进制网络。二进制国家网络是网络的基本类型。因此，总是需要更有效的算法来计算网络可靠性。因此，提出了一种用于查找所有可能的状态向量和基于路径的层状搜索算法的新型二元增添树（BAT）算法，以滤除所有连接的向量，以计算二进制网络可靠性。根据时间的复杂性和数值示例，所提出的蝙蝠的效率高于解决二进制算法的传统算法的效率。
Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.
