The rapid increase of train speed has brought greater challenges to the safety and reliability of railway systems. Therefore, it is necessary to monitor the operation status of trains, infrastructure, and their operating environment in real time. Because the operation environment of railway systems is complex, the construction cost of wired monitoring systems is high, and it is difficult to achieve full coverage in the operation area of harsh environments, so wireless sensor networks are suitable for the status monitoring of railway systems. Energy resources of nodes are the basis of ensuring the lifecycle of wireless sensor networks, but severely restrict the sustainability of wireless sensor networks. A construction method of special wireless sensor networks for railway status monitoring, and an optimal energy resources allocation method of wireless sensor networks for intelligent railway systems are proposed in this paper. Through cluster head selection and rotating probability model, clustering generation and optimization model, and partial coverage model, the energy consumption of nodes can be minimized and balanced. The result of simulation experiment proved that the lifetime of wireless sensor networks can be maximized by the optimal energy resources allocation method based on clustering optimization and partial coverage model, based on polynomial time algorithm.

Infectious diseases are an important cause of human death. The study of the pathogenesis, spread regularity, and development trend of infectious diseases not only provides a theoretical basis for future research on infectious diseases, but also has practical guiding significance for the prevention and control of their spread. In this paper, a controlled differential equation and an objective function of infectious diseases were established by mathematical modeling. Based on cellular automata theory and a compartmental model, the SLIRDS (Susceptible-Latent-Infected-Recovered-Dead-Susceptible) model was constructed, a model which can better reflect the actual infectious process of infectious diseases. Considering the spread of disease in different populations, the model combines population density, sex ratio, and age structure to set the evolution rules of the model. Finally, on the basis of the SLIRDS model, the complex spread process of pandemic influenza A (H1N1) was simulated. The simulation results are similar to the macroscopic characteristics of pandemic influenza A (H1N1) in real life, thus the accuracy and rationality of the SLIRDS model are confirmed.

Current research on the cascading failure of coupling networks is mostly based on hierarchical network models and is limited to a single relationship. In reality, many relationships exist in a network system, and these relationships collectively affect the process and scale of the network cascading failure. In this paper, a composite network is constructed based on the multisubnet composite complex network model, and its cascading failure is proposed combined with multiple relationships. The effect of intranetwork relationships and coupling relationships on network robustness under different influencing factors is studied. It is shown that cascading failure in composite networks is different from coupling networks, and increasing the strength of the coupling relationship can significantly improve the robustness of the network.

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS (dynamic-reverse reachable set) influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses an automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range but also greatly reduces the time complexity. The experimental results on the two real datasets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF (cost-effective lazy-forward) algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm, and pBmH (population-based metaheuristics) algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large-scale social network.

With the development of blockchain technology, many new social networks based on blockchain technology have emerged. The unique consensus mechanism and incentive mechanism of blockchain technology makes the law of information propagation in the new social network different from that in the traditional social network. Based on the information propagation characteristics of blockchain social network, this paper considers the influence of opposing groups of opinions, incentive mechanism and user’s conformity psychology in blockchain social network, and uses the evolutionary game to define the transfer process and probability between states and puts forward a new information propagation model. This paper analyses the influence of group density, state transition probability, and incentive policy on information transmission trends in the network through simulation experiments. The comparative experiment with the traditional model shows that the model in this paper can describe the propagation behaviour choices of different propagators under different incentive policies, which the traditional model cannot describe. Using the model in this paper to analyse the information propagation of blockchain social networks can effectively inhibit the propagation of inferior information and further build a good network public opinion environment.