Self-Organized Public-Key Management for Mobile Ad Hoc Networks Based on a Bidirectional Trust Model

In traditional networks , the authentication is performed by certificate authoritys（CA）,which can＇t be built in distributed mobile Ad Hoc Networks however. In this pa per, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short, the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust re quirement of hosts better.

A Fairness Resource Allocation Algorithm for Coverage and Capacity Optimization in Wireless Self-Organized Network

To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Self-Organized Criticality Analysis of Earthquake Model Based on Heterogeneous Networks

The original Olami-Feder-Christensen （OFC） model, which displays a robust power-law behavior, is a quasistatic two-dimensional version of the Burridge-Knopoff spring-block model of earthquakes. In this paper, we introduce a modified OFC model based on heterogeneous network, improving the redistribution rule of the original model. It can be seen as a generalization of the originM OFC model We numerically investigate the influence of the parameters θandβ, which respectively control the intensity of the evolutive mechanism of the topological growth and the inner selection dynamics in our networks, and find that there are two distinct phases in the parameter space （θ,β）. Meanwhile, we study the influence of the control parameter a either. Increasing a, the earthquake behavior of the model transfers from local to global.

A Modified Earthquake Model of Self-Organized Criticality on Small World Networks

A modified Olami Feder-Christensen model of self-organized criticality on a square lattice with the properties of small world networks has been studied.We find that our model displays power-law behavior and the exponent τ of the model depends on φ,the density of long-range connections in our network.

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

Self-organized Critical Model Based on Complex Brain Networks with Hierarchical Organization

The dynamical behavior in the cortical brain network of macaque is studied by modelling each cortical areawith a subnetwork of interacting excitable neurons.We find that the avalanche of our model on different levels exhibitspower-law.Furthermore the power-law exponent of the distribution and the average avalanche size are affected by thetopology of the network.

Self-organized Criticality in Hierarchical Brain Network

It is shown that the cortical brain network of the macaque displays a hierarchically clustered organizationand the neuron network shows small-world properties.Now the two factors will be considered in our model and thedynamical behavior of the model will be studied.We study the characters of the model and find that the distribution ofavalanche size of the model follows power-law behavior.

Self-Organized Algorithm in LTE Networks： A Utility Function Based Optimal Power Control Scheme

In this paper, transmission power control problem for uplink LTE network is investigated and a new autonomic uplink power control scheme was proposed based on utility function, which is a self- organized algorithm. The whole approach is based on the economic concept named utility function. Then a self-organized algorithm is distributed in each mobile users to control the transmission power and to maximize the transmission utility. The proposed scheme is solved through the Lagrange multiplier technique. It is proved that the utility function based algorithm optimal power level can be model. is applicable and the achieved based on our

Self-Organized Criticality in a Simple Neuron Model Based on Scale-Free Networks

A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays powerlaw behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

Effects of vertex activity have been analyzed on a weighted evolving network.The network is characterized by the probability distribution of vertex strength,each edge weight and evolution of the strength of vertices with different vertex activities.The model exhibits self-organized criticality behavior.The probability distribution of avalanche size for different network sizes is also shown.In addition,there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.

Self-organized Criticality and Synchronization in a Pulse-coupled Integrate-and-Fire Neuron Model Based on Small World Networks＊

A lattice model for a set of pulse-coupled integrate-and-fire neurons with small world structure is introduced.We find that our model displays the power-law behavior accompanied with the large-scale synchronized activities among the units. And the different connectivity topologies lead to different behaviors in models of integrate-and-fire neurons.

Effects of Aging and Self-organized Criticality in a Pulse-Coupled Integrate-and-Fire Neuron Model Based on Small World Networks

Effects of aging and self-organized criticality in a pulse-coupled integrate-and-fire neuron model based on small world networks have been studied. We give the degree distribution of aging network, average shortest path length, the diameter of our network, and the clustering coefficient, and find that our neuron model displays the power-law behavior, and with the number of added links increasing, the effects of aging become smaller and smaller. This shows that if the brain works at the self-organized criticality state, it can relieve some effects caused by aging.

Self-organized Criticality in a Modified Evolution Model on Generalized Barabasi-Albert Scale-Free Networks

A modified evolution model of self-organized criticality on generalized Barabasi-Albert （GBA）.scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.

Self-organized Criticality in an Earthquake Model on Random Network

A simplified Olami-Feder-Christensen model on a random network has been studied. We propose a new toppling rule -- when there is an unstable site toppling, the energy of the site is redistributed to its nearest neighbors randomly not averagely. The simulation results indicate that the model displays self-organized criticality when the system is conservative, and the avalanche size probability distribution of the system obeys finite size scaling. When the system is nonconservative, the model does not display scaling behavior. Simulation results of our model with different nearest neighbors q is also compared, which indicates that the spatial topology does not alter the critical behavior of the system.

Self-Organized Detection of Relationships in a Network

Multistate operations within a network result in high-dimensional, multivariate temporal data, and are useful for systems, which monitor access to network entities like resources, objects, etc. Efficient self organization of such multi-state network operations stored in databases with respect to relationships amongst users or between a user and a data object is an important and a challenging problem. In this work, a layer is proposed where discovered relationship patterns amongst users are classified as clusters. This information along with attributes of involved users is used to monitor and extract existing and growing relationships. The correlation is used to help generate alerts in advance due to internal user-object interactions or collaboration of internal as well as external entities. Using an experimental setup, the evolving relationships are monitored, and clustered in the database.

Application of Self-Organizing Feature Map Neural Network Based on K-means Clustering in Network Intrusion Detection

Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one of the most important technologies in network security detection.The accuracy of network intrusion detection has reached higher accuracy so far.However,these methods have very low efficiency in network intrusion detection,even the most popular SOM neural network method.In this paper,an efficient and fast network intrusion detection method was proposed.Firstly,the fundamental of the two different methods are introduced respectively.Then,the selforganizing feature map neural network based on K-means clustering(KSOM)algorithms was presented to improve the efficiency of network intrusion detection.Finally,the NSLKDD is used as network intrusion data set to demonstrate that the KSOM method can significantly reduce the number of clustering iteration than SOM method without substantially affecting the clustering results and the accuracy is much higher than Kmeans method.The Experimental results show that our method can relatively improve the accuracy of network intrusion and significantly reduce the number of clustering iteration.

Waterlogging risk assessment based on self-organizing map(SOM)artificial neural networks:a case study of an urban storm in Beijing

Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.

Self-Organization Approaches for Optimization in Cognitive Radio Networks

Cognitive radio(CR) is regarded as a promising technology for providing a high spectral efficiency to mobile users by using heterogeneous wireless network architectures and dynamic spectrum access techniques.However,cognitive radio networks(CRNs)may also impose some challenges due to the ever increasing complexity of network architecture,the increasing complexity with configuration and management of large-scale networks,fluctuating nature of the available spectrum,diverse Quality-of-Service(QoS)requirements of various applications,and the intensifying difficulties of centralized control,etc.Spectrum management functions with self-organization features can be used to address these challenges and realize this new network paradigm.In this paper,fundamentals of CR,including spectrum sensing,spectrum management,spectrum mobility and spectrum sharing,have been surveyed,with their paradigms of self-organization being emphasized.Variant aspects of selforganization paradigms in CRNs,including critical functionalities of Media Access Control(MAC)- and network-layer operations,are surveyed and compared.Furthermore,new directions and open problems in CRNs are also identified in this survey.

Self-organization of Reconfigurable Protocol Stack for Networked Control Systems

In networked control systems （NCS）,the control performance depends on not only the control algorithm but also the communication protocol stack.The performance degradation introduced by the heterogeneous and dynamic communication environment has intensified the need for the reconfigurable protocol stack.In this paper,a novel architecture for the reconfigurable protocol stack is proposed,which is a unified specification of the protocol components and service interfaces supporting both static and dynamic reconfiguration for existing industrial communication standards.Within the architecture,a triple-level self-organization structure is designed to manage the dynamic reconfiguration procedure based on information exchanges inside and outside the protocol stack.Especially,the protocol stack can be self-adaptive to various environment and system requirements through the reconfiguration of working mode,routing and scheduling table.Finally,the study on the protocol of dynamic address management is conducted for the system of controller area network （CAN）.The results show the efficiency of our self-organizing architecture for the implementation of a reconfigurable protocol stack.