Aimed at the difficulties in accurately, comprehensively and systematically evaluating the reliability of industrial wireless sensor networks （WSNs）, a time-evolving state transition-Monte Carlo （TEST-MC） evaluati...Aimed at the difficulties in accurately, comprehensively and systematically evaluating the reliability of industrial wireless sensor networks （WSNs）, a time-evolving state transition-Monte Carlo （TEST-MC） evaluation method and a novel network function value representation method are proposed to evaluate the reliability of the IWSNs. First, the adjacency matrix method is used to characterize three typical topologies of WSNs including the mesh network, tree network and ribbon network. Secondly, the network function value method is used to evaluate the network connectivity, and the TEST-MC evaluation method is used to evaluate network reliability and availability. Finally, the variations in the reliability, connectivity and availability of these three topologies are presented. Simulation results show that the proposed method can quickly analyze the reliability of the networks containing typical WSN topologies, which provides an effective method for the comprehensive and accurate evaluation of the reliability of WSNs.展开更多
In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic i...In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.展开更多
Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks. However, for this hypervisor plane, how to map ...Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks. However, for this hypervisor plane, how to map a virtual network to the physical substrate while guaranteeing the survivability in the event of failures, is extremely important. In this paper, we present an efficient virtual network mapping approach using optimal backup topology to survive a single link failure with less resource consumption. Firstly, according to whether the path splitting is supported by virtual networks, we propose the OBT-I and OBT-II algorithms respectively to generate an optimal backup topology which minimizes the total amount of bandwidth constraints. Secondly, we propose a Virtual Network Mapping algorithm with coordinated Primary and Backup Topology （VNM-PBT） to make the best of the substrate network resource. The simulation experiments show that our proposed approach can reduce the average resource consumption and execution time cost, while improving the request acceptance ratio of VNs.展开更多
A novel methodology is presented for simultaneously optimizing synthesis and cleaning schedule of flexible heat exchanger network(HEN)by genetic/simulated annealing algorithms(GA/SA).Through taking into account the ef...A novel methodology is presented for simultaneously optimizing synthesis and cleaning schedule of flexible heat exchanger network(HEN)by genetic/simulated annealing algorithms(GA/SA).Through taking into account the effect of fouling process on optimal network topology,a preliminary network structure possessing two-fold oversynthesis is obtained by means of pseudo-temperature enthalpy(T-H)diagram approach prior to simultaneous optimization.Thus,the computational complexity of this problem classified as NP(Non-deterministic Polynomial)-complete can be significantly reduced.The promising matches resulting from preliminary synthesis stage are further optimized in parallel with their heat exchange areas and cleaning schedule.In addition,a novel continu- ous time representation is introduced to subdivide the given time horizon into several variable-size intervals according to operating periods of heat exchangers,and then flexible HEN synthesis can be implemented in dynamic manner.A numerical example is provided to demonstrate that the presented strategy is feasible to decrease the total annual cost(TAC)and further improve network flexibility,but even more important,it may be applied to solve large-scale flexible HEN synthesis problems.展开更多
基金The International S&T Cooperation Program of China(No.2015DFA10490)the National Natural Science Foundation of China(No.61571113,61240032)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20130092110060)
文摘Aimed at the difficulties in accurately, comprehensively and systematically evaluating the reliability of industrial wireless sensor networks （WSNs）, a time-evolving state transition-Monte Carlo （TEST-MC） evaluation method and a novel network function value representation method are proposed to evaluate the reliability of the IWSNs. First, the adjacency matrix method is used to characterize three typical topologies of WSNs including the mesh network, tree network and ribbon network. Secondly, the network function value method is used to evaluate the network connectivity, and the TEST-MC evaluation method is used to evaluate network reliability and availability. Finally, the variations in the reliability, connectivity and availability of these three topologies are presented. Simulation results show that the proposed method can quickly analyze the reliability of the networks containing typical WSN topologies, which provides an effective method for the comprehensive and accurate evaluation of the reliability of WSNs.
基金The National Key Technology R& D Program of Chinaduring the 11th Five-Year Plan Period (No.2006BAJ18B03).
文摘In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.
基金This research was sponsored by the National Basic Research Program （973 program） of China （2012CB315901, 2013C8329104）, the National Natural Science Foundation of China （61372121, 61309020）, and the National High-Tech Research and Development Program （863 Program） of Chi- na （2011AA01A103, 201 1AA01A101, 2013AA013505）.
文摘Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks. However, for this hypervisor plane, how to map a virtual network to the physical substrate while guaranteeing the survivability in the event of failures, is extremely important. In this paper, we present an efficient virtual network mapping approach using optimal backup topology to survive a single link failure with less resource consumption. Firstly, according to whether the path splitting is supported by virtual networks, we propose the OBT-I and OBT-II algorithms respectively to generate an optimal backup topology which minimizes the total amount of bandwidth constraints. Secondly, we propose a Virtual Network Mapping algorithm with coordinated Primary and Backup Topology （VNM-PBT） to make the best of the substrate network resource. The simulation experiments show that our proposed approach can reduce the average resource consumption and execution time cost, while improving the request acceptance ratio of VNs.
基金Supported by the National Natural Science Foundation of China （20976022） and Dalian University of Technology for Constructing Interdiscipline ＇Energy＋X＇. ACKNOWLEDGEMENTS The authors gratefully acknowledge financial support from Lanzhou Petrochemical Company, PetroChina Company Limited.
文摘A novel methodology is presented for simultaneously optimizing synthesis and cleaning schedule of flexible heat exchanger network(HEN)by genetic/simulated annealing algorithms(GA/SA).Through taking into account the effect of fouling process on optimal network topology,a preliminary network structure possessing two-fold oversynthesis is obtained by means of pseudo-temperature enthalpy(T-H)diagram approach prior to simultaneous optimization.Thus,the computational complexity of this problem classified as NP(Non-deterministic Polynomial)-complete can be significantly reduced.The promising matches resulting from preliminary synthesis stage are further optimized in parallel with their heat exchange areas and cleaning schedule.In addition,a novel continu- ous time representation is introduced to subdivide the given time horizon into several variable-size intervals according to operating periods of heat exchangers,and then flexible HEN synthesis can be implemented in dynamic manner.A numerical example is provided to demonstrate that the presented strategy is feasible to decrease the total annual cost(TAC)and further improve network flexibility,but even more important,it may be applied to solve large-scale flexible HEN synthesis problems.
