Distributed event region fault-tolerance based on weighted distance for wireless sensor networks

Event region detection is the important application for wireless sensor networks（WSNs）, where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance（DFWD） is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.

Hybrid DF and SIR Forwarding Strategy in Conventional and Distributed Alamouti Space-Time Coded Cooperative Networks

In this paper,we propose a hybrid decode-and-forward and soft information relaying(HDFSIR)strategy to mitigate error propagation in coded cooperative communications.In the HDFSIR approach,the relay operates in decode-and-forward(DF)mode when it successfully decodes the received message;otherwise,it switches to soft information relaying(SIR)mode.The benefits of the DF and SIR forwarding strategies are combined to achieve better performance than deploying the DF or SIR strategy alone.Closed-form expressions for the outage probability and symbol error rate(SER)are derived for coded cooperative communication with HDFSIR and energy-harvesting relays.Additionally,we introduce a novel normalized log-likelihood-ratio based soft estimation symbol(NL-SES)mapping technique,which enhances soft symbol accuracy for higher-order modulation,and propose a model characterizing the relationship between the estimated complex soft symbol and the actual high-order modulated symbol.Further-more,the hybrid DF-SIR strategy is extended to a distributed Alamouti space-time-coded cooperative network.To evaluate the~performance of the proposed HDFSIR strategy,we implement extensive Monte Carlo simulations under varying channel conditions.Results demonstrate significant improvements with the hybrid technique outperforming individual DF and SIR strategies in both conventional and distributed Alamouti space-time coded cooperative networks.Moreover,at a SER of 10^(-3),the proposed NL-SES mapping demonstrated a 3.5 dB performance gain over the conventional averaging one,highlighting its superior accuracy in estimating soft symbols for quadrature phase-shift keying modulation.

Distributed fuzzy fault-tolerant consensus of leader-follower multi-agent systems with mismatched uncertainties

In this paper,the distributed fuzzy fault-tolerant tracking consensus problem of leader-follower multi-agent systems(MASs)is studied.The objective system includes actuator faults,mismatched parameter uncertainties,nonlinear functions,and exogenous disturbances under switching communication topologies.To solve this problem,a distributed fuzzy fault-tolerant controller is proposed for each follower by adaptive mechanisms to track the state of the leader.Furthermore,the fuzzy logic system is utilized to approximate the unknown nonlinear dynamics.An error estimator is introduced between the mismatched parameter matrix and the input matrix.Then,a selective adaptive law with relative state information is adopted and applied.When calculating the Lyapunov function’s derivative,the coupling terms related to consensus error and mismatched parameter uncertainties can be eliminated.Finally,a numerical simulation is given to validate the effectiveness of the proposed protocol.

Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

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.

Sparse Adversarial Learning for FDIA Attack Sample Generation in Distributed Smart

False data injection attack(FDIA)is an attack that affects the stability of grid cyber-physical system(GCPS)by evading the detecting mechanism of bad data.Existing FDIA detection methods usually employ complex neural networkmodels to detect FDIA attacks.However,they overlook the fact that FDIA attack samples at public-private network edges are extremely sparse,making it difficult for neural network models to obtain sufficient samples to construct a robust detection model.To address this problem,this paper designs an efficient sample generative adversarial model of FDIA attack in public-private network edge,which can effectively bypass the detectionmodel to threaten the power grid system.A generative adversarial network(GAN)framework is first constructed by combining residual networks(ResNet)with fully connected networks(FCN).Then,a sparse adversarial learning model is built by integrating the time-aligned data and normal data,which is used to learn the distribution characteristics between normal data and attack data through iterative confrontation.Furthermore,we introduce a Gaussian hybrid distributionmatrix by aggregating the network structure of attack data characteristics and normal data characteristics,which can connect and calculate FDIA data with normal characteristics.Finally,efficient FDIA attack samples can be sequentially generated through interactive adversarial learning.Extensive simulation experiments are conducted with IEEE 14-bus and IEEE 118-bus system data,and the results demonstrate that the generated attack samples of the proposed model can present superior performance compared to state-of-the-art models in terms of attack strength,robustness,and covert capability.

Fuzzy Adaptive State Estimation of Distributed Drive Electric Vehicles with Random Missing Measurements and Unknown Process Noise

Accurate estimation of sideslip angle and vehicle velocity is crucial for effective control of distributed drive electric vehicles.However,as these states are not directly measured,Kalman-based approaches utilizing in-vehicle sensors have been developed to estimate them.Unfortunately,existing methods tend to ignore the impact of data loss on estimation performance.Furthermore,the process noise,which changes dynamically due to varying driving conditions,is not adequately considered.In response to these constraints,we propose a novel method called the fuzzy adaptive fault-tolerant extended Kalman filter(FAFTEKF).Initially,a fault-tolerant EKF is devised to handle missing measurements.Additionally,a fuzzy logic system that dynamically updates the process noise matrix,is built to improve estimation accuracy under different driving conditions.Extensive experimental results validate the superiority of the FAFTEKF over the traditional EKF across various scenarios with different degrees of data loss.

Distributed Fault-Tolerant Containment Control for Nonlinear Multi-Agent Systems Under Directed Network Topology via Hierarchical Approach

This paper investigates the distributed fault-tolerant containment control(FTCC)problem of nonlinear multi-agent systems(MASs)under a directed network topology.The proposed control framework which is independent on the global information about the communication topology consists of two layers.Different from most existing distributed fault-tolerant control(FTC)protocols where the fault in one agent may propagate over network,the developed control method can eliminate the phenomenon of fault propagation.Based on the hierarchical control strategy,the FTCC problem with a directed graph can be simplified to the distributed containment control of the upper layer and the fault-tolerant tracking control of the lower layer.Finally,simulation results are given to demonstrate the effectiveness of the proposed control protocol.

Monitoring Surface Deformation Using Distributed Scatterers InSAR

In the past two decades,extensive and in-depth research has been conducted on Time Series InSAR technology with the advancement of high-performance SAR satellites and the accumulation of big SAR data.The introduction of distributed scatterers in Distributed Scatterers InSAR(DS-InSAR)has significantly expanded the application scenarios of InSAR geodetic measurement by increasing the number of measurement points.This study traces the history of DS-InSAR,presents the definition and characteristics of distributed scatterers,and focuses on exploring the relationships and distinctions among proposed algorithms in two crucial steps:statistically homogeneous pixel selection and phase optimization.Additionally,the latest research progress in this field is tracked and the possible development direction in the future is discussed.Through simulation experiments and two real InSAR case studies,the proposed algorithms are compared and verified,and the advantages of DS-InSAR in deformation measurement practice are demonstrated.This work not only offers insights into current trends and focal points for theoretical research on DS-InSAR but also provides practical cases and guidance for applied research.

Distributed Adaptive Fault-Tolerant Output Regulation of Heterogeneous Multi-Agent Systems With Coupling Uncertainties and Actuator Faults

In this paper, we consider the distributed adaptive fault-tolerant output regulation problem for heterogeneous multiagent systems with matched system uncertainties and mismatched coupling uncertainties among subsystems under the influence of actuator faults. First, distributed finite-time observers are proposed for all subsystems to observe the state of the exosystem. Then, a novel fault-tolerant controller is designed to compensate for the influence of matched system uncertainties and actuator faults. By using the linear matrix inequality technique, a sufficient condition is provided to guarantee the solvability of the considered problem in the presence of mismatched coupling uncertainties. Moreover, it is shown that the system in closed-loop with the developed controller can achieve output regulation by using the Lyapunov stability theory and cyclic-small-gain theory.Finally, a numerical example is given to illustrate the effectiveness of the obtained result.

A Novel Defender-Attacker-Defender Model for Resilient Distributed Generator Planning with Network Reconfiguration and Demand Response

To improve the resilience of a distribution system against extreme weather,a fuel-based distributed generator(DG)allocation model is proposed in this study.In this model,the DGs are placed at the planning stage.When an extreme event occurs,the controllable generators form temporary microgrids(MGs)to restore the load maximally.Simultaneously,a demand response program(DRP)mitigates the imbalance between the power supply and demand during extreme events.To cope with the fault uncertainty,a robust optimization(RO)method is applied to reduce the long-term investment and short-term operation costs.The optimization is formulated as a tri-level defenderattacker-defender(DAD)framework.At the first level,decision-makers work out the DG allocation scheme;at the second level,the attacker finds the optimal attack strategy with maximum damage;and at the third level,restoration measures,namely distribution network reconfiguration(DNR)and demand response are performed.The problem is solved by the nested column and constraint generation(NC&CG)method and the model is validated using an IEEE 33-node system.Case studies validate the effectiveness and superiority of the proposed model according to the enhanced resilience and reduced cost.

Autonomous Vehicle Platoons In Urban Road Networks:A Joint Distributed Reinforcement Learning and Model Predictive Control Approach

In this paper, platoons of autonomous vehicles operating in urban road networks are considered. From a methodological point of view, the problem of interest consists of formally characterizing vehicle state trajectory tubes by means of routing decisions complying with traffic congestion criteria. To this end, a novel distributed control architecture is conceived by taking advantage of two methodologies: deep reinforcement learning and model predictive control. On one hand, the routing decisions are obtained by using a distributed reinforcement learning algorithm that exploits available traffic data at each road junction. On the other hand, a bank of model predictive controllers is in charge of computing the more adequate control action for each involved vehicle. Such tasks are here combined into a single framework:the deep reinforcement learning output(action) is translated into a set-point to be tracked by the model predictive controller;conversely, the current vehicle position, resulting from the application of the control move, is exploited by the deep reinforcement learning unit for improving its reliability. The main novelty of the proposed solution lies in its hybrid nature: on one hand it fully exploits deep reinforcement learning capabilities for decisionmaking purposes;on the other hand, time-varying hard constraints are always satisfied during the dynamical platoon evolution imposed by the computed routing decisions. To efficiently evaluate the performance of the proposed control architecture, a co-design procedure, involving the SUMO and MATLAB platforms, is implemented so that complex operating environments can be used, and the information coming from road maps(links,junctions, obstacles, semaphores, etc.) and vehicle state trajectories can be shared and exchanged. Finally by considering as operating scenario a real entire city block and a platoon of eleven vehicles described by double-integrator models, several simulations have been performed with the aim to put in light the main f eatures of the proposed approach. Moreover, it is important to underline that in different operating scenarios the proposed reinforcement learning scheme is capable of significantly reducing traffic congestion phenomena when compared with well-reputed competitors.

Distributed fiber optic sensors for tunnel monitoring:A state-of-the-art review

Distributed fiber optic sensors(DFOSs)possess the capability to measure strain and temperature variations over long distances,demonstrating outstanding potential for monitoring underground infrastructure.This study presents a state-of-the-art review of the DFOS applications for monitoring and assessing the deformation behavior of typical tunnel infrastructure,including bored tunnels,conventional tunnels,as well as immersed and cut-and-cover tunnels.DFOS systems based on Brillouin and Rayleigh scattering principles are both considered.When implementing DFOS monitoring,the fiber optic cable can be primarily installed along transverse and longitudinal directions to(1)measure distributed strains by continuously adhering the fiber to the structure’s surface or embedding it in the lining,or(2)measure point displacements by spot-anchoring it on the lining surface.There are four critical aspects of DFOS monitoring,including proper selection of the sensing fiber,selection of the measuring principle for the specific application,design of an effective sensor layout,and establishment of robust field sensor instrumentation.These four issues are comprehensively discussed,and practical suggestions are provided for the implementation of DFOS in tunnel infrastructure monitoring.

GRU-integrated constrained soft actor-critic learning enabled fully distributed scheduling strategy for residential virtual power plant

In this study,a novel residential virtual power plant(RVPP)scheduling method that leverages a gate recurrent unit(GRU)-integrated deep reinforcement learning(DRL)algorithm is proposed.In the proposed scheme,the GRU-integrated DRL algorithm guides the RVPP to participate effectively in both the day-ahead and real-time markets,lowering the electricity purchase costs and consumption risks for end-users.The Lagrangian relaxation technique is introduced to transform the constrained Markov decision process(CMDP)into an unconstrained optimization problem,which guarantees that the constraints are strictly satisfied without determining the penalty coefficients.Furthermore,to enhance the scalability of the constrained soft actor-critic(CSAC)-based RVPP scheduling approach,a fully distributed scheduling architecture was designed to enable plug-and-play in the residential distributed energy resources(RDER).Case studies performed on the constructed RVPP scenario validated the performance of the proposed methodology in enhancing the responsiveness of the RDER to power tariffs,balancing the supply and demand of the power grid,and ensuring customer comfort.

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.

Evaluation of Multi-Temporal-Spatial Scale Adjustment Capability and Cluster Optimization Operation Method for Distribution Networks with Distributed Photovoltaics

Themassive integration of high-proportioned distributed photovoltaics into distribution networks poses significant challenges to the flexible regulation capabilities of distribution stations.To accurately assess the flexible regulation capabilities of distribution stations,amulti-temporal and spatial scale regulation capability assessment technique is proposed for distribution station areas with distributed photovoltaics,considering different geographical locations,coverage areas,and response capabilities.Firstly,the multi-temporal scale regulation characteristics and response capabilities of different regulation resources in distribution station areas are analyzed,and a resource regulation capability model is established to quantify the adjustable range of different regulation resources.On this basis,considering the limitations of line transmission capacity,a regulation capability assessment index for distribution stations is proposed to evaluate their regulation capabilities.Secondly,considering different geographical locations and coverage areas,a comprehensive performance index based on electrical distance modularity and active power balance is established,and a cluster division method based on genetic algorithms is proposed to fully leverage the coordination and complementarity among nodes and improve the active power matching degree within clusters.Simultaneously,an economic optimization model with the objective of minimizing the economic cost of the distribution station is established,comprehensively considering the safety constraints of the distribution network and the regulation constraints of resources.This model can provide scientific guidance for the economic dispatch of the distribution station area.Finally,case studies demonstrate that the proposed assessment and optimization methods effectively evaluate the regulation capabilities of distribution stations,facilitate the consumption of distributed photovoltaics,and enhance the economic efficiency of the distribution station area.

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.

Distributed Dynamic Load in Structural Dynamics by the Impulse-Based Force Estimation Algorithm

This paper proposes a novel approach for identifying distributed dynamic loads in the time domain.Using polynomial andmodal analysis,the load is transformed intomodal space for coefficient identification.This allows the distributed dynamic load with a two-dimensional form in terms of time and space to be simultaneously identified in the form of modal force,thereby achieving dimensionality reduction.The Impulse-based Force Estimation Algorithm is proposed to identify dynamic loads in the time domain.Firstly,the algorithm establishes a recursion scheme based on convolution integral,enabling it to identify loads with a long history and rapidly changing forms over time.Secondly,the algorithm introduces moving mean and polynomial fitting to detrend,enhancing its applicability in load estimation.The aforementioned methodology successfully accomplishes the reconstruction of distributed,instead of centralized,dynamic loads on the continuum in the time domain by utilizing acceleration response.To validate the effectiveness of the method,computational and experimental verification were conducted.

Research on Tensor Multi-Clustering Distributed Incremental Updating Method for Big Data

The scale and complexity of big data are growing continuously,posing severe challenges to traditional data processing methods,especially in the field of clustering analysis.To address this issue,this paper introduces a new method named Big Data Tensor Multi-Cluster Distributed Incremental Update(BDTMCDIncreUpdate),which combines distributed computing,storage technology,and incremental update techniques to provide an efficient and effective means for clustering analysis.Firstly,the original dataset is divided into multiple subblocks,and distributed computing resources are utilized to process the sub-blocks in parallel,enhancing efficiency.Then,initial clustering is performed on each sub-block using tensor-based multi-clustering techniques to obtain preliminary results.When new data arrives,incremental update technology is employed to update the core tensor and factor matrix,ensuring that the clustering model can adapt to changes in data.Finally,by combining the updated core tensor and factor matrix with historical computational results,refined clustering results are obtained,achieving real-time adaptation to dynamic data.Through experimental simulation on the Aminer dataset,the BDTMCDIncreUpdate method has demonstrated outstanding performance in terms of accuracy(ACC)and normalized mutual information(NMI)metrics,achieving an accuracy rate of 90%and an NMI score of 0.85,which outperforms existing methods such as TClusInitUpdate and TKLClusUpdate in most scenarios.Therefore,the BDTMCDIncreUpdate method offers an innovative solution to the field of big data analysis,integrating distributed computing,incremental updates,and tensor-based multi-clustering techniques.It not only improves the efficiency and scalability in processing large-scale high-dimensional datasets but also has been validated for its effectiveness and accuracy through experiments.This method shows great potential in real-world applications where dynamic data growth is common,and it is of significant importance for advancing the development of data analysis technology.

Enhancing Security and Privacy in Distributed Face Recognition Systems through Blockchain and GAN Technologies

The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingthe significance of using cutting-edge technology to meet rising privacy issues in digital identity.