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.

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 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.

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.

Adaptive link layer security architecture for telecommand communications in space networks

Impressive advances in space technology are enabling complex missions, with potentially significant and long term impacts on human life and activities. In the vision of future space exploration, communication links among planets, satel ites, spacecrafts and crewed vehicles wil be designed according to a new paradigm, known as the disruption tolerant networking. In this scenario, space channel peculiarities impose a massive reengineering of many of the protocols usually adopted in terrestrial networks; among them, security solutions are to be deeply reviewed, and tailored to the specific space requirements. Security is to be provided not only to the payload data exchanged on the network, but also to the telecommands sent to a spacecraft, along possibly differentiated paths. Starting from the secure space telecommand design developed by the Consultative Committee for Space Data Systems as a response to agency-based requirements, an adaptive link layer security architecture is proposed to address some of the chal enges for future space networks. Based on the analysis of the communication environment and the error diffusion properties of the authentication algorithms, a suitable mechanism is proposed to classify frame retransmission requests on the basis of the originating event （error or security attack） and reduce the impact of security operations. An adaptive algorithm to optimize the space control protocol, based on estimates of the time varying space channel, is also presented. The simulation results clearly demonstrate that the proposed architecture is feasible and efficient, especially when facing malicious attacks against frame transmission.

A survey of free space optical networks

Free Space Optical （FSO） networks, also known as optical wireless networks, have emerged as viable candidates for broadband wireless communications in the near future. The range of the potential application of FSO networks is extensive, from home to satellite. However, FSO networks have not been popularized because of insufficient availability and reliability. Researchers have focused on the problems in the physical layer in order to exploit the properties of wireless optical channels. However, recent technological developments with successful results make it practical to explore the advantages of the high bandwidth. Some researchers have begun to focus on the problems of network and upper layers in FSO networks. In this survey, we classify prospective global FSO networks into three subnetworks and give an account of them. We also present state-of- the-art research and discuss what kinds of challenges exist.

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.

An Interpretable Denoising Layer for Neural Networks Based on Reproducing Kernel Hilbert Space and its Application in Machine Fault Diagnosis

Deep learning algorithms based on neural networks make remarkable achievements in machine fault diagnosis,while the noise mixed in measured signals harms the prediction accuracy of networks.Existing denoising methods in neural networks,such as using complex network architectures and introducing sparse techniques,always suffer from the difficulty of estimating hyperparameters and the lack of physical interpretability.To address this issue,this paper proposes a novel interpretable denoising layer based on reproducing kernel Hilbert space(RKHS)as the first layer for standard neural networks,with the aim to combine the advantages of both traditional signal processing technology with physical interpretation and network modeling strategy with parameter adaption.By investigating the influencing mechanism of parameters on the regularization procedure in RKHS,the key parameter that dynamically controls the signal smoothness with low computational cost is selected as the only trainable parameter of the proposed layer.Besides,the forward and backward propagation algorithms of the designed layer are formulated to ensure that the selected parameter can be automatically updated together with other parameters in the neural network.Moreover,exponential and piecewise functions are introduced in the weight updating process to keep the trainable weight within a reasonable range and avoid the ill-conditioned problem.Experiment studies verify the effectiveness and compatibility of the proposed layer design method in intelligent fault diagnosis of machinery in noisy environments.

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.

Resource-constrained maximum network throughput on space networks

This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.

Evolving patterns of agricultural production space in China:A network-based approach

The agricultural production space,as where and how much each agricultural product grows,plays a vital role in meeting the increasing and diverse food demands.Previous studies on agricultural production patterns have predominantly centered on individual or specific crop types,using methods such as remote sensing or statistical metrological analysis.In this study,we characterize the agricultural production space(APS)by bipartite network connecting agricultural products and provinces,to reveal the relatedness between diverse agricultural products and the spatiotemporal characteristic of provincial production capabilities in China.The results show that core products are cereal,pork,melon,and pome fruit;meanwhile the milk,grape,and fiber crop show an upward trend in centrality,which is in line with diet structure changes in China over the past decades.The little changes in community components and structures of agricultural products and provinces reveal that agricultural production patterns in China are relatively stable.Additionally,identified provincial communities closely resemble China's agricultural natural zones.Furthermore,the observed growth in production capabilities in North and Northeast China implies their potential focus areas for future agricultural production.Despite the superior production capa-bilities of southern provinces,recent years have witnessed a notable decline,warranting special attentions.The findings provide a comprehensive perspective for understanding the complex relationship of agricultural prod-ucts'relatedness,production capabilities and production patterns,which serve as a reference for the agricultural spatial optimization and agricultural sustainable development.

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.

Coordinated Planning Transmission Tasks in Heterogeneous Space Networks:A Semi-Distributed Approach

This paper studies the coordinated planning of transmission tasks in the heterogeneous space networks to enable efficient sharing of ground stations cross satellite systems.Specifically,we first formulate the coordinated planning problem into a mixed integer liner programming(MILP)problem based on time expanded graph.Then,the problem is transferred and reformulated into a consensus optimization framework which can be solved by satellite systems parallelly.With alternating direction method of multipliers(ADMM),a semi-distributed coordinated transmission task planning algorithm is proposed,in which each satellite system plans its own tasks based on local information and limited communication with the coordination center.Simulation results demonstrate that compared with the centralized and fully-distributed methods,the proposed semi-distributed coordinated method can strike a better balance among task complete rate,complexity,and the amount of information required to be exchanged.