Confronted with the requirement of higher efficiency and higher quality of distribution network fault rush-repair, the subject addressed in this paper is the optimal resource dispatching issue of the distribution netw...Confronted with the requirement of higher efficiency and higher quality of distribution network fault rush-repair, the subject addressed in this paper is the optimal resource dispatching issue of the distribution network rush-repair when single resource center cannot meet the emergent resource demands. A multi-resource and multi-center dispatching model is established with the objective of “the shortest repair start-time” and “the least number of the repair centers”. The optimal and worst solutions of each objective are both obtained, and a “proximity degree method” is used to calculate the optimal resource dispatching plan. The feasibility of the proposed algorithm is illustrated by an example of a distribution network fault. The proposed method provides a practical technique for efficiency improvement of fault rush-repair work of distribution network, and thus mostly abbreviates power recovery time and improves the management level of the distribution network.展开更多
Node failure is one of the most severe problems that wireless sensor and actuator networks(WSANs) have to deal with. The failure of actuator nodes, in particular, may result in substantial consequences such as network...Node failure is one of the most severe problems that wireless sensor and actuator networks(WSANs) have to deal with. The failure of actuator nodes, in particular, may result in substantial consequences such as network partitioning, incorrect and incomplete decision execution for WSANs. This paper proposes an efficient localized scheme, called LANTR, to repair the damaged topology of inter-actuator network while single actuator node paralyzes. For the failure of an ordinary actuator node, LANTR can rapidly repair the topology through relocating only one-hop neighbors of the failure node, meanwhile, keep the original topology structure as much as possible. Given the magnitude of cut vertex actuators playing on the connectivity, LANTR designs a novel method for each cut vertex to select out a specific guardian node with the minimum degree or minimum cumulative degree from its neighbors, which can reduce the repair influence on the original topology and effectively reduce the coverage loss rate. The performance of the proposed scheme is evaluated and compared with several existing representative topology repair schemes, and the results indicate that LANTR can more effectively and efficiently repair the topology of inter-actuator networks.展开更多
A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is b...A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.展开更多
A two-stage directed Semi-Markov repairable network system is presented in this paper to model the performance of many transmission systems, such as power or oil transmission network, water or gas supply network, etc....A two-stage directed Semi-Markov repairable network system is presented in this paper to model the performance of many transmission systems, such as power or oil transmission network, water or gas supply network, etc. The availability of the system is discussed by using Markov renewal theory, Laplace transform and probability analysis methods. A numerical example is given to illustrate the results obtained in the paper.展开更多
A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a ra...A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.展开更多
工业数据由于技术故障和人为因素通常导致数据异常,现有基于约束的方法因约束阈值设置的过于宽松或严格会导致修复错误,基于统计的方法因平滑修复机制导致对时间步长较远的异常值修复准确度较低.针对上述问题,提出了基于奖励机制的最小...工业数据由于技术故障和人为因素通常导致数据异常,现有基于约束的方法因约束阈值设置的过于宽松或严格会导致修复错误,基于统计的方法因平滑修复机制导致对时间步长较远的异常值修复准确度较低.针对上述问题,提出了基于奖励机制的最小迭代修复和改进WGAN混合模型的时序数据修复方法.首先,在预处理阶段,保留异常数据,进行信息标注等处理,从而充分挖掘异常值与真实值之间的特征约束.其次,在噪声模块提出了近邻参数裁剪规则,用于修正最小迭代修复公式生成的噪声向量.将其传递至模拟分布模块的生成器中,同时设计了一个动态时间注意力网络层,用于提取时序特征权重并与门控循环单元串联组合捕捉不同步长的特征依赖,并引入递归多步预测原理共同提升模型的表达能力;在判别器中设计了Abnormal and Truth奖励机制和Weighted Mean Square Error损失函数共同反向优化生成器修复数据的细节和质量.最后,在公开数据集和真实数据集上的实验结果表明,该方法的修复准确度与模型稳定性显著优于现有方法.展开更多
文摘Confronted with the requirement of higher efficiency and higher quality of distribution network fault rush-repair, the subject addressed in this paper is the optimal resource dispatching issue of the distribution network rush-repair when single resource center cannot meet the emergent resource demands. A multi-resource and multi-center dispatching model is established with the objective of “the shortest repair start-time” and “the least number of the repair centers”. The optimal and worst solutions of each objective are both obtained, and a “proximity degree method” is used to calculate the optimal resource dispatching plan. The feasibility of the proposed algorithm is illustrated by an example of a distribution network fault. The proposed method provides a practical technique for efficiency improvement of fault rush-repair work of distribution network, and thus mostly abbreviates power recovery time and improves the management level of the distribution network.
基金supported by the National Natural Science Foundation of China (Grant no. 61662042, 61262081, 61462053, and 61462056)partly supported by the Fundamental Research Funds for the Central Universities (Grant no. ZYGX2012J083)the Applied Fundamental Research Project of Yunnan Province (Grant no. 2014FA028)
文摘Node failure is one of the most severe problems that wireless sensor and actuator networks(WSANs) have to deal with. The failure of actuator nodes, in particular, may result in substantial consequences such as network partitioning, incorrect and incomplete decision execution for WSANs. This paper proposes an efficient localized scheme, called LANTR, to repair the damaged topology of inter-actuator network while single actuator node paralyzes. For the failure of an ordinary actuator node, LANTR can rapidly repair the topology through relocating only one-hop neighbors of the failure node, meanwhile, keep the original topology structure as much as possible. Given the magnitude of cut vertex actuators playing on the connectivity, LANTR designs a novel method for each cut vertex to select out a specific guardian node with the minimum degree or minimum cumulative degree from its neighbors, which can reduce the repair influence on the original topology and effectively reduce the coverage loss rate. The performance of the proposed scheme is evaluated and compared with several existing representative topology repair schemes, and the results indicate that LANTR can more effectively and efficiently repair the topology of inter-actuator networks.
文摘A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.
文摘A two-stage directed Semi-Markov repairable network system is presented in this paper to model the performance of many transmission systems, such as power or oil transmission network, water or gas supply network, etc. The availability of the system is discussed by using Markov renewal theory, Laplace transform and probability analysis methods. A numerical example is given to illustrate the results obtained in the paper.
文摘A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.
文摘工业数据由于技术故障和人为因素通常导致数据异常,现有基于约束的方法因约束阈值设置的过于宽松或严格会导致修复错误,基于统计的方法因平滑修复机制导致对时间步长较远的异常值修复准确度较低.针对上述问题,提出了基于奖励机制的最小迭代修复和改进WGAN混合模型的时序数据修复方法.首先,在预处理阶段,保留异常数据,进行信息标注等处理,从而充分挖掘异常值与真实值之间的特征约束.其次,在噪声模块提出了近邻参数裁剪规则,用于修正最小迭代修复公式生成的噪声向量.将其传递至模拟分布模块的生成器中,同时设计了一个动态时间注意力网络层,用于提取时序特征权重并与门控循环单元串联组合捕捉不同步长的特征依赖,并引入递归多步预测原理共同提升模型的表达能力;在判别器中设计了Abnormal and Truth奖励机制和Weighted Mean Square Error损失函数共同反向优化生成器修复数据的细节和质量.最后,在公开数据集和真实数据集上的实验结果表明,该方法的修复准确度与模型稳定性显著优于现有方法.
