Evolving Network Model with Local-Area Preference for Mobile Ad Hoc Network

To accurately describe the evolving features of Mobile Ad Hoc Networks (MANETs) and to improve the performance of such networks, an evolving topology model with local-area preference is proposed. The aim of the model, which is analyzed by the mean field theory, is to optimize network structures based on users' behaviors in MANETs. The analysis results indicate that the network generated by this evolving model is a kind of scale-free network. This evolving model can improve the fault-tolerance performance of networks by balancing the connectivity and two factors, i.e., the remaining energy and the distance to nodes. The simulation results show that the evolving topology model has superior performance in reducing the traffic load and the energy consumption, prolonging network lifetime and improving the scalability of networks. It is an available approach for establishing and analyzing actual MANETs.

A New Peer-to-Peer Topology for Video Streaming Based on Complex Network Theory

A new wave of networks labeled Peer-to-Peer(P2P) networks attracts more researchers and rapidly becomes one of the most popular applications.In order to matching P2 P logical overlay network with physical topology,the position-based topology has been proposed.The proposed topology not only focuses on non-functional characteristics such as scalability,reliability,fault-tolerance,selforganization,decentralization and fairness,but also functional characteristics are addressed as well.The experimental results show that the hybrid complex topology achieves better characteristics than other complex networks' models like small-world and scale-free models;since most of the real-life networks are both scale-free and small-world networks,it may perform well in mimicking the reality.Meanwhile,it reveals that the authors improve average distance,diameter and clustering coefficient versus Chord and CAN topologies.Finally,the authors show that the proposed topology is the most robust model,against failures and attacks for nodes and edges,versus small-world and scale-free networks.

Modeling complex networks of nuclear reaction data for probing their discovery processes

Hundreds of thousands of experimental data sets of nuclear reactions have been systematically collected,and their number is still growing rapidly.The data and their correlations compose a complex system,which underpins nuclear science and technology.We model the nuclear reaction data as weighted evolving networks for the purpose of data verification and validation.The networks are employed to study the growing cross-section data of a neutron induced threshold reaction(n,2n)and photoneutron reaction.In the networks,the nodes are the historical data,and the weights of the links are the relative deviation between the data points.It is found that the networks exhibit small-world behavior,and their discovery processes are well described by the Heaps law.What makes the networks novel is the mapping relation between the network properties and the salient features of the database:the Heaps exponent corresponds to the exploration efficiency of the specific data set,the distribution of the edge-weights corresponds to the global uncertainty of the data set,and the mean node weight corresponds to the uncertainty of the individual data point.This new perspective to understand the database will be helpful for nuclear data analysis and compilation.

Preferential attachment network model with aging and initial attractiveness

In this paper,we generalize the growing network model with preferential attachment for new links to simultaneously include aging and initial attractiveness of nodes.The network evolves with the addition of a new node per unit time,and each new node has m new links that with probability Π_(i) are connected to nodes i already present in the network.In our model,the preferential attachment probability Π_(i) is proportional not only to k_(i)+A,the sum of the old node i's degree ki and its initial attractiveness A,but also to the aging factor τ_(i)^(−α),whereτi is the age of the old node i.That is,Π_(i)∝(k_(i)+A)τ_(i)^(−α).Based on the continuum approximation,we present a mean-field analysis that predicts the degree dynamics of the network structure.We show that depending on the aging parameter α two different network topologies can emerge.For α<1,the network exhibits scaling behavior with a power-law degree distribution P(k)∝k^(−γ) for large k where the scaling exponent γ increases with the aging parameter α and is linearly correlated with the ratio A/m.Moreover,the average degree k(ti,t)at time t for any node i that is added into the network at time ti scales as k(t_(i),t)∝t_(i)^(−β) where 1/β is a linear function of A/m.For α>1,such scaling behavior disappears and the degree distribution is exponential.

Fast Community Detection Based on Distance Dynamics

The distance dynamics model is excellent tool for uncovering the community structure of a complex network. However, one issue that must be addressed by this model is its very long computation time in large-scale networks. To identify the community structure of a large-scale network with high speed and high quality, in this paper, we propose a fast community detection algorithm, the F-Attractor, which is based on the distance dynamics model. The main contributions of the F-Attractor are as follows. First, we propose the use of two prejudgment rules from two different perspectives： node and edge. Based on these two rules, we develop a strategy of internal edge prejudgment for predicting the internal edges of the network. Internal edge prejudgment can reduce the number of edges and their neighbors that participate in the distance dynamics model. Second, we introduce a triangle distance to further enhance the speed of the interaction process in the distance dynamics model. This triangle distance uses two known distances to measure a third distance without any extra computation. We combine the above techniques to improve the distance dynamics model and then describe the community detection process of the F-Attractor. The results of an extensive series of experiments demonstrate that the F-Attractor offers high-speed community detection and high partition quality.

Application research of multivariate linkage fluctuation analysis on condition evaluation in process industry

Abnormal conditions are hazardous in complex process systems, and the aim of condition recognition is to detect abnormal conditions and thus avoid severe accidents. The relationship of linkage fluctuation between monitoring variables can characterize the operation state of the system. In this study,we present a straightforward and fast computational method, the multivariable linkage coarse graining(MLCG) algorithm, which converts the linkage fluctuation relationship of multivariate time series into a directed and weighted complex network. The directed and weighted complex network thus constructed inherits several properties of the series in its structure. Thereby, periodic series convert into regular networks, and random series convert into random networks. Moreover, chaotic time series convert into scale-free networks. It demonstrates that the MLCG algorithm permits us to distinguish, identify, and describe in detail various time series. Finally, we apply the MLCG algorithm to practical observations series, the monitoring time series from a compressor unit, and identify its dynamic characteristics. Empirical results demonstrate that the MLCG algorithm is suitable for analyzing the multivariable linkage fluctuation relationship in complex electromechanical system. This method can be used to detect specific or abnormal operation condition, which is relevant to condition identification and information quality control of complex electromechanical system in the process industry.