基于最短生成树的抗攻击节点分裂方法

Node split based on shortest spanning tree against attack

从保证网络拓扑的通信能力出发,基于节点分裂法,着眼于分裂后的每个节点具有较均衡的通信负载为目标,建立了相应的数学模型,并提出了基于最短生成树的近似算法进行求解,对近似算法进行了仿真分析。结果表明,该方法较好地均衡了各分裂后节点的通信负载,能够获得与穷举法相近的结果。该成果对于网络拓扑优化具有一定的借鉴意义。

To ensure the ability of communication network topology,established the corresponding mathematical model based on node split method,focusing on balanced traffic load of each node,and proposed a shortest spanning tree node split algorithm（ SSTNS） . Simulation results show that SSTNS balance the traffic load after node split and can obtain similar results with the exhaustive method.