ID 原文 译文
3373 并使用猫群优化算法为簇首搜寻最优路由路径，在平衡簇首负载的同时又不会加剧中继节点负载。 Besides, the catswarm optimization was used to search the optimal routing path for the cluster head to balance the load of the clusterhead without increasing the load of the relay node.
3374 仿真结果表明，与 LEACH 和LEACH-improved 算法相比，POFCA 能有效地平衡网络负载，降低网络能耗，延长网络生命周期。 The simulation result shows that compared with algorithms ofLEACH and LEACH-improved, POFCA can effectively balance the network load, reduce the energy consumption ofnodes and extend the lifetime of the entire network.
3375 针对无线供能反向散射通信系统中信道不确定性以及安全性问题，提出一种考虑系统安全性的稳健机会约束优化算法。 For the channel uncertainty and security problems in wireless powered backscatter communication (WPBC)system, a robust chance-constrained optimization algorithm was proposed.
3376 首先，在考虑窃听数据传输速率约束、最小能量收集约束和设备反射率约束条件下，建立一个基于信道不确定性的最大化系统传输速率最小值的优化问题。 Firstly, an optimization problem was estab-lished to maximize the minimum transmission rate of the system based on channel uncertainty considering eavesdropping data transmission rate constraints, minimum energy collection constraints and device reflectivity constraints.
3377 为求解该问题，应用基于伯恩斯坦型不等式的安全近似方法，将原不确定性问题转换为确定性优化问题。 In order to solve the problem, the original uncertainty problem was transformed into a deterministic optimization problem by usingthe security approximation method based on Bernstein inequality.
3378 然后，结合不等式的性质，引入相应的辅助变量，将确定性优化问题转换为凸优化问题，并利用标准的凸优化算法进行求解。 Then, combining the properties of inequality, the cor-responding auxiliary variables were introduced to transform the deterministic optimization problem into a convex opti-mization problem, and the standard convex optimization algorithm was used to solve the problem.
3379 最后，仿真结果表明了所提算法的有效性。 Finally, the simulation results show the effectiveness of the proposed algorithm.
3380 针对目前关于分层超立方网络的可靠性研究不够系统，严重制约了其应用和推广的问题，以分层超立方网络为研究对象， Aiming at the problem that the reliability research on hierarchical hypercube networks was not yet systematic,which severely restricted its application and popularization, the hierarchical hypercube network was taken as studyingobject,
3381 在得到分层超立方网络相关拓扑性质的基础上，通过理论推导得到了 n 维分层超立方（HHC n ）在 PMC 模型和 MM*模型下的 h−额外条件诊断度和 t/s−诊断度。 on the basis of obtaining the relevant topological properties of the hierarchical hypercube network, the h-extraconditional diagnosability and t/s-diagnosability of the n-dimension hierarchical hypercube (HHC n ) network under thePMC model and MM* model were obtained by theoretical deduction.
3382 此外，设计了 HHC n 在 PMC 模型和 MM*模型下的 t/s−诊断算法，并分析了其时间复杂度。 In addition, the t/s-diagnosis algorithmof HHC n under the PMC model and MM* model was designed and its time complexity was analyzed.