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.

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.

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.

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 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.

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.

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.

Research on Coordinated Development and Optimization of Distribution Networks at All Levels in Distributed Power Energy Engineering

The uncertainty of distributed generation energy has dramatically challenged the coordinated development of distribution networks at all levels.This paper focuses on the multi-time-scale regulation model of distributed generation energy under normal conditions.The simulation results of the example verify the self-optimization characteristics and the effectiveness of real-time dispatching of the distribution network control technology at all levels under multiple time scales.

A Distributed User Association and Resource Allocation Method in Cache-Enabled Small Cell Networks

Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.

Distributed Chunk-Based Optimization for MultiCarrier Ultra-Dense Networks

In this paper,a distributed chunkbased optimization algorithm is proposed for the resource allocation in broadband ultra-dense small cell networks.Based on the proposed algorithm,the power and subcarrier allocation problems are jointly optimized.In order to make the resource allocation suitable for large scale networks,the optimization problem is decomposed first based on an effective decomposition algorithm named optimal condition decomposition(OCD) algorithm.Furthermore,aiming at reducing implementation complexity,the subcarriers are divided into chunks and are allocated chunk by chunk.The simulation results show that the proposed algorithm achieves more superior performance than uniform power allocation scheme and Lagrange relaxation method,and then the proposed algorithm can strike a balance between the complexity and performance of the multi-carrier Ultra-Dense Networks.

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 CHANNEL ASSIGNMENT ALGORITHM VIA CONFLICT SHIFTING FOR DISTRIBUTED COGNITIVE NETWORKS

Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity.We present a dynamic and efficient algorithm via conflict shifting,referred as Shifting-based Channel Assignment(SCA).In this algorithm,the system was modeled with a conflict graph,and users cannot assign the channels that primary users(legacy users) and neighbors already occupied.In order to eliminate the conflicts between neighbors efficiently,secondary users(unlicensed users) try to transfer them through a straight path to the boundary,where conflicts are easier to solve as there are less neighbors for boundary users.Actions in one shift are executed in slots,and users act in a synchronous and separated manner.As a result,some of the conflicting channels are avoid from directly abandoned,and for this,utility of the entire network can be improved.Simulation results show that the proposed algorithm can provide similar utility performance while obviously reducing the communication cost than bargaining-base algorithms.In small scale networks with low user mobility(under 20%),it reduces 50% of the communication overhead than the later.

Distributed spatio-temporal generative adversarial networks

Owing to the wide range of applications in various fields,generative models have become increasingly popular.However,they do not handle spatio-temporal features well.Inspired by the recent advances in these models,this paper designs a distributed spatio-temporal generative adversarial network(STGAN-D)that,given some initial data and random noise,generates a consecutive sequence of spatio-temporal samples which have a logical relationship.This paper builds a spatio-temporal discriminator to distinguish whether the samples generated by the generator meet the requirements for time and space coherence,and builds a controller for distributed training of the network gradient updated to separate the model training and parameter updating,to improve the network training rate.The model is trained on the skeletal dataset and the traffic dataset.In contrast to traditional generative adversarial networks(GANs),the proposed STGAN-D can generate logically coherent samples with the corresponding spatial and temporal features while avoiding mode collapse.In addition,this paper shows that the proposed model can generate different styles of spatio-temporal samples given different random noise inputs,and the controller can improve the network training rate.This model will extend the potential range of applications of GANs to areas such as traffic information simulation and multiagent adversarial simulation.

Joint Optimization Strategy for Video Transmission over Distributed Cognitive Radio Networks

A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user's( PU's) collision limitations,non-synchronization between SU and PU,and SU's limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU's constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU's statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.

Distributed Generation Islanding Effect on Distribution Networks and End User Loads Using the Master-Slave Islanding Method

This study aims to address the feasibility of planned islanding operation and to investigate the effect of unplanned islanding using the master-slave islanding method for controlling the distributed generation units during grid-connected and islanding operation. Neplan desktop power simulation tool was used for the modelling and simulation of a realistic MV network with four different distributed generation technologies (diesel, gas, hydro and wind) along with their excitation and governor control systems, while an exponential model was used to represent the loads in the network. The dynamic and steady state behavior of the four distributed generation technologies were investigated during grid-connected operation and two transition modes to the islanding situation, planned and unplanned. The obtained results that validated through various case studies have shown that a suitable planned islanding transition could provide support to critical loads at the event of electricity utility outages.

Real-Time Traffic State and Boundary Flux Estimation with Distributed Speed Detecting Networks

The rapid development of 5G mobile communication and portable traffic detection technologies enhances highway transportation systems in detail and at a vehicle level. Besides the advantage of no disturbance to the regular traffic operation, these ubiquitous sensing technologies have the potential for unprecedented data collection at any temporal and spatial position. While as a typical distributed parameter system, the freeway traffic dynamics are determined by the current system states and the boundary traffic demand-supply. Using the three-step extended Kalman filtering, this paper simultaneously estimates the real-time traffic state and the boundary flux of freeway traffic with the distributed speed detector networks organized at any location of interest. In order to assess the effectiveness of the proposed approach, a freeway segment from Interstate 80 East (I-80E) in Alameda, Emeryville, and Northern California is selected. Experimental results show that the proposed method has the potential of using only speed detecting data to monitor the state of urban freeway transportation systems without access to the traditional measurement data, such as the boundary flows.

Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

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.

Optimal Location and Sizing ofMulti-Resource Distributed Generator Based onMulti-Objective Artificial Bee Colony Algorithm

Distribution generation(DG)technology based on a variety of renewable energy technologies has developed rapidly.A large number of multi-type DG are connected to the distribution network(DN),resulting in a decline in the stability of DN operation.It is urgent to find a method that can effectively connect multi-energy DG to DN.photovoltaic(PV),wind power generation(WPG),fuel cell(FC),and micro gas turbine(MGT)are considered in this paper.A multi-objective optimization model was established based on the life cycle cost(LCC)of DG,voltage quality,voltage fluctuation,system network loss,power deviation of the tie-line,DG pollution emission index,and meteorological index weight of DN.Multi-objective artificial bee colony algorithm(MOABC)was used to determine the optimal location and capacity of the four kinds of DG access DN,and compared with the other three heuristic algorithms.Simulation tests based on IEEE 33 test node and IEEE 69 test node show that in IEEE 33 test node,the total voltage deviation,voltage fluctuation,and system network loss of DN decreased by 49.67%,7.47%and 48.12%,respectively,compared with that without DG configuration.In the IEEE 69 test node,the total voltage deviation,voltage fluctuation and system network loss of DN in the MOABC configuration scheme decreased by 54.98%,35.93%and 75.17%,respectively,compared with that without DG configuration,indicating that MOABC can reasonably plan the capacity and location of DG.Achieve the maximum trade-off between DG economy and DN operation stability.

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.