In the research of heterogeneous wireless sensor networks, clustering is one of the most commonly used energy-saving methods. However, existing clustering methods face challenges when applied to heterogeneous wireless sensor networks, such as energy balance, node heterogeneity, algorithm efficiency, and more. Among these challenges, a well-designed clustering approach can lead to extended node lifetimes. Efficient selection of cluster heads is crucial for achieving optimal clustering. In this paper, we propose an Enhanced Pelican Optimization Algorithm for Cluster Head Selection (EPOA-CHS) to address these issues and enhance cluster head selection for optimal clustering. This method combines the Levy flight process with the traditional POA algorithm, which not only improves the optimization level of the algorithm, but also ensures the selection of the optimal cluster head. The logistic-sine chaotic mapping method is used in the population initialization, and the appropriate cluster head is selected through the new fitness function. Finally, we utilized MATLAB to simulate 100 sensor nodes within a configured area of 100 × 100 m${}^2$. These nodes were categorized into four heterogeneous scenarios: $m=0,\alpha =0$, $m=0.1,\alpha =2$, $m=0.2,\alpha =3$, and $m=0.3,\alpha =1.5$. We conducted verification for four aspects: total residual energy, network survival time, number of surviving nodes, and network throughput, across all protocols. Extensive experimental research ultimately indicates that the EPOA-CHS method outperforms the SEP, DEEC, Z-SEP, and PSO-ECSM protocols in these aspects.

The consensus optimal control problem for a class of linear multi-agent systems with directed communication networks is studied in this paper using adaptive dynamic programming. To overcome the restrictions of the agent’s low processing capability and to extend the actuator’s lifetime, consider the event-triggered. In the beginning, a dynamic event-triggered is provided, with several existing static event-triggered serving as special examples. When using the dynamic event-triggered, a longer interval can be shown between any two consecutive event-triggered. Designing a dynamic event-triggered control law becomes more challenging when implemented in directed networks. In addition, on the basis of dynamic event-triggered, a novel adaptive dynamic programming is used to construct a suitable dynamic event-triggered control law, which employs just the interaction information between agents and does not need model dynamics, overcoming the difficulty of solving the algebraic Riccati equation. Finally, the effectiveness of the proposed method is verified by simulation results, and no agent exhibits Zeno behavior.

To explore the impact of unknown terms and parameters on chaotic characteristics in chaotic systems, this paper examines the effects of state variables and unknown parameters. The study focuses on different combinations of linear, nonlinear, and constant terms It primarily investigates the role of multi-order state variables and their application to chaotic system models of varying dimensions. Firstly, by simulating a three-dimensional chaotic system, the paper analyzes how different combinations of nonlinear terms and initial conditions affect the system's chaotic behavior. Secondly, it evaluates the chaotic characteristics of a four-dimensional system, combining nonlinear terms with unknown parameters, using tools such as Lyapunov index diagrams, sample entropy, and dynamic trajectory plots. Finally, the paper integrates the constructed chaotic system with chaotic mapping to develop a two-level key chaotic image encryption system, thoroughly assessing its security and resistance to interference.

Using deep learning and machine learning techniques for network intrusion detection is of great significance for enhancing the defense capability of network security systems. Given the characteristics of generative adversarial networks, such as the approximate consistency of generated samples with the input data distribution but with a random distribution within a certain bounded interval, and in response to the problem of insufficient classification performance and detection omission caused by the imbalance of different degrees of data categories and quantities in network intrusion traffic, and in light of the fact that the effectiveness of existing classification algorithms based on unbalanced traffic data still has some room for improvement, this paper proposes a network intrusion detection strategy based on auxiliary classifier generative adversarial networks. The data expansion experiments are conducted with the intrusion detection dataset NSL-KDD. The data are classified into twenty-three categories before and after the expansion by binary classification validation. The results show that the expansion of the generated samples for unbalanced network traffic data improve the subsequent recognition effect significantly. Finally, five classification performance index verification experiments are conducted. The results prove that the strategy of this paper performs better in accuracy, precision, recall rate and F-value indexes, and is capable of obtaining a large number of features from limited samples and inferring complete data distribution based on fewer features. The model as a whole has stronger generalization ability and defense effect.