Skip to main content
SpringerLink
Log in

Functional Model of Adaptive Network Topology of Large-Scale Systems Based on Dynamical Graph Theory

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

A model that can describe the functioning of large-scale systems with a dynamical and adaptive network topology is developed. Dynamical graph theory is chosen as the mathematical tools on which the model is based. Therefore, the functioning of the ad hoc network is represented as a set of static graphs, each of which corresponds to a certain timestamp. Dynamic graphs allow one to track changes in the network and mark them as legitimate or illegitimate. The choice of key parameters of the developed model is based on the practical experience of researchers involved in the detection of different attacks in ad hoc networks, which makes the model a priori focused on subsequent security analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

REFERENCES

  1. Kalinin, M.O., Zubkov, E.A., Suprun, A.F., and Pechenkin, A.I., Prevention of attacks on dynamic routing in self-organizing adhoc networks using swarm intelligence, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 977–983.  https://doi.org/10.3103/S0146411618080163

    Article  Google Scholar 

  2. Jhaveri, R.H., Patel, S.J., and Jinwala, D.C., DoS attacks in mobile ad hoc networks: A survey, Second Int. Conf. on Advanced Computing & Communication Technologies, Rohtak, India, 2012, IEEE, 2012, pp. 535–541.  https://doi.org/10.1109/ACCT.2012.48

  3. Hamdi, M.M., Audah, L., Abood, M.S., Rashid, S.A., Mustafa, A.S., Mahdi, H., and Al-Hiti, A.S., A review on various security attacks in vehicular ad hoc networks, Bull. Electr. Eng. Inf., 2021, vol. 10, no. 5, pp. 2627–2635. https://doi.org/10.11591/eei.v10i5.3127

    Article  Google Scholar 

  4. Harary, F. and Gupta, G., Dynamic graph models, Math. Comput. Modell. 1997, vol. 25, no. 7, pp. 79–87.  https://doi.org/10.1016/S0895-7177(97)00050-2

    Article  MathSciNet  MATH  Google Scholar 

  5. Zhang, D. and Sterbenz, J.P., Modelling critical node attacks in MANETs, Self-Organizing Systems. IWSOS 2013, Elmenreich, W., Dressler, F., and Loreto, V., Eds., Lecture Notes in Computer Science, vol. 8221, Berlin: Springer, 2014, pp. 127–138.  https://doi.org/10.1007/978-3-642-54140-7_11

    Book  Google Scholar 

  6. Kovun, V.A. and Kashira, I.L., Quantitative approach to evaluating the influence of literary works using the graph theory, Vestn. Voronezhskogo Gos. Univ. Ser.: Sist. Anal. Inf. Tekhnol., 2019, no. 3, pp. 177–185.

  7. Freeman, L.C., A set of measures of centrality based upon betweenness, Sociometry, 1977, vol. 40, no. 1, pp. 35–41.  https://doi.org/10.2307/3033543

    Article  Google Scholar 

  8. Shcherbakova, N., Measures of centrality in networks, Probl. Inf., 2015, no. 2, pp. 18–30.

  9. Chen, P., Xie, H., Maslov, S., and Redner, S., Finding scientific gems with Google’s PageRank algorithm, J. Informetrics, 2007, vol. 1, no. 1, pp. 8–15.  https://doi.org/10.1016/j.joi.2006.06.001

    Article  Google Scholar 

  10. Brin, S. and Page, L., The anatomy of a large-scale hypertextual Web search engine, Comput. Networks ISDN Syst., 1998, vol. 30, nos. 1–7, pp. 107–117.  https://doi.org/10.1016/S0169-7552(98)00110-X

  11. Zhang, Sh., Zhang, Zh., Liu, Ch., Gu, W., Yang, Ch., Fang, Yu., and Wang, J., Vulnerabilities of mobile ad hoc network using centrality metrics, 2017 Int. Conf. on Computer Technology, Electronics and Communication (ICCTEC), Dalian, China, 2017, IEEE, 2017, pp. 1370–1373.  https://doi.org/10.1109/ICCTEC.2017.00300

  12. Dietzel, S., Petit, J., Heijenk, G., and Kargl, F., Graph-based metrics for insider attack detection in VANET multihop data dissemination protocols, IEEE Trans. Veh. Technol., 2013, vol. 62, no. 4, pp. 1505–1518. https://doi.org/10.1109/TVT.2012.2236117

    Article  Google Scholar 

  13. Rmayti, M., Begriche, Y., Khatoun, R., Khoukhi, L., and Mammeri, A., Graph-based wormhole attack detection in mobile ad hoc networks (MANETs), Fourth Int. Conf. on Mobile and Secure Services (MobiSecServ), Miami Beach, Fla., 2018, IEEE, 2018, pp. 1–6.  https://doi.org/10.1109/MOBISECSERV.2018.8311439

  14. Zegzhda, D., Kalinin, M., Krundyshev, V., Lavrova, D., Moskvin, D., and Pavlenko, E., Application of bioinformatics algorithms for polymorphic cyberattacks detection, Inf. Avtom., 2021, vol. 20, no. 4, pp. 820–844.  https://doi.org/10.15622/ia.20.4.3

    Article  Google Scholar 

  15. Kalinin, M. and Krundyshev, V., Sequence alignment algorithms for intrusion detection in the internet of things, Nonlinear Phenom. Complex Syst., 2020, vol. 23, no. 4, pp. 397–404.  https://doi.org/10.33581/1561-4085-2020-23-4-397-404

    Article  Google Scholar 

  16. Zegzhda, P., AI-based security for the smart networks, SIN 2020: 13th Int. Conf. on Security of Information and Networks, Merkez, Turkey, 2020, Örs, B. and Elçi, A., Eds., New York: Association for Computing Machinery, 2020, p. 22.  https://doi.org/10.1145/3433174.3433593

  17. Kalinin, M., Krundyshev, V., and Zegzhda, D., AI methods for neutralizing cyber threats at unmanned vehicular ecosystem of smart city, The Economics of Digital Transformation, Devezas, T., Leitão, J., and Sarygulov, A., Eds., Studies on Entrepreneurship, Structural Change and Industrial Dynamics, Cham: Springer, 2021, pp. 157–171.  https://doi.org/10.1007/978-3-030-59959-1_10

  18. Kalinin, M., Krundyshev, V., and Zegzhda, P., Cybersecurity risk assessment in smart city infrastructures, Machines, 2021, vol. 9, no. 4, p. 78.  https://doi.org/10.3390/machines9040078

    Article  Google Scholar 

  19. Borgatti, S.P., Identifying sets of key players in a social network, Comput. Math. Organ. Theory, 2006, vol. 12, no. 1, pp. 21–34.  https://doi.org/10.1007/s10588-006-7084-x

    Article  MATH  Google Scholar 

Download references

Funding

The research is funded by the Russian Science Foundation, project no. 22-21-20008, https://rscf.ru/project/22-21-20008/.

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, 195251, St. Petersburg, Russia

    E. Yu. Pavlenko

Authors
  1. E. Yu. Pavlenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Yu. Pavlenko.

Ethics declarations

The author declares that he has no conflicts of interest.

Additional information

Translated by I. Obrezanova

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pavlenko, E.Y. Functional Model of Adaptive Network Topology of Large-Scale Systems Based on Dynamical Graph Theory. Aut. Control Comp. Sci. 56, 1016–1024 (2022). https://doi.org/10.3103/S0146411622080168

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411622080168

Keywords:

Search

Navigation