arXiv subjects

Xingang Wang

Publications and source records attributed to Xingang Wang.

At least 91 records · Page 5Linked to original sources

arXiv2016

Growth, collapse, and self-organized criticality in complex networks

To understand how certain dynamical behaviors can or cannot persist as the underlying network grows is a problem of increasing importance in complex dynamical systems as well as sustainability science and engineering. We address the question of whether a complex network of nonlinear oscillators can maintain its synchronization stability as it expands or grows. A network in the real world can never be completely synchronized due to noise and/or external disturbances. This is especially the case when, mathematically, the transient synchronous state during the growth process becomes marginally stable, as a local perturbation can trigger a rapid deviation of the system from the vicinity of the synchronous state. In terms of the nodal dynamics, a large scale avalanche over the entire network can be triggered in the sense that the individual nodal dynamics diverge from the synchronous state in a cascading manner within a short time period. Because of the high dimensionality of the networked system, the transient process for the system to recover to the synchronous state can be extremely long. Introducing a tolerance threshold to identify the desynchronized nodes, we find that, after an initial stage of linear growth, the network typically evolves into a critical state where the addition of a single new node can cause a group of nodes to lose synchronization, leading to synchronization collapse for the entire network. A statistical analysis indicates that, the distribution of the size of the collapse is approximately algebraic (power law), regardless of the fluctuations in the system parameters. This is indication of the emergence of self-organized criticality. We demonstrate the generality of the phenomenon of synchronization collapse using a variety of complex network models, and uncover the underlying dynamical mechanism through an eigenvector analysis.

nlin.AO↗

arXiv2016

Improving Performance of IEEE 802.11 by a Dynamic Control Backoff Algorithm Under Unsaturated Traffic Loads

The IEEE 802.11 backoff algorithm is very important for controlling system throughput over contentionbased wireless networks. For this reason, there are many studies on wireless network performance focus on developing backoff algorithms. However, most existing models are based on saturated traffic loads, which are not a real representation of actual network conditions. In this paper, a dynamic control backoff time algorithm is proposed to enhance both delay and throughput performance of the IEEE 802.11 distributed coordination function. This algorithm considers the distinction between high and low traffic loads in order to deal with unsaturated traffic load conditions. In particular, the equilibrium point analysis model is used to represent the algorithm under various traffic load conditions. Results of extensive simulation experiments illustrate that the proposed algorithm yields better performance throughput and a better average transmission packet delay than related algorithms.

cs.NI↗

arXiv2015

Inducing chimera-synchronization in symmetric complex networks

In a recent study of chaos synchronization in symmetric complex networks [Pecora \textit{et al}., Nat. Commun. {\bf 5}, 4079 (2014)], it is found that stable synchronous clusters may coexist with many non-synchronous nodes in the asynchronous regime, resembling the chimera state observed in regular networks of non-locally coupled periodic oscillators. Although of practical significance, this new type of state, namely the chimera-synchronization state, is hardly generated for the general complex networks, due to either the topological instabilities or the weak coupling strength. Here, based on the strategy of pinning coupling, we propose an effective method for inducing chimera-synchronization in symmetric complex network of coupled chaotic oscillators. We are able to argue mathematically that, by pinning a group of nodes satisfying permutation symmetry, there always exits a critical pinning strength beyond which the unstable chimera-synchronization states can be successfully induced. The feasibility and efficiency of the control method are verified by numerical simulations of both artificial and real-world complex networks, with the numerical results well fitted by the theoretical predictions.

nlin.CD↗

arXiv2015

Controlling synchronous patterns in complex networks

Although the set of permutation symmetries of a complex network can be very large, few of the symmetries give rise to stable synchronous patterns. Here we present a new framework and develop techniques for controlling synchronization patterns in complex network of coupled chaotic oscillators. Specifically, according to the network permutation symmetry, we design a small-size and weighted network, namely the control network, and use it to control the large-size complex network by means of pinning coupling. We argue mathematically that for \emph{any} of the network symmetries, there always exists a critical pinning strength beyond which the unstable synchronous pattern associated to this symmetry can be stabilized. The feasibility of the control method is verified by numerical simulations of both artificial and real-work networks, and is demonstrated by experiment of coupled chaotic circuits. Our studies pave a way to the control of dynamical patterns in complex networks.

nlin.CD↗

arXiv2014

Estimation of Medium Access Control Layer Packet Delay Distribution for IEEE 802.11

The most important standard in wireless local area networks is IEEE 802.11. This is why much of the research work for the enhancement of wireless network is usually based on the behavior of IEEE 802.11 protocol. However, some of the ways in which IEEE 802.11 medium access control layer behaves is still unreliable to guarantee quality of service. For instance, medium access control layer packet delay, jitter and packet loss rate still remain a challenge. The main objective of this research is to propose an accurate estimation of the medium access control layer packet delay distribution for IEEE 802.11. This estimation considers the differences between busy probability and collision probability. These differences are employed to achieve a more accurate estimation. Finally, the proposed model and simulation are implemented and validated - using MATLAB program for the purpose of simulation, and Maple program to undertake the calculation of the equations.

cs.NI↗

arXiv2011

Onset of Synchronization in Weighted Complex Networks: the Effect of Weight-Degree Correlation

By numerical simulations, we investigate the onset of synchronization of networked phase oscillators under two different weighting schemes. In scheme-I, the link weights are correlated to the product of the degrees of the connected nodes, so this kind of networks is named as the weight-degree correlated (WDC) network. In scheme-II, the link weights are randomly assigned to each link regardless of the node degrees, so this kind of networks is named as the weight-degree uncorrelated (WDU) network. Interestingly, it is found that by increasing a parameter that governs the weight distribution, the onset of synchronization in WDC network is monotonically enhanced, while in WDU network there is a reverse in the synchronization performance. We investigate this phenomenon from the viewpoint of gradient network, and explain the contrary roles of coupling gradient on network synchronization: gradient promotes synchronization in WDC network, while deteriorates synchronization in WDU network. The findings highlight the fact that, besides the link weight, the correlation between the weight and node degree is also important to the network dynamics.

nlin.CD↗

arXiv2010

On the pinning strategy of complex networks

In pinning control of complex networks, a tacit believing is that the system dynamics will be better controlled by pinning the large-degree nodes than the small-degree ones. Here, by changing the number of pinned nodes, we find that, when a significant fraction of the network nodes are pinned, pinning the small-degree nodes could generally have a higher performance than pinning the large-degree nodes. We demonstrate this interesting phenomenon on a variety of complex networks, and analyze the underlying mechanisms by the model of star networks. By changing the network properties, we also find that, comparing to densely connected homogeneous networks, the advantage of the small-degree pinning strategy is more distinct in sparsely connected heterogenous networks.

physics.soc-ph↗

arXiv2009

Evolutionary Subnetworks in Complex Systems

Links in a practical network may have different functions, which makes the original network a combination of some functional subnetworks. Here, by a model of coupled oscillators, we investigate how such functional subnetworks are evolved and developed according to the network structure and dynamics. In particular, we study the case of evolutionary clustered networks in which the function of each link (either attractive or repulsive coupling) is updated by the local dynamics. It is found that, during the process of system evolution, the network is gradually stabilized into a particular form in which the attractive (repulsive) subnetwork consists only the intralinks (interlinks). Based on the properties of subnetwork evolution, we also propose a new algorithm for network partition which is distinguished by the convenient operation and fast computing speed.

nlin.AO↗

arXiv2009

Protecting infrastructure networks from cost-based attacks

It has been known that heterogeneous networks are vulnerable to the intentional removal of a small fraction of highly connected or loaded nodes, which implies that, to protect a network effectively, a few important nodes should be allocated with more defense resources than the others. However, if too many resources are allocated to the few important nodes, the numerous less-important nodes will be less protected, which, when attacked all together, still capable of causing a devastating damage. A natural question therefore is how to efficiently distribute the limited defense resources among the network nodes such that the network damage is minimized whatever attack strategy the attacker may take. In this paper, taking into account the factor of attack cost, we will revisit the problem of network security and search for efficient network defense against the cost-based attacks. The study shows that, for a general complex network, there will exist an optimal distribution of the defense resources, with which the network is well protected from cost-based attacks. Furthermore, it is found that the configuration of the optimal defense is dependent on the network parameters. Specifically, network that has a larger size, sparser connection and more heterogeneous structure will be more benefited from the defense optimization.

cs.NI↗

arXiv2008

Transition to amplitude death in scale-free networks

Transition to amplitude death in scale-free networks of nonlinear oscillators is investigated. As the coupling strength increases, the network will undergo three stages in approaching to the state of complete amplitude death. The first stage is featured by a \emph{"stair-like"} distribution of the node amplitude, and the transition is accomplished by a \emph{hierarchical death} of the amplitude stairs. The second and third stages are characterized by, respectively, a continuing elimination of the synchronous clusters and a fast death of the non-synchronized nodes.

nlin.AO↗

arXiv2008

The development of generalized synchronization on complex networks

In this paper, we investigate the development of generalized synchronization (GS) on typical complex networks, such as scale-free networks, small-world networks, random networks and modular networks. By adopting the auxiliary-system approach to networks, we show that GS can take place in oscillator networks with both heterogeneous and homogeneous degree distribution, regardless of whether the coupled chaotic oscillators are identical or nonidentical. For coupled identical oscillators on networks, we find that there exists a general bifurcation path from initial non-synchronization to final global complete synchronization (CS) via GS as the coupling strength is increased. For coupled nonidentical oscillators on networks, we further reveal how network topology competes with the local dynamics to dominate the development of GS on networks. Especially, we analyze how different coupling strategies affect the development of GS on complex networks. Our findings provide a further understanding for the occurrence and development of collective behavior in complex networks.

nlin.CD↗

arXiv2007

Enhancing synchronization in complex networks of coupled phase oscillators

By a model of coupled phase oscillators, we show analytically how synchronization in {\em non-identical} complex networks can be enhanced by introducing a proper gradient into the couplings. It is found that, by pointing the gradient from the large-degree to the small-degree nodes on each link, increasing the gradient strength will bring forward the {\em onset} of network synchronization monotonically, and, under the same gradient strength, heterogeneous networks are more synchronizable than homogeneous networks. These findings are verified by extensive simulations.

nlin.CD↗

arXiv2007

Optimization of synchronization in gradient clustered networks

We consider complex clustered networks with a gradient structure, where sizes of the clusters are distributed unevenly. Such networks describe more closely actual networks in biophysical systems and in technological applications than previous models. Theoretical analysis predicts that the network synchronizability can be optimized by the strength of the gradient field but only when the gradient field points from large to small clusters. A remarkable finding is that, if the gradient field is sufficiently strong, synchronizability of the network is mainly determined by the properties of the subnetworks in the two largest clusters. These results are verified by numerical eigenvalue analysis and by direct simulation of synchronization dynamics on coupled-oscillator networks.

nlin.CD↗

arXiv2007

The multiple effects of gradient coupling on network synchronization

Recent studies have shown that synchronizability of complex networks can be significantly improved by asymmetric couplings, and increase of coupling gradient is always in favor of network synchronization. Here we argue and demonstrate that, for typical complex networks, there usually exists an optimal coupling gradient under which the maximum network synchronizability is achieved. After this optimal value, increase of coupling gradient could deteriorate synchronization. We attribute the suppression of network synchronization at large gradient to the phenomenon of network breaking, and find that, in comparing with sparsely connected homogeneous networks, densely connected heterogeneous networks have the superiority of adopting large gradient. The findings are supported by indirect simulations of eigenvalue analysis and direct simulations of coupled nonidentical oscillator networks.

nlin.AO↗

arXiv2007

Nonstationary pattern in unsynchronizable complex networks

Pattern formation and evolution in unsynchronizable complex networks are investigated. Due to the asymmetric topology, the synchronous patterns formed in complex networks are irregular and nonstationary. For coupling strength immediately out of the synchronizable region, the typical phenomenon is the on-off intermittency of the system dynamics. The patterns appeared in this process are signatured by the coexistence of a giant cluster, which comprises most of the nodes, and a few number of small clusters. The pattern evolution is characterized by the giant cluster irregularly absorbs or emits the small clusters. As the coupling strength leaves away from the synchronization bifurcation point, the giant cluster is gradually dissolved into a number of small clusters, and the system dynamics is characterized by the integration and separation of the small clusters. Dynamical mechanisms and statistical properties of the nonstationary pattern evolution are analyzed and conducted, and some scalings are newly revealed. Remarkably, it is found that the few active nodes, which escape from the giant cluster with a high frequency, are independent of the coupling strength while are sensitive to the bifurcation types. We hope our findings about nonstationary pattern could give additional understandings to the dynamics of complex systems and have implications to some real problems where systems maintain their normal functions only in the unsynchronizable state.

nlin.CD↗

arXiv2007

Synchronization in Gradient Networks

The contradiction between the fact that many empirical networks possess power-law degree distribution and the finding that network of heterogeneous degree distribution is difficult to synchronize has been a paradox in the study of network synchronization. Surprisingly, we find that this paradox can be well fixed when proper gradients are introduced to the network links, i.e. heterogeneity is in favor of synchronization in gradient networks. We analyze the statistical properties of gradient networks and explore their dependence to the other network parameters. Based on these understandings, we further propose a new scheme for network synchronization distinguished by using less network information while reaching stronger synchronizability, as supported by analytical estimates of eigenvalues and directed simulations of coupled chaotic oscillators. Our findings suggest that, with gradient, scale-free network is a natural choice for synchronization.

nlin.CD↗

arXiv2006

Oscillations of complex networks

A complex network processing information or physical flows is usually characterized by a number of macroscopic quantities such as the diameter and the betweenness centrality. An issue of significant theoretical and practical interest is how such a network responds to sudden changes caused by attacks or disturbances. By introducing a model to address this issue, we find that, for a finite-capacity network, perturbations can cause the network to \emph{oscillate} persistently in the sense that the characterizing quantities vary periodically or randomly with time. We provide a theoretical estimate of the critical capacity-parameter value for the onset of the network oscillation. The finding is expected to have broad implications as it suggests that complex networks may be structurally highly dynamic.

cond-mat.stat-mech↗

arXiv2005

Construction of a secure cryptosystem based on spatiotemporal chaos and its application in public channel cryptography

By combining the one-way coupled chaotic map lattice system with a bit-reverse operation, we construct a new cryptosystem which is extremely sensitive to the system parameters even for low-dimensional systems. The security of this new algorithm is investigated and mechanism of the sensitivity is analyzed. We further apply this cryptosystem to the public channel cryptography, based on "Merkle's puzzles", by employing it both as pseudo-random-number (PN) generators and symmetric encryptor. With the properties of spatiotemporal chaos, the new scheme is rich with new features and shows some advantages in comparison with the conventional ones.

nlin.CD↗