Distribution algorithm of entangled particles for wireless quantum communication mesh networks

With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.

Degree distribution and robustness of cooperative communication network with scale-free model

With the requirements of users enhanced for wireless communication, the cooperative communication will become a development trend in future. In this paper, a model based on complex networks with both preferential attachment is researched to solve an actual network CCN （Cooperative Communication Network）. Firstly, the evolution of CCN is given by four steps with different probabilities. At the same time, the rate equations of nodes degree are presented to analyze the evolution of CCN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation. Finally, the robustness of CCN is studied by numerical simulation with random attack and intentional attack to analyze the effects of degree distribution and average path length. The results of this paper are more significant for building CCN to programme the resource of communication.

THE STUDY ON DEGREE DISTRIBUTION PROPERTY OF COMPLEX NETWORK BASED ON COOPERATIVE COMMUNICATION

Complex networks have been widely studied. Recently,many results show that the degree distributions of some large networks follow the form of power-law and these networks possess better robustness against random nodes failure. As an effective technology on combating the channel fading,wireless cooperative communication is becoming one of the most important methods to improve the wireless communication performances. In this paper,the complex network models based on cooperative communication and non-cooperative communication are established; and the degree distribution properties for them are studied. The simulation results show that the degree distributions of these networks also follow the form of power-law,which means that the addition of cooperative communi-cation links will not change the property of degree distribution and then these networks will possess better robustness against random nodes failure as well.

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.

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.

Communication-Censored Distributed Learning for Stochastic Configuration Networks

This paper aims to reduce the communication cost of the distributed learning algorithm for stochastic configuration networks (SCNs), in which information exchange between the learning agents is conducted only at a trigger time. For this purpose, we propose the communication-censored distributed learning algorithm for SCN, namely ADMMM-SCN-ET, by introducing the event-triggered communication mechanism to the alternating direction method of multipliers (ADMM). To avoid unnecessary information transmissions, each learning agent is equipped with a trigger function. Only if the event-trigger error exceeds a specified threshold and meets the trigger condition, the agent will transmit the variable information to its neighbors and update its state in time. The simulation results show that the proposed algorithm can effectively reduce the communication cost for training decentralized SCNs and save communication resources.

Research on IPv6 Transition Evolvement and Security Architecture of Smart Distribution Grid Data Communication System

Smart distribution grid needs data communication systems as a support to complete their important functions. The smart distribution grid of the data and information are increasingly adopting internet protocol and Ethernet technology. The IP addresses are more and more important for the smart distribution grid equipment. The current IPv4 protocol occupies a dominant position; therefore, the challenges of the evolution to IPv6 and network security are faced by data communication systems of the smart distribution grid. The importance of data communications network and its main bearer of business were described. The data communications network from IPv4 to IPv6 evolution of the five processes and four stages of the transition were analyzed. The smart distribution grid data communications network security and types of their offensive and defensive were discussed. And the data communications network security architecture was established. It covers three dimensions, the security level, the communications network security engineering and the communications network security management. The security architecture safeguards the evolution to IPv6 for the smart distribution grid data communication systems.

Quantum Key Distribution Network Based on Differential Phase Shift

Using a series of quantum correlated photon pairs, we propose a theoretical scheme for any-to-any multi-user quantum key distribution network based on differential phase shift. The differential phase shift and the different detection time slots ensure the security of our scheme against eavesdropping. We discuss the security under the intercept-resend attack and the source replacement attack.

Autonomous Optimal Coordination Scheme in Protection System of Power Distribution Network by Using Multi-Agent Concept

A protection system using a multi-agent concept for power distribution networks is proposed.Every digital over current relay(OCR)is developed as an agent by adding its own intelligence,self-tuning and communication ability.The main advantage of the multi-agent concept is that a group of agents work together to achieve a global goal which is beyond the ability of each individual agent.In order to cope with frequent changes in the network operation condition and faults,an OCR agent,proposed in this paper,is able to detect a fault or a change in the network and find its optimal parameters for protection in an autonomous manner considering information of the whole network obtained by communication between other agents.Through this kind of coordination and information exchanges,not only a local but also a global protective scheme is completed.Simulations in a simple distribution network show the effectiveness of the proposed protection system.

Purification in entanglement distribution with deep quantum neural network

Entanglement distribution is important in quantum communication. Since there is no information with value in this process, purification is a good choice to solve channel noise. In this paper, we simulate the purification circuit under true environment on Cirq, which is a noisy intermediate-scale quantum(NISQ) platform. Besides, we apply quantum neural network(QNN) to the state after purification. We find that combining purification and quantum neural network has good robustness towards quantum noise. After general purification, quantum neural network can improve fidelity significantly without consuming extra states. It also helps to obtain the advantage of entangled states with higher dimension under amplitude damping noise. Thus, the combination can bring further benefits to purification in entanglement distribution.

Reliable Content Distribution in P2P Networks Based on Peer Groups

Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.

IEEE1588 Time Synchronizing System Multiplexing Industrial Ethernet of Distribution Automation

The present study explores an IEEE1588 Synchronizing System for smart distribution grid based on Industrial Ethernet. The paper first analyzes the communication system in distribution network and then proposed the project of time synchronizing system using IEEE1588 in distribution network. The study focuses on rational clock correcting time region segmentation, selecting the best clock source injection point and multiple redundant methods when correcting time method lose efficacy, etc. The precision of time synchronizing is better than that of 1 millisecond.

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.

Coordination of multiple mobile robots with limited communication range in pursuit of single mobile target in cluttered environment

This paper addresses the problem of coordinating multiple mobile robots in searching for and capturing a mobile target,with the aim of reducing the capture time.Compared with the previous algorithms,we assume that the target can be detected by any robot and captured successfully by two or more robots.In this paper,we assume that each robot has a limited communication range.We maintain the robots within a mobile network to guarantee the successful capture.In addition,the motion of the target is modeled and incorporated into directing the motion of the robots to reduce the capture time.A coordination algorithm considering both aspects is proposed.This algorithm can greatly reduce the expected time of capturing the mobile target.Finally,we validate the algorithm by the simulations and experiments.

Design and Analysis of Com munication Network for Distributed SCADA System

This paper presents the design of hierarchical communication network for traction power supply supervisory control and data acquisition (SCADA) system. Some key points, such as data transmission synchronization, database distribution, data transformation, and the network communication optimization at the supervisory level of the communication network are discussed. At the control level, based on the specificity of communication lines for electrified railway, a structure of two layer ring telecommunication network and the efficient bi directional polling scheme in software design are utilized. Then, an analysis for the scheme under normal and disturbance conditions is given. By means of the scheme, software switching over at a fault point of a channel is realized automatically.

Steady-State Analysis of the Distributed Queueing Algorithm in a Single-Channel M2M Network

The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.

Distributed Real-time Optimal Power Flow Strategy for DC Microgrid Under Stochastic Communication Networks

This paper addresses a distributed real-time optimal power flow(RTOPF) strategy for DC microgrids. In this paper, we focus on the scenarios where local information sharing is conducted in stochastic communication networks subject to random failures. Most existing real-time optimal power flow(OPF) algorithms for the DC microgrid require all controllers to work in concert with a fixed network topology to maintain a zero gap between estimated global constraint violations. Thus, the high reliability of communication is required to ensure their convergence. To address this issue, the proposed RTOPF strategy tolerates stochastic communication failures and can seek the optimum with a constant step size considering the operation limitations of the microgrid. These aspects make the strategy suitable for real-time optimization, particularly when the communication is not reliable. In addition, this strategy does not require information from non-dispatchable devices, thereby reducing the number of sensors and controllers in the system. The convergence of the proposed strategy and the optimal equilibrium points are theoretically proven. Finally, simulations of a 30-bus DC microgrid are performed to validate the effectiveness of the proposed designs.

Network-based products detection system:congestion control and self diagnosis

The problems that arise while developing a real-time distributed information-processing software system are studied. And based on the TCP/IP protocols and socket, for its facility in client/server （C/S） model networking programming, a prototype is designed for data transmission between the server and clients and it is applied on an on-line products automatic detection system. The probability analysis on network congestion was also made. A proper mechanism based on the ARCC （adapted RTT congestion control） algorithm is employed for detecting and resolving congestion, the purpose of which is mainly to achieve congestion avoidance under the particular conditions in this network-based system and reach the desired performance. Furthermore, a method is proposed for a client to diagnose automatically the connection status between the server and the client and to re-connect to the server when the disconnection is detected.

A COMPOUND POISSON MODEL FOR LEARNING DISCRETE BAYESIAN NETWORKS

We introduce here the concept of Bayesian networks, in compound Poisson model, which provides a graphical modeling framework that encodes the joint probability distribution for a set of random variables within a directed acyclic graph. We suggest an approach proposal which offers a new mixed implicit estimator. We show that the implicit approach applied in compound Poisson model is very attractive for its ability to understand data and does not require any prior information. A comparative study between learned estimates given by implicit and by standard Bayesian approaches is established. Under some conditions and based on minimal squared error calculations, we show that the mixed implicit estimator is better than the standard Bayesian and the maximum likelihood estimators. We illustrate our approach by considering a simulation study in the context of mobile communication networks.

Benefits Analysis of Beam Hopping in Satellite Mobile System with Unevenly Distributed Traffic

Satellite mobile system and space-airground integrated network have a prominent superiority in global coverage which plays a critical role in remote and non-land regions, as well as emergency communications. However, due to the gradual angle attenuations of the satellite antennas, it is difficult to achieve full frequency multiplex among different beams as terrestrial 5G network. Multi-color frequency reuse is widely adopted in both academic and industry. Beam hopping scheme has attracted the attention of researchers recently due to the allocation flexibility. In this paper, we focus on analyzing the performance benefits of beam hopping compared with multi-color frequency reuse scheme in non-uniform user and traffic distributions in satellite system. Aerial networks are also introduced to form a space-airground integrated network for coverage enhancement,and the capacity improvement is analyzed. Besides,additional improved techniques are provided to make comprehensive analysis and comparisons. Theoretical analysis and simulation results indicate that the beam hopping scheme has a prominent superiority in the system capacity compared with the traditional multicolor frequency reuse scheme in both satellite mobile system and future space-air-ground integrated network.