Quantum generative adversarial networks based on a readout error mitigation method with fault tolerant mechanism

Readout errors caused by measurement noise are a significant source of errors in quantum circuits,which severely affect the output results and are an urgent problem to be solved in noisy-intermediate scale quantum(NISQ)computing.In this paper,we use the bit-flip averaging(BFA)method to mitigate frequent readout errors in quantum generative adversarial networks(QGAN)for image generation,which simplifies the response matrix structure by averaging the qubits for each random bit-flip in advance,successfully solving problems with high cost of measurement for traditional error mitigation methods.Our experiments were simulated in Qiskit using the handwritten digit image recognition dataset under the BFA-based method,the Kullback-Leibler(KL)divergence of the generated images converges to 0.04,0.05,and 0.1 for readout error probabilities of p=0.01,p=0.05,and p=0.1,respectively.Additionally,by evaluating the fidelity of the quantum states representing the images,we observe average fidelity values of 0.97,0.96,and 0.95 for the three readout error probabilities,respectively.These results demonstrate the robustness of the model in mitigating readout errors and provide a highly fault tolerant mechanism for image generation models.

Congestion aware routing algorithm for delay-disruption tolerance networks

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

A Fault-Tolerant Mobility-Aware Caching Method in Edge Computing

Mobile Edge Computing(MEC)is a technology designed for the on-demand provisioning of computing and storage services,strategically positioned close to users.In the MEC environment,frequently accessed content can be deployed and cached on edge servers to optimize the efficiency of content delivery,ultimately enhancing the quality of the user experience.However,due to the typical placement of edge devices and nodes at the network’s periphery,these components may face various potential fault tolerance challenges,including network instability,device failures,and resource constraints.Considering the dynamic nature ofMEC,making high-quality content caching decisions for real-time mobile applications,especially those sensitive to latency,by effectively utilizing mobility information,continues to be a significant challenge.In response to this challenge,this paper introduces FT-MAACC,a mobility-aware caching solution grounded in multi-agent deep reinforcement learning and equipped with fault tolerance mechanisms.This approach comprehensively integrates content adaptivity algorithms to evaluate the priority of highly user-adaptive cached content.Furthermore,it relies on collaborative caching strategies based onmulti-agent deep reinforcement learningmodels and establishes a fault-tolerancemodel to ensure the system’s reliability,availability,and persistence.Empirical results unequivocally demonstrate that FTMAACC outperforms its peer methods in cache hit rates and transmission latency.

Energy Based Random Repeat Trust Computation in Delay Tolerant Network

As the use of mobile devices continues to rise,trust administration will significantly improve security in routing the guaranteed quality of service(QoS)supply in Mobile Ad Hoc Networks(MANET)due to the mobility of the nodes.There is no continuance of network communication between nodes in a delay-tolerant network(DTN).DTN is designed to complete recurring connections between nodes.This approach proposes a dynamic source routing protocol(DSR)based on a feed-forward neural network(FFNN)and energybased random repetition trust calculation in DTN.If another node is looking for a node that swerved off of its path in this situation,routing will fail since it won’t recognize it.However,in the suggested strategy,nodes do not stray from their pathways for routing.It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route,based on their pattern of mobility.The EBRRTC-DTN algorithm(Energy based random repeat trust computation)is based on the time that has passed since nodes last encountered the destination node.Compared to other existing techniques,simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node,which improves routing performance,increases the number of delivered messages,and decreases delivery delay.Therefore,the suggested method is better at providing better QoS(Quality of Service)and increasing network lifetime,tolerating network system latency.

Application of Contact Graph Routing in Satellite Delay Tolerant Networks

Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.

Fault Tolerant Control for Networked Control Systems with Packet Loss and Time Delay

In this paper,a fault tolerant control with the consideration of actuator fault for a networked control system （NCS） with packet loss is addressed.The NCS with data packet loss can be described as a switched system model.Packet loss dependent Lyapunov function is used and a fault tolerant controller is proposed respectively for arbitrary packet loss process and Markovian packet loss process.Considering a controlled plant with external energy-bounded disturbance,a robust H ∞ fault tolerant controller is designed for the NCS.These results are also expanded to the NCS with packet loss and networked-induced delay.Numerical examples are given to illustrate the effectiveness of the proposed design method.

Cooperative transmission in delay tolerant network

The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) transmission mode. With this policy, the messages in the DTN are transmitted based on the nodes' cooperation. However, the nodes may be selfish, so the source has to pay certain rewards for others to get their help. This paper studies the optimal incentive policy to maximize the source's final utility. First, it models the message spreading process as several ordinary differential equations(ODEs) based on the meanfield approximation. Then, it mathematically gets the optimal policy and explores the structure of the policy. Finally, it checks the accuracy of the ODEs model and shows the advantages of the optimal policy through simulation and theoretical results respectively.

Data-based Fault Tolerant Control for Affine Nonlinear Systems Through Particle Swarm Optimized Neural Networks

In this paper, a data-based fault tolerant control(FTC) scheme is investigated for unknown continuous-time(CT)affine nonlinear systems with actuator faults. First, a neural network(NN) identifier based on particle swarm optimization(PSO) is constructed to model the unknown system dynamics. By utilizing the estimated system states, the particle swarm optimized critic neural network(PSOCNN) is employed to solve the Hamilton-Jacobi-Bellman equation(HJBE) more efficiently.Then, a data-based FTC scheme, which consists of the NN identifier and the fault compensator, is proposed to achieve actuator fault tolerance. The stability of the closed-loop system under actuator faults is guaranteed by the Lyapunov stability theorem. Finally, simulations are provided to demonstrate the effectiveness of the developed method.

Considerations and Open Issues in Delay Tolerant Network’S (DTNs) Security

Delay Tolerant Network (DTN) addresses challenges of providing end-to-end service where end-to-end data forwarding paths may not exist. Security and privacy are crucial to the wide deployments of DTN. Without security and privacy guarantees, people are reluctant to accept such a new network paradigm. To address the security and privacy issues in DTNs, we in this paper have discussed the various open issues and challenges which need to be addressed to evolve the secure DTNs.

Adaptive clustering hierarchy routing for delay tolerant network

Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.

Fault Tolerant Synchronization for a General Complex DynamicalNetwork with Random Delay

A fault tolerant synchronization strategy is proposed to synchronize a complex network with random time delays and sensor faults. Random time delays over the network transmission are described by using Markov chains. Based on the Lyapunov stability theory and stochastic analysis, several passive fault tolerant synchronization criteria are derived,which can be described in the form of linear matrix inequalities. Finally,a numerical simulation example is carried out and the results show the validity of the proposed fault tolerant synchronization controller.

Fault-Tolerant Control Research for Networked Control System under Communication Constraints

Implementing a control system over a communication network induces inevitable time delays that may degrade performance and even cause instability. One of the most effective ways to reduce the negative effect of delays on the performance of networked control system (NCS) is to reduce network traffic. In this paper, adjustable deadbands are explored as a solution to reduce network traffic in NCS. A method of fault-tolerant control of networked control system is presented, which takes into account system response as well as network traffic. The integrity design for a kind of NCS with sensor failures and actuator failures is analyzed based on robust fault-tolerant control theory and information scheduling. After detailed theoretical analysis, the paper also provides the simulation results, which further validate the proposed scheme.

LanePost:Lane-Based Optimal Routing Protocol for Delay-Tolerant Maritime Networks

Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.

Research on fault-tolerant control of networked control systems based on information scheduling

A kind of networked control system is studied; the networked control system with noise disturbance is modeled based on information scheduling and control co-design. Augmented state matrix analysis method is introduced, and robust fault-tolerant control problem of networked control systems with noise disturbance under actuator failures is studied. The parametric expression of the controller under actuator failures is given. Furthermore, the result is analyzed by simulation tests, which not only satisfies the networked control systems stability, but also decreases the data information number in network channel and makes full use of the network resources.

Research on robust fault-tolerant control for networked control system with packet dropout

A kind of networked control system with network-induced delay and packet dropout, modeled on asynchronous dynamical systems was tested, and the integrity design of the networked control system with sensors failures and actuators failures was analyzed using hybrid systems technique based on the robust fault-tolerant control theory. The parametric expression of controller is given based on the feasible solution of linear matrix inequality. The simulation results are provided on the basis of detailed theoretical analysis, which further demonstrate the validity of the proposed schema.

Node Sociability Based Intelligent Routing for Post-Disaster Emergency Networks

In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.

Design of Distributed Fault-Tolerant Industrial Network

A token-bus-based design method of the distributedfault-tolerant industrial network is presented in this pa-per.The dual-link network is of hot-redundancy.The performance of the network is also discussed.

Fault-tolerant topology in the wireless sensor networks for energy depletion and random failure

Nodes in the wireless sensor networks （WSNs） are prone to failure due to energy depletion and poor environment, which could have a negative impact on the normal operation of the network. In order to solve this problem, in this paper, we build a fault-tolerant topology which can effectively tolerate energy depletion and random failure. Firstly, a comprehensive failure model about energy depletion and random failure is established. Then an improved evolution model is presented to generate a fault-tolerant topology, and the degree distribution of the topology can be adjusted. Finally, the relation between the degree distribution and the topological fault tolerance is analyzed, and the optimal value of evolution model parameter is obtained. Then the target fault-tolerant topology which can effectively tolerate energy depletion and random failure is obtained. The performances of the new fault tolerant topology are verified by simulation experiments. The results show that the new fault tolerant topology effectively prolongs the network lifetime and has strong fault tolerance.

Guaranteed Cost Active Fault-tolerant Control of Networked Control System with Packet Dropout and Transmission Delay

The problem of guaranteed cost active fault-tolerant controller （AFTC） design for networked control systems （NCSs） with both packet dropout and transmission delay is studied in this paper. Considering the packet dropout and transmission delay, a piecewise constant controller is adopted. With a guaranteed cost function, optimal controllers whose number is equal to the number of actuators are designed, and the design process is formulated as a convex optimal problem that can be solved by existing software. The control strategy is proposed as follows： when actuator failures appear, the fault detection and isolation unit sends out the information to the controller choosing strategy, and then the optimal stabilizing controller with the smallest guaranteed cost value is chosen. Two illustrative examples are given to demonstrate the effectiveness of the proposed approach. By comparing with the existing methods, it can be seen that our method has a better performance.