Skip to main content
Computational and Mathematical Methods in Medicine logoLink to Computational and Mathematical Methods in Medicine
. 2022 May 6;2022:3735016. doi: 10.1155/2022/3735016

Link Security Situation Identification Method Based on the Ad Hoc Network of Medical Units

Yifu Zeng 1, Qingquan Chen 2, Ling Yao 3, Jiajing Zhuang 3, Zhixuan Huang 1, Shuhan Huang 4, Honghua Zeng 1,, Riguang Zhong 5,
PMCID: PMC9106497  PMID: 35572827

Abstract

In order to strengthen the management and security status monitoring of the internal network of medical units and make up for security vulnerabilities in time, an ad hoc network link security situation identification method is proposed. According to the architecture of the ad hoc network, it is analyzed that it has the advantages of strong persistence and its own protocol. Combined with the data of detection equipment and security log, the hierarchical acquisition model is used to obtain the situation elements such as port scanning attack and flood attack. The transmission rate factor, forwarding rate factor, dispersion factor, and node aggregation factor are regarded as eigenvectors. We determine the relationship between identity, difference, and opposition, identify the security situation through the description of the node state, and conduct quantitative processing to obtain the final identification result. The experimental results show that the weight value of this method is the same as the standard weight, which can identify the security situation level, obtain the specific situation value, and present a more intuitive identification result.

1. Introduction

In recent years, the informatization of medical institutions has become a general trend. On the one hand, it is the rapid development of Internet medical treatment, and on the other hand, the informatization and standardization of medical procedures are strengthened. Informatization not only effectively improves the work efficiency of medical units and meets the needs of patients for medical treatment but also lays a good foundation for the sustainable development of units. At the same time, information construction and development are also facing many network security problems, including patients' personal privacy information being stolen and external hackers invading the internal network. Traditional medical units have very weak intention of Intranet security construction, and patient information is more likely to be used illegally and cause great losses. Therefore, the network security identification and monitoring of the internal self-organizing network in medical units have become part of the research hotspots.

A network link security situation awareness method based on the Radial Basis Function (RBF) neural network was proposed [1]. The neural network model is optimized by a hybrid hierarchical genetic method to improve global search ability and realize security situation awareness. A fuzzy reasoning method was proposed [2] to realize automatic identification of security situation and deduces link attack correlation and risk.

The above methods lay a good foundation for the research of network link situation security identification but also have some shortcomings. For example, the data source is single, and there is no quantitative processing of the identification results, so the results obtained are not intuitive. In view of the above defects, this paper uses set pair analysis theory to identify the network link security situation. Set pair analysis is an algorithm dealing with the quantitative similarity and difference of uncertain systems [3], in which set pair represents a set of correspondence between two sets which have some relation. The idea of situation identification by this method is to analyze the system composed of set pair [4], find out the expression of connection number and the calculation method of identity and difference, and analyze the set pair situation, so as to obtain the security situation of the network link [5]. Because this method can deal with the uncertainty caused by fuzzy, random, and incomplete information, it is especially suitable for the security situation identification of the internal network of medical units.

2. Analysis on the Structure and Characteristics of the Ad Hoc Network in Medical Units

In traditional data center construction, there are usually three layers of network structure, which are called access layer, aggregation layer, and core layer. As shown in Figure 1, the access layer switches generally connect to servers and aggregation layer switches connect to access layer switches and generally provide other services, such as firewalls, IPS, and WAF. Generally, the aggregation layer is the demarcation point between L2 and L3. The L2 network is below the aggregation switch, and the L3 network is above the aggregation switch. Core layer switches generally provide high-speed forwarding of packets in and out of the data center and simultaneous forwarding of communications between multiple aggregation switches in the data center.

Figure 1.

Figure 1

Self-built network structure diagram of medical units.

In this system, the physical layer uses the transmission medium to provide the physical connection for the access control and realizes the encoding, decoding, receiving, and sending of signals. The link layer is responsible for establishing and maintaining data connections, as well as wireless links for management and traffic control.

3. Network Link Security Situation Identification Based on Set Pair Analysis

3.1. Situation Element Acquisition

Situation elements are obtained from logs and warning events of various anomaly detection devices and security devices, and attack types are divided into network detective, host service, and network resources [6, 7]. Specific attacks are as follows:

  1. Port scan

Ports belong to the connection terminal, play the role of a carrier, and also are the main object of attack and scanning. When scanning begins, the attacker transmits a large number of data packets to the host and analyzes the running and open ports on the target host in combination with the receiving and response status. Because all systems have certain security vulnerabilities, attackers can research targeted attack strategies according to the scanning results.

  • (2) UDP flood

The User Datagram Protocol (UDP) flood attack is also called a flood attack. This attack uses UDP, which eliminates the need for connection construction and authentication during data transmission. During the attack, the attacker sends abnormal data packets in batches, which consumes the network resources of the attacked host by occupying bandwidth. In addition, the host is too busy processing data packets to take care of normal connections, resulting in system crash [8].

  • (3) Web DoS attack

A Denial of Service (DoS) attack transmits massive data in correct format but not within normal services to the host. The host does not distinguish normal services from abnormal services. Due to limited resources, some normal business was refused [9]. However, due to the gradual improvement of server performance, a small number of packets of attackers can no longer damage the server, so the attackers jointly send DoS attacks to the host, which is the so-called distributed denial service attack.

  • (4) Illegal access request

Illegal request indicates the network access that does not comply with communication policies and rules. Collecting security data of this part is of great significance for network link security situation identification.

With the increase in the number of users, the network data is gradually huge. How to extract effective information from the huge network system is the basis of situation identification. To this end, the situation element acquisition framework is constructed as follows.

In this paper, the hierarchical situation element acquisition model is used to analyze the situation elements, as shown in Figure 2. The acquisition method is divided into global analysis and local analysis and follows the principle of local before the whole to realize the acquisition of elements.

Figure 2.

Figure 2

Framework diagram of hierarchical situation identification elements.

3.2. Feature Vector Property Selection

The main goal of network link security situational awareness is to obtain characteristic information of network operation [10], analyze the relationship between these information, and obtain the degree of influence on network security situation. In view of the above common attack events, the following factors are selected as feature vector attributes in this paper.

  1. Transmittance factor

The transmit rate factor can determine how many packets a node generates and transmits per unit time. Assume Sk(t) represents the number of data packets generated by node k within time slot t. When the network environment is relatively stable, Sk(t) is also relatively stable. If the average value of Sk(t) is much higher than Si(t), it indicates that node k has the possibility of launching DoS attacks. Otherwise, node k may fail. The expression of the transmittance factor is as follows:

SRkt=n×Skt1nSit, (1)

where n is the number of sending times.

  • (2) Forwarding factor

The forwarding rate factor can judge the level of packets forwarded by nodes. Assume that Rk(t) is the number of packets received by node k in time slot t and Tk(t) is the number of packets sent by node k at the same time. If Tk(t) is much higher than the average value of TR(t), it indicates that node k has the possibility of launching black-hole attacks. The calculation formula of the forwarding factor is as follows:

STkt=n×Tkt/RktnnTRt/Rkt. (2)
  • (3) Data source dispersion factor

Data source dispersion can evaluate data dispersion. Assume that RNk(n) represents the number of neighbor nodes in the first n packet received by node k and N represents the total number of nodes [11]. A large number of RNk(n) indicates that nodes are suspected of launching hexenbiest Sybil attacks. The description formula of the discrete factor is as follows:

SDkn=RNknN. (3)
  • (4) Node aggregation factor

The aggregation factor is an indicator to measure the concentration degree of the node's next hop. Assume that Skj(n) represents the total number of the first n packets transmitted by node k to the j-th neighbor node and Spk(n) represents Max (SPk1(n), SPk2(n), SPk3(n), ⋯). If the value of TAk(n) is lower than the average value of TNA(n), the node k is suspected of launching attacks, and the definition is as follows:

TAkn=SPk×nTNAn. (4)

The features of ad hoc network link state data are extracted by the above factors, and the network link security situation identification model is constructed based on these features.

3.3. Security Situation Identification Model

The node records and distinguishes all received and sent data packets in time slot t, and the data information vector passing through the node in this period is expressed as D = (d1, d2, d3, ⋯dn). The data vector D and the elements in the feature information vector set M = {M1, M2, ⋯, Mi} constitute identical-discrepancy-contrary system (IDCS). Suppose that the relation between D and Mk in the x-th component is expressed as μxk; according to the set pair analysis principle, the equation for describing the system is as follows:

μxk=axk+bxki+cxkj. (5)

In the formula, axk  represents the degree of sameness between the data vector D and the feature vector Mk  in the x-th component; the larger the value is, the higher the value is and the more similar the two data are. bxk represents the degree of difference between the two components; the larger the value is, the stronger the uncertainty degree is and the larger the value is. cxk represents the degree of opposition; a large value indicates a high degree of contrast between information i and k.

If the x-th component is a continuous variable, the set pairs of vector D and Mk on the x-th component can be expressed as

φx=zxdzxmzxd+zxm, (6)

where zxd  and zxm , respectively, represent the value of the x-th component vector D and Mk. Take εsame and εcontrary as set pair potential critical values, and 0 ≤ εsame < εcontrary ≤ 1 [12]. The relationship between the degree of identity, difference, and opposition in the expression of the degree of connection is shown in Table 1.

Table 1.

Coefficient and set pair relations.

Set pair potential distribution Value of a, b, and c
0 ≤ φnεsame a = 1, b = c = 0
ε sameφnεcontrary b = 1, a = c = 0
ε contraryφn ≤ 1 c = 1, a = b = 0

If the x-th component vector is a discrete variable, when zxd = zxm, then a = 1, b = c = 0; otherwise, c = 1, a = b = 0, so the sensitivity of x to the whole vector is ωx. Combined with the identical-conflicting properties of the set pair analysis, the degree of connectedness can be divided into the sum of a finite number of connectedness factors. The discrete multivariate relation degree of the data vector D and the feature information vector Mk is expressed as follows:

μk=ωxμxk+ω2μxk++ωxμxk++ωnμnkn. (7)

The following formula can be obtained from equation (7):

μk=1nω1,ω2,,ωna1b1c1anbncn1ij. (8)

Because there is an inverse relationship between the identical degree and degree of opposition, so j < 0, therefore equation (7) can also be converted into the following form:

μk=x=1nωxaxkjcxk+x=1nωxbxkin, (9)

where ∑x=1nωx(axk − |j|cxk)/n and ∑x=1nωxbxki/n represent the determined and undetermined parts of the correlation expression, respectively. When the known part of the formula is different, a larger value indicates a higher correlation degree, indicating that the two states are more similar. If the determined part is the same [13], a larger value of the undetermined part indicates a lower correlation degree, indicating that the two states have obvious differences; when the same degree of different operating states is lower than the difference degree, that is, 1/nx=1nωx(axkbxk) < 0, in this case, the node tends to be in an uncertain state. The ω value is calculated, and the connection degree of each element in the data vector and feature information vector set is calculated, respectively; μx = Max (μ1, μ2, ⋯, μl); then, the network link state tends to be in the x-th state in the feature vector set.

We set the reference feature vector S = {R1, R2, ⋯, Ri}, where Ri(i = 1, 2, ⋯, l) represents the proportion of the total number of nodes in the i-th state in the feature vector to the total number of nodes; the situation vector to be measured is s = {r1, r2, ⋯, ri}, where ri(i = 1, 2, ⋯, l) describes the proportion of the i-th state node in the whole node [14]. The security situation value of the network link to be tested can be expressed by the formula of network security entropy:

ρ=i=1l+1i×RiUi2i=1l+1i×Riri2, (10)

where Ui represents the percentage of the number of nodes in the i-th state in the total number under the condition of absolute insecurity and i represents the weight of components. The higher the ρ value is, the more secure the network link is, and the preliminary identification of the network link security situation is realized.

In a statistical period, each attack event may have multiple events e. The attack hazards of multiple events of the same type will be accumulated when the security factor situation is calculated. Therefore, the quantitative identification formulas of network detective security element situation PD, host service element situation PS, and resource element situation PN are as follows:

PD=hD×eEtHe×Ie, (11)
PS=hS×eEtHe×Ie, (12)
PN=hN×eEtHe×Ie, (13)

where hD represents the situation factor of network detective security factor, hs represents the situation factor of host service factor, hN represents the situation factor of resource factor, He represents the possibility of attack, Ie represents the attack intensity, and ht represents the attack harm factor.

4. Simulation Experiment and Result Analysis

In order to prove the performance of the proposed network link security situation recognition method, a network as shown in Figure 3 is constructed for the simulation experiment. This includes network facilities such as server nodes, routers, firewalls, and switches. The node performance information can be collected in real time to obtain the performance information of each link.

Figure 3.

Figure 3

Topology diagram of simulation experiment.

The server weight data and link weight values in Figure 3 are shown in Tables 2 and 3, respectively.

Table 2.

Server topology weight data.

Server type Topology weight Standard weight
Server 1 0.3 0.3
Server 2 0.3 0.3
Server 3 0.4 0.4

Table 3.

Main link topology weight.

Link Topology weight Standard weight
Link 1 0.4 0.4
Link 2 0.2 0.2
Link 3 0.4 0.4

As can be seen from Tables 2 and 3, the weight values of server topology and main link topology are the same as the corresponding standard weights, respectively, indicating that network link security situation has good identification performance.

In order to facilitate the administrator to make decisions, the identification results are quantified. In the situation calculation of security elements, hazard coefficients of various attack events are determined based on management experience, as shown in Table 4.

Table 4.

Attack event harm coefficient.

Attack event Attack type Harm coefficient Note
Port scan Internet detective 2 Attacks do less damage in the early stages
UDP flood 3 A large number of data packets impact host services
Web DoS Host service 4 Resources are valuable and the attack is harmful
Illegal request 2 Blocking events that control access to the system
Broadcast Network resource 2 A network storm occurs, occupying bandwidth

The recognition results of the proposed method are compared with the expected results, as shown in Table 5.

Table 5.

Comparison of experimental results.

Experiment number Actual threat level Expected threat level Actual output value Expected output value
1 High High 0.78 0.77
2 High High 0.75 0.86
3 High High 0.70 0.71
4 Medium Medium 0.68 0.68
5 Medium Medium 0.62 0.62
6 Medium Medium 0.57 0.56
7 Medium Medium 0.51 0.51
8 Low Low 0.45 0.45
9 Medium Low 0.52 0.52
10 Low Low 0.38 0.38

As can be seen from Table 5, there is no significant difference between the security situation value identified by the proposed method and the expected output value. Only in the ninth simulation process, there is a certain deviation in the classification of security level, which is due to the existence of certain interference information in the process of situation factor acquisition.

5. Discussion

In recent years, with the rapid development of Internet, medical care and health service informatization level gradually strengthens while the risk of network security increases as well. The medical unit network is vulnerable to all kinds of network attacks, which not only gives rise to the information leakage of patient privacy but also hinders the further development of medical informatization. It has become a hot research topic currently.

In this paper, a link security situation identification method is proposed by analyzing the internal network structure of medical units and combining with set pair analysis theory. The simulation results show that the proposed model can well identify the risk levels of different links in the internal network of medical units and provide valuable suggestions for preventing network attacks.

Note that if predictive control algorithms in this field [1517] may be implemented, the network security and managers' decision-making ability would be further enhanced.

6. Conclusion

In order to strengthen network security and improve managers' decision-making ability, a research on security situation identification based on set pair analysis is proposed. By collecting situation elements and extracting features, a situation recognition model is established. Simulation results show that there is little difference between the security situation values identified by this method and the expected output values. However, the acquisition process is completed manually. In the future research, automatic acquisition and preprocessing of situation elements will be realized to further reduce the identification of interference factors. In addition, the experimental environment is limited, so whether the situation recognition method based on set pair analysis can be applied to the internal network of large-scale medical units remains to be further studied.

Contributor Information

Honghua Zeng, Email: zyf@fyey.cn.

Riguang Zhong, Email: carebeing@outlook.com.

Data Availability

Data can be available on request from the authors due to privacy/ethical restrictions.

Conflicts of Interest

There are no competing interests associated with the manuscript.

Authors' Contributions

Honghua Zeng and Riguang Zhong were responsible for the conception and design and approval and accountable for the results of the study. Yifu Zeng was responsible for the interpretation, drafting, critical revision, and data interpretation. Qingquan Chen was responsible for the analysis and critical revision. Ling Yao, Jiajing Zhuang, Zhixuan Huang, and Shuhan Huang were responsible for the data interpretation. All authors have read and approved the manuscript.

References

  • 1.Li X., Wu M., Gang L., Yong Y., Shi L. On-line identification of biomass fuels based on flame radical imaging and application of radical basis function neural network techniques. IET Renewable Power Generation . 2015;9(4):323–330. doi: 10.1049/iet-rpg.2013.0392. [DOI] [Google Scholar]
  • 2.Husak M., Komarkova J., Bou-Harb E., Celeda P. Survey of attack projection, prediction, and forecasting in cyber security. Communications Surveys & Tutorials, IEEE . 2019;21(1):640–660. doi: 10.1109/COMST.2018.2871866. [DOI] [Google Scholar]
  • 3.Yang X. H., He J., Di C. L., Li J. Q. Vulnerability of assessing water resources by the improved set pair analysis. Thermal Science . 2014;18(5):1531–1535. doi: 10.2298/TSCI1405531Y. [DOI] [Google Scholar]
  • 4.Zhang Z., Qiao P., Qi Q., Xu J., Zheng Z. Study on the multi-factor degree set pair analysis fuzzy evaluation model based on entropy weight [C] 3rd. International Conference on Biomedical Engineering and Informatic, IEEE, 2010 . 2010;2010(7):2979–2984. [Google Scholar]
  • 5.Yang H. M., Zhang C. Y., Liang R. T., Tian F. Set pair social network analysis model [J] Applied Mechanics and Materials . 2011:50–51. [Google Scholar]
  • 6.Shen L., Wen Z. Network security situation prediction in the cloud environment based on grey neural network [J] Journal of Computational Methods in Sciences and Engineering . 2018;19:1–15. [Google Scholar]
  • 7.Sundararajan A., Khan T., Moghadasi A., Sarwat A. I. A survey on synchrophasor data quality and cybersecurity challenges, and evaluation of their interdependencies [J] Modern Power Systems and Clean Energy . 2019;7(3):449–467. [Google Scholar]
  • 8.Shi Y., Renfa Li Y., Zhang X. P. An immunity-based time series prediction approach and its application for network security situation. Intelligent Service Robotics . 2015;8(1):1–22. doi: 10.1007/s11370-014-0160-z. [DOI] [Google Scholar]
  • 9.Liang W., Long J., Chen Z., et al. A security situation prediction algorithm based on HMM in mobile network [J] Wireless Communications & Mobile Computing . 2018;2018:1–11. [Google Scholar]
  • 10.Xu G., Cao Y., Ren Y., Li X., Feng Z. Network security situation awareness based on semantic ontology and user-defined rules for Internet of things. IEEE Access . 2017;5:21046–21056. doi: 10.1109/ACCESS.2017.2734681. [DOI] [Google Scholar]
  • 11.Xi R., Yun X., Hao Z. Framework for risk assessment in cyber situational awareness. IET Information Security . 2019;13(2):149–156. doi: 10.1049/iet-ifs.2018.5189. [DOI] [Google Scholar]
  • 12.Shi Y., Li T., Chen W., Fu Y. M. Network security situation prediction using artificial immune system and phase space reconstruction. Applied Mechanics & Materials . 2010;44-47:3662–3666. doi: 10.4028/www.scientific.net/AMM.44-47.3662. [DOI] [Google Scholar]
  • 13.Zhang H., Yi Y., Wang J., Cao N., Duan Q. Approach and algorithm for generating appropriate doped structures for high-throughput materials screening. Computers, Materials & Continua . 2018;150(3):381–389. doi: 10.1016/j.commatsci.2018.04.017. [DOI] [Google Scholar]
  • 14.Liu X., Jiguo Y., Lv W., Yue D., Yinglong Wang Y. W. Network security situation: from awareness to awareness-control. Journal of Network and Computer Applications . 2019;139:15–30. doi: 10.1016/j.jnca.2019.04.022. [DOI] [Google Scholar]
  • 15.Wong K. K. L. Bridging game theory and the knapsack problem: a theoretical formulation. Journal of Engineering Mathematics . 2015;91(1):177–192. doi: 10.1007/s10665-014-9742-1. [DOI] [Google Scholar]
  • 16.Zhengzhou H., Kaihua L., Zhuo L., Liu Y. Named data networking with neural networks for intelligent image processing information systems. Enterprise Information Systems . 2020;1-16 [Google Scholar]
  • 17.Wei L., Wan S., Guo J., Wong K. K. L. Novel hierarchical selected ensemble classifier with bioinformatics application. Artificial Intelligence in Medicine, pii . 2017;S0933-3657(16):30576–30579. doi: 10.1016/j.artmed.2017.02.005. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Data can be available on request from the authors due to privacy/ethical restrictions.


Articles from Computational and Mathematical Methods in Medicine are provided here courtesy of Wiley

RESOURCES