In wide-area distributed scenarios, it is particularly important to carry out information security situational awareness for the air traffic management (ATM) system with integrated air-ground structure. The operation data of the communication, navigation and surveillance (CNS) equipment of ATM system have the characteristics of multi-dimension, complexity, and strong correlation. In the process of situation awareness feature extraction, there are problems such as poor model accuracy, weak feature expression ability, and low classification performance. A feature association algorithm is designed to solve the above problems. Based on this algorithm, a deep-related sparse autoencoder (DRSAE) model based on improved sparse autoencoder is established. In DRSAE model, L1 regularization and Kullback–Leibler divergence (KLD) sparsity terms are used to penalize the parameters of the encoder network, and the quantity of hidden layers is increased to allow the model to optimize the global encoder network by iteratively training a single encoder. Moreover, the proposed DRSAE model and other feature extraction models such as principal component analysis (PCA), autoencoder (AE), and sparse autoencoder (SAE) are compared and evaluated by using the support vector machine (SVM) classifier. Compared with other feature extraction models, it is found that the proposed DRSAE model has good robustness in feature extraction of ATM system, and the obtained features have strong expression ability, which enhances the classification performance of the model and is convenient for situation awareness.

The system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data. The SWIM network searches and forwards routes on the basis of content names. The variable length, hierarchical name structure, and routing updates caused by the frequent publication and deletion of content make the implementation of fast name routing lookup algorithms a significant but arduous task. To address this problem, this study designed a name matching mechanism on the basis of the hybrid structure of the Bloom filter and the Tree. Compared with the traditional Bloom filter search scheme, this search mechanism reduces the quantity of Bloom filter insertion entries and reduces the possibility of hash collisions. Compared with the traditional Tree search scheme, the proposed mechanism can effectively solve the problem of numerous memory accesses caused by extremely long name prefixes, improving the query efficiency. In addition, the proposed composite structure is compared with several methods, such as DIPIT and NPT, by analyzing the effects of layering, global delay and search speed. The experimental results show that the proposed structure has a favourable performance in terms of storage overhead and search speed.

No abstract