Aperiodic Sampled-Data Control of Distributed Networked Control Systems Under Stochastic Cyber-Attacks

This paper examines the stabilization problem of a distributed networked control system under the effect of cyberattacks by employing a hybrid aperiodic triggering mechanism.The cyber-attack considered in the paper is a stochastic deception attack at the sensor-controller end. The probability of the occurrence of attack on a subsystem is represented using a random variable. A decentralized hybrid sampled-data strategy is introduced to save energy consumption and reduce the transmission load of the network. In the proposed decentralized strategy, each subsystem can decide independently whether its state should be transmitted to the controller or not. The scheme of the hybrid triggering mechanism for each subsystem composed of two stages: In the first stage, the next sampling instant is computed using a self-triggering strategy. Subsequently, in the second stage, an event-triggering condition is checked at these sampling instants and the control signal is computed only if the event-triggering condition is violated. The self-triggering condition used in the first stage is dependent on the selection of eventtriggering condition of the second stage. Finally, a comparison of the proposed approach with other triggering mechanisms existing in the literature is presented in terms of the sampling instants,transmission frequency and performance measures through simulation examples.

A Filter-Based Uniform Algorithm for Optimizing Top-k Query in Distributed Networks

In this paper we propose a Filter-based Uniform Algorithm （FbUA） for optimizing top-κ query in distributed networks, which has been a topic of much recent interest. The basic idea of FhUA is to set a filter at each node to pre vent it from sending out the data with little chance to contrib ute to the top-κ result. FbUA can gain exact answers to top-κ query through two phrases of round trip communications between query station and participant nodes. The experiment results show that FbUA reduces network bandwidth consumption dramatically.

Research on Application Technology Oriented Rapid Response Manufacturing in the Distributed Network Environment

A new chance of developing traditional manufacturing industry comes forth with the development of network technology. Application technology oriented rapid response manufacturing in the distributed network environments, that is, how to take advantage of the Intranet and Internet, combine the numerous manufacturing resources spread around the region, the country and even the globe is the key to the agile design, manufacturing and the buildup of comprehensively competitive power, at the same time, is also an important research direction in the field of advanced manufacturing technology. Rapid response manufacturing in the distributed network environment is a newly manufactory pattern that can be used to implement the conception of agile design and manufacturing, but there are some new problems coming with it, which will directly influence the enterprise’s ability of rapid response in the distributed network manufacturing pattern and lead to the failure of the league and the lost of the given orders. In this paper, we establish some approaches to solve these problems in product development process. The paper then presents the research on key application technologies and solutions includes: network safety strategy which guarantees data transferring among the leaguer members, production data management based on Web/DOT (Distributed Object Technology) and XML criteria which guarantees data exchange in structure-variance characteristic environments, the network platform which provides the conversion service of different types of CAD files each other. All of these solutions are aim for technology problems existing in the distributed network environments and among the league members. Finally, the paper takes one project, that is, the establishment of the online application service system for Shanghai Advance Manufacturing Technology Research Center as a good instance.

A scalable, locality aware, fault-tolerant, and decentralized location scheme for distributed networks

This paper presents Isotope, an efficient, locality aware, fault-tolerant, and decentralized scheme for data location in distributed networks. This scheme is designed based on the mathematical model of decentralized location services and thus has provable correctness and performance. In Isotope, each node needs to only maintain linkage information with about O(log n) other nodes and any node can be reached within O(log n) routing hops. Compared with other related schemes, Isotope’s average locating path length is only half that of Chord, and its locating performance and locality-awareness are similar to that of Pastry and Tapestry. In addition, Isotope is more suitable for constantly changing networks because it needs to exchange only O(log n) O(log n) messages to update the routing information for nodes arrival, departure and failure.

Resilience approach for heterogeneous distributed networked unmanned weapon systems

Disconnection in the distributed heterogeneous networked unmanned weapon systems is caused by multiple weapon units＇ failure. The technical routes were analyzed to achieve resilience in the disconnection situation. A heterogeneous distributed network model of networked unmanned weapon systems was established. And an approach of adding relay weapon units was proposed to a- chieve fault tolerance after weapon units＇ failure due to attack or energy exhaustion. An improved ge- netic algorithm was proposed to determine and optimize the position of the relay weapon units. Simulation results in the MATLAB show that the improved resilience-based genetic algorithm can restore the network connection maximally when the number of relay units is limited, the network can keep on working after failure, and the implementation cost is controlled in a reasonable range.

A Survey on Distributed Network Localization from a Graph Laplacian Perspective

Network localization serves as a fundamental component for enabling various position based operations in multi-agent systems,facilitating tasks like target searching and formation control by providing accurate position information for all nodes in the network.Network localization focuses on the challenge of determining the positions of nodes within a network,relying on the known positions of anchor nodes and internode relative measurements.Over the past few decades,distributed network localization has garnered significant attention from researchers.This paper aims to provide a review of main results and advancements in the field of distributed network localization,with a particular focus on the perspective of graph Laplacian.Owning to its favorable characteristics,graph Laplacian unifies various network localization,even when dealing with diverse types of internode relative measurements,into a unified protocol framework,which can be constructed by a linear method and ensure the global convergence.

Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation

With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.

A Distributed Photovoltaics Ordering Grid-Connected Method for Analyzing Voltage Impact in Radial Distribution Networks

In recent years,distributed photovoltaics(DPV)has ushered in a good development situation due to the advantages of pollution-free power generation,full utilization of the ground or roof of the installation site,and balancing a large number of loads nearby.However,under the background of a large-scale DPV grid-connected to the county distribution network,an effective analysis method is needed to analyze its impact on the voltage of the distribution network in the early development stage of DPV.Therefore,a DPV orderly grid-connected method based on photovoltaics grid-connected order degree(PGOD)is proposed.This method aims to orderly analyze the change of voltage in the distribution network when large-scale DPV will be connected.Firstly,based on the voltagemagnitude sensitivity(VMS)index of the photovoltaics permitted grid-connected node and the acceptance of grid-connected node(AoGCN)index of other nodes in the network,thePGODindex is constructed to determine the photovoltaics permitted grid-connected node of the current photovoltaics grid-connected state network.Secondly,a photovoltaics orderly grid-connected model with a continuous updating state is constructed to obtain an orderly DPV grid-connected order.The simulation results illustrate that the photovoltaics grid-connected order determined by this method based on PGOD can effectively analyze the voltage impact of large-scale photovoltaics grid-connected,and explore the internal factors and characteristics of the impact.

Research on Scheduling Strategy of Flexible Interconnection Distribution Network Considering Distributed Photovoltaic and Hydrogen Energy Storage

Distributed photovoltaic(PV)is one of the important power sources for building a new power system with new energy as the main body.The rapid development of distributed PV has brought new challenges to the operation of distribution networks.In order to improve the absorption ability of large-scale distributed PV access to the distribution network,the AC/DC hybrid distribution network is constructed based on flexible interconnection technology,and a coordinated scheduling strategy model of hydrogen energy storage(HS)and distributed PV is established.Firstly,the mathematical model of distributed PV and HS system is established,and a comprehensive energy storage system combining seasonal hydrogen energy storage(SHS)and battery(BT)is proposed.Then,a flexible interconnected distribution network scheduling optimization model is established to minimize the total active power loss,voltage deviation and system operating cost.Finally,simulation analysis is carried out on the improved IEEE33 node,the NSGA-II algorithm is used to solve specific examples,and the optimal scheduling results of the comprehensive economy and power quality of the distribution network are obtained.Compared with the method that does not consider HS and flexible interconnection technology,the network loss and voltage deviation of this method are lower,and the total system cost can be reduced by 3.55%,which verifies the effectiveness of the proposed method.

An Algorithm for Short-Circuit Current Interval in Distribution Networks with Inverter Type Distributed Generation Based on Affine Arithmetic

During faults in a distribution network,the output power of a distributed generation(DG)may be uncertain.Moreover,the output currents of distributed power sources are also affected by the output power,resulting in uncertainties in the calculation of the short-circuit current at the time of a fault.Additionally,the impacts of such uncertainties around short-circuit currents will increase with the increase of distributed power sources.Thus,it is very important to develop a method for calculating the short-circuit current while considering the uncertainties in a distribution network.In this study,an affine arithmetic algorithm for calculating short-circuit current intervals in distribution networks with distributed power sources while considering power fluctuations is presented.The proposed algorithm includes two stages.In the first stage,normal operations are considered to establish a conservative interval affine optimization model of injection currents in distributed power sources.Constrained by the fluctuation range of distributed generation power at the moment of fault occurrence,the model can then be used to solve for the fluctuation range of injected current amplitudes in distributed power sources.The second stage is implemented after a malfunction occurs.In this stage,an affine optimization model is first established.This model is developed to characterizes the short-circuit current interval of a transmission line,and is constrained by the fluctuation range of the injected current amplitude of DG during normal operations.Finally,the range of the short-circuit current amplitudes of distribution network lines after a short-circuit fault occurs is predicted.The algorithm proposed in this article obtains an interval range containing accurate results through interval operation.Compared with traditional point value calculation methods,interval calculation methods can provide more reliable analysis and calculation results.The range of short-circuit current amplitude obtained by this algorithm is slightly larger than those obtained using the Monte Carlo algorithm and the Latin hypercube sampling algorithm.Therefore,the proposed algorithm has good suitability and does not require iterative calculations,resulting in a significant improvement in computational speed compared to the Monte Carlo algorithm and the Latin hypercube sampling algorithm.Furthermore,the proposed algorithm can provide more reliable analysis and calculation results,improving the safety and stability of power systems.

Distributed Nash Equilibrium Seeking for General Networked Games With Bounded Disturbances

This paper is concerned with anti-disturbance Nash equilibrium seeking for games with partial information.First,reduced-order disturbance observer-based algorithms are proposed to achieve Nash equilibrium seeking for games with firstorder and second-order players,respectively.In the developed algorithms,the observed disturbance values are included in control signals to eliminate the influence of disturbances,based on which a gradient-like optimization method is implemented for each player.Second,a signum function based distributed algorithm is proposed to attenuate disturbances for games with secondorder integrator-type players.To be more specific,a signum function is involved in the proposed seeking strategy to dominate disturbances,based on which the feedback of the velocity-like states and the gradients of the functions associated with players achieves stabilization of system dynamics and optimization of players'objective functions.Through Lyapunov stability analysis,it is proven that the players'actions can approach a small region around the Nash equilibrium by utilizing disturbance observerbased strategies with appropriate control gains.Moreover,exponential(asymptotic)convergence can be achieved when the signum function based control strategy(with an adaptive control gain)is employed.The performance of the proposed algorithms is tested by utilizing an integrated simulation platform of virtual robot experimentation platform(V-REP)and MATLAB.

A Jury-Based Trust Management Mechanism in Distributed Cognitive Radio Networks

In the trust management scheme of the distributed cognitive radio networks, the absence of the central control devices cause many problems such as a lack of standardized control for trust computation, and the absence of the decision makers in trust evaluation and collaborative decision making. A trust management mechanism based on the jury system for distributed cognitive radio networks is proposed in this paper. The "jury user" is designed to collaboratively examine the reputation of the cognitive user in the networks and to perform data fusion and spectrum allocation for distributed cognitive radio networks. Simulation analysis results show that the proposed scheme can ensure accuracy and fairness in trust evaluation and improve effectiveness and flexibility of spectrum allocation.

A matrix grammar approach for automatic distributed network resource management

Network resource management is critical to ensure the security and optimal performance of distributed networks and information systems. Existing technologies are not capable of managing large-scale network resources because of a lack of reusability and scalability. This paper presents a matrix grammar approach for automatic distributed network resource management to alleviate these problems. A matrix grammar is proposed using WMI, CIM, and SNMP to manage network resources, and provides a generic mechanism to describe what needs to be managed and how to manage it. A scalable distributed multi-agent architecture for automatic network resource management is proposed, at its core lies a management automation engine consisting of a matrix analyzer and a recipe processor. The proposed solution has been implemented in software and applied in industrial products that achieve good technical and industrial results. It has good extensibility, scalability, ment automation and software and enables network managereusability.

Developing Environment of Hierarchical and Distributed Real-Time Fire-Control Network

This paper introduces a hierarchical real-time environment for developing ship-bornefire-control system. Advanced computer networks are used to simulate the system with the requiredengagement scenario, including own-ship and parameters, and data processing and transmission,mission calculation, graphical supervision and gunnery ballistics outputting. The simulation systemis able to receive instruction from, or send information to the command-control center. Furthermore,the system can also be used to compare various designed schemes and analyze the accuracy andeffectiveness of the system.

Data-Driven Control of Distributed Event-Triggered Network Systems

The present paper deals with data-driven event-triggered control of a class of unknown discrete-time interconnected systems(a.k.a.network systems).To this end,we start by putting forth a novel distributed event-triggering transmission strategy based on periodic sampling,under which a model-based stability criterion for the closed-loop network system is derived,by leveraging a discrete-time looped-functional approach.Marrying the model-based criterion with a data-driven system representation recently developed in the literature,a purely data-driven stability criterion expressed in the form of linear matrix inequalities(LMIs)is established.Meanwhile,the data-driven stability criterion suggests a means for co-designing the event-triggering coefficient matrix and the feedback control gain matrix using only some offline collected state-input data.Finally,numerical results corroborate the efficacy of the proposed distributed data-driven event-triggered network system(ETS)in cutting off data transmissions and the co-design procedure.

Distributed wireless quantum communication networks with partially entangled pairs

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.

Application Research and Implementation of the CORBA-Based Web Distributed Network Management System

The distributed management has become an important tendency of development for the NMS (Network Management System) with the development of Internet. Based on the analysis of CORBA (Conmon Object Request Broker Architecture) technique, we mainly discuss about the applicability of the approach by which CORBA combined with Java has been applied to the system model and Web architecture: and address the applied frame and the interface definitions that are the, key technologies for implementing the Distributed Object Computing (DOC). In addition, we also conduct the research on its advantages and disadvantages and further expected improvements. Key words distributed Web network management - CORBA - Java CLC number TP 393.07 Foundation item: Supported by the QTNG (Integrated Network Management System) Project Foundation and QT-NMS (SDH NMS) Project Foundation of Wuhan Qingtian Information Industry Co., LTD of Hubei of China (SDH.001)Biography: WANG Feng (1979-), male Master candidate, research direction: administration of network and software engineering.

Fault location method for petal-shaped distribution network with inverter-interfaced distributed generators

In this paper,a fault location method for the petal-shaped distribution network(PSDN)with inverter-interfaced distributed generators(IIDGs)is proposed to shorten the time of manual inspection.In order to calculate the fault position,the closed-loop structure of the PSDN is skillfully exploited,and the common control strategies of IIDGs are considered.For asymmetrical faults,a fault line identification formula based on the negative-sequence current phase differences is presented,and a fault location formula only utilizing the negative-sequence current amplitudes is derived to calculated the fault position.For symmetrical faults,the positive-sequence current at both ends of lines and the current output from IIDGs are used to identify the fault line,and the positive-sequence current on multiple lines are used to pinpoint the fault position.In this method,corresponding current phasors are separated into amplitudes and phases to satisfy the limitation of communication level.The simulation results show that the error is generally less than 1%,and the accuracy of the proposed method is not affected by the fault type,fault position,fault resistance,load current,and the IIDG penetration.

Distributed wireless quantum communication networks

The distributed wireless quantum communication network （DWQCN） ha~ a distributed network topology and trans- mits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum tele- portation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entan- glement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay.

Operation Control Method of Relay Protection in Flexible DC Distribution Network Compatible with Distributed Power Supply

A novel operation control method for relay protection in flexible DC distribution networks with distributed power supply is proposed to address the issue of inaccurate fault location during relay protection,leading to poor performance.The method combines a fault-tolerant fault location method based on long-term and short-term memory networks to accurately locate the fault section.Then,an operation control method for relay protection based on adaptive weight and whale optimization algorithm(WOA)is used to construct an objective function considering the shortest relay protection action time and the smallest impulse current.The adaptive weight and WOA are employed to obtain the optimal strategy for relay protection operation control,reducing the action time and impulse current.Experimental results demonstrate the effectiveness of the proposed method in accurately locating faults and improving relay protection performance.The longest operation time is reduced by 4.7023 s,and the maximum impulse current is limited to 0.3 A,effectively controlling the impact of large impulse currents and enhancing control efficiency.