Search Results

Now showing 1 - 5 of 5
  • Item
    Topology identification of complex network via chaotic ant swarm algorithm
    (New York, NY : Hindawi Publishing Corporation, 2013) Peng, H.; Li, L.; Kurths, J.; Li, S.; Yang, Y.
    Nowadays, the topology of complex networks is essential in various fields as engineering, biology, physics, and other scientific fields. We know in some general cases that there may be some unknown structure parameters in a complex network. In order to identify those unknown structure parameters, a topology identification method is proposed based on a chaotic ant swarm algorithm in this paper. The problem of topology identification is converted into that of parameter optimization which can be solved by a chaotic ant algorithm. The proposed method enables us to identify the topology of the synchronization network effectively. Numerical simulations are also provided to show the effectiveness and feasibility of the proposed method.
  • Item
    Robustness of interrelated traffic networks to cascading failures
    (London : Nature Publishing Group, 2014) Su, Z.; Li, L.; Peng, H.; Kurths, J.; Xiao, J.; Yang, Y.
    The vulnerability to real-life networks against small initial attacks has been one of outstanding challenges in the study of interrelated networks. We study cascading failures in two interrelated networks S and B composed from dependency chains and connectivity links respectively. This work proposes a realistic model for cascading failures based on the redistribution of traffic flow. We study the Barabási-Albert networks (BA) and Erd's-Rényi graphs (ER) with such structure, and found that the efficiency sharply decreases with increasing percentages of the dependency nodes for removing a node randomly. Furthermore, we study the robustness of interrelated traffic networks, especially the subway and bus network in Beijing. By analyzing different attacking strategies, we uncover that the efficiency of the city traffic system has a non-equilibrium phase transition at low capacity of the networks. This explains why the pressure of the traffic overload is relaxed by singly increasing the number of small buses during rush hours. We also found that the increment of some buses may release traffic jam caused by removing a node of the bus network randomly if the damage is limited. However, the efficiencies to transfer people flow will sharper increase when the capacity of the subway network αS > α0.
  • Item
    A reconfigurable logic cell based on a simple dynamical system
    (New York, NY : Hindawi Publishing Corporation, 2013) Li, L.; Yang, C.; Hui, S.; Yu, W.; Kurths, J.; Peng, H.; Yang, Y.
    This paper introduces a new scheme to achieve a dynamic logic gate which can be adjusted flexibly to obtain different logic functions by adjusting specific parameters of a dynamical system. Based on graphical tools and the threshold mechanism, the distribution of different logic gates is studied, and a transformation method between different logics is given. Analyzing the performance of the dynamical system in the presence of noise, we discover that it is resistant to system noise. Moreover, we find some part of the system can be considered as a leaky integrator which has been already widely applied in engineering. Finally, we provide a proof-of-principle hardware implementation of the proposed scheme to illustrate its effectiveness. With the proposed scheme in hand, it is convenient to build the flexible, robust, and general purpose computing devices such as various network coding routers, communication encoders or decoders, and reconfigurable computer chips.
  • Item
    Reconstruction of Complex Network based on the Noise via QR Decomposition and Compressed Sensing
    (London : Nature Publishing Group, 2017) Li, L.; Xu, D.; Peng, H.; Kurths, J.; Yang, Y.
    It is generally known that the states of network nodes are stable and have strong correlations in a linear network system. We find that without the control input, the method of compressed sensing can not succeed in reconstructing complex networks in which the states of nodes are generated through the linear network system. However, noise can drive the dynamics between nodes to break the stability of the system state. Therefore, a new method integrating QR decomposition and compressed sensing is proposed to solve the reconstruction problem of complex networks under the assistance of the input noise. The state matrix of the system is decomposed by QR decomposition. We construct the measurement matrix with the aid of Gaussian noise so that the sparse input matrix can be reconstructed by compressed sensing. We also discover that noise can build a bridge between the dynamics and the topological structure. Experiments are presented to show that the proposed method is more accurate and more efficient to reconstruct four model networks and six real networks by the comparisons between the proposed method and only compressed sensing. In addition, the proposed method can reconstruct not only the sparse complex networks, but also the dense complex networks.
  • Item
    Semitensor Product Compressive Sensing for Big Data Transmission in Wireless Sensor Networks
    (London : Hindawi Limited, 2017) Peng, H.; Tian, Y.; Kurths, J.
    Big data transmission in wireless sensor network (WSN) consumes energy while the node in WSN is energy-limited, and the data transmitted needs to be encrypted resulting from the ease of being eavesdropped in WSN links. Compressive sensing (CS) can encrypt data and reduce the data volume to solve these two problems. However, the nodes in WSNs are not only energy-limited, but also storage and calculation resource-constrained. The traditional CS uses the measurement matrix as the secret key, which consumes a huge storage space. Moreover, the calculation cost of the traditional CS is large. In this paper, semitensor product compressive sensing (STP-CS) is proposed, which reduces the size of the secret key to save the storage space by breaking through the dimension match restriction of the matrix multiplication and decreases the calculation amount to save the calculation resource. Simulation results show that STP-CS encryption can achieve better performances of saving storage and calculation resources compared with the traditional CS encryption.