<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mireabulletin</journal-id><journal-title-group><journal-title xml:lang="ru">Russian Technological Journal</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Technological Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-3210</issn><issn pub-type="epub">2500-316X</issn><publisher><publisher-name>RTU MIREA</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32362/2500-316X-2026-14-1-19-30</article-id><article-id custom-type="edn" pub-id-type="custom">TXHMHW</article-id><article-id custom-type="elpub" pub-id-type="custom">mireabulletin-1369</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАЦИОННЫЕ СИСТЕМЫ. ИНФОРМАТИКА. ПРОБЛЕМЫ ИНФОРМАЦИОННОЙ БЕЗОПАСНОСТИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION SYSTEMS. COMPUTER SCIENCES. ISSUES OF INFORMATION SECURITY</subject></subj-group></article-categories><title-group><article-title>Выделение потока сообщений между двумя абонентами в многоагентных системах на основе анализа его контекстуальных характеристик</article-title><trans-title-group xml:lang="en"><trans-title>Identification of the message flow between two subscribers in multi-agent systems based on the analysis of its contextual characteristics</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-4099-1414</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Таныгин</surname><given-names>М. О.</given-names></name><name name-style="western" xml:lang="en"><surname>Tanygin</surname><given-names>M. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Таныгин Максим Олегович - д.т.н., доцент, декан факультета фундаментальной и прикладной информатики.</p><p>305040, Курск, ул. 50 лет Октября, д. 94</p><p>Scopus Author ID 19640649200</p><p>ResearcherID N-7689-2016</p></bio><bio xml:lang="en"><p>Maxim O. Tanygin - Dr. Sci. (Eng.), Associate Professor, Dean of the Faculty of Fundamental and Applied Informatics, Southwest State University.</p><p>94, 50 Let Oktyabrya ul., Kursk, 305040</p><p>Scopus Author ID 19640649200</p><p>ResearcherID N-7689-2016</p></bio><email xlink:type="simple">tanygin@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0006-8883-1731</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мишин</surname><given-names>И. О.</given-names></name><name name-style="western" xml:lang="en"><surname>Mishin</surname><given-names>I. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Мишин Илья Олегович - аспирант, кафедра информационной безопасности.</p><p>305040, Курск, ул. 50 лет Октября, д. 94</p><p>ResearcherID MXJ-7912-2025</p></bio><bio xml:lang="en"><p>Ilya O. Mishin - Postgraduate Student, Department of Information Security, Southwest State University.</p><p>94, 50 Let Oktyabrya ul., Kursk, 305040</p><p>ResearcherID MXJ-7912-2025</p></bio><email xlink:type="simple">mishin.ilya46@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8270-564X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кулешова</surname><given-names>Е. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Kuleshova</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Кулешова Елена Александровна - к.т.н., доцент, кафедра информационной безопасности.</p><p>305040, Курск, ул. 50 лет Октября, д. 94</p><p>Scopus Author ID 57216349335</p><p>ResearcherID AAI-9214-2021</p></bio><bio xml:lang="en"><p>Elena A. Kuleshova - Cand.Sci. (Eng.), Associate Professor,Department of Information Security, Southwest State University.</p><p>94, 50 Let Oktyabrya ul., Kursk, 305040</p><p>Scopus Author ID 57216349335</p><p>ResearcherID AAI-9214-2021</p></bio><email xlink:type="simple">lena.kuleshova.94@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-7228-0281</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Киселев</surname><given-names>А. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Kiselev</surname><given-names>A. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Киселев Алексей Викторович - к.т.н., доцент, кафедра вычислительной техники.</p><p>305040, Курск, ул. 50 лет Октября, д. 94</p><p>Scopus Author ID 57337411000</p><p>ResearcherID S-9914-2018</p></bio><bio xml:lang="en"><p>Alexey V. Kiselev - Cand. Sci. (Eng.), Associate Professor, Computer Engineering Department, Southwest State University.</p><p>94, 50 Let Oktyabrya ul., Kursk, 305040</p><p>Scopus Author ID 57337411000</p><p>ResearcherID S-9914-2018</p></bio><email xlink:type="simple">kiselevalexey1990@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Юго-Западный государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Southwest State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>05</day><month>02</month><year>2026</year></pub-date><volume>14</volume><issue>1</issue><fpage>19</fpage><lpage>30</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Таныгин М.О., Мишин И.О., Кулешова Е.А., Киселев А.В., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Таныгин М.О., Мишин И.О., Кулешова Е.А., Киселев А.В.</copyright-holder><copyright-holder xml:lang="en">Tanygin M.O., Mishin I.O., Kuleshova E.A., Kiselev A.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rtj-mirea.ru/jour/article/view/1369">https://www.rtj-mirea.ru/jour/article/view/1369</self-uri><abstract><sec><title>Цели</title><p>Цели. В статье исследуется задача повышения точности выделения потока сообщений между двумя абонентами в многоагентных системах на основе анализа контекстуальных характеристик общего потока сообщений в канале связи. При проведении процедур определения источника и установления его подлинности могут возникать коллизии кодов аутентификации двух и более сообщений. Одним из способов разрешения подобных ситуаций является выделение потока сообщений между двумя абонентами на основе его статистических характеристик, отличающихся от характеристик общего потока сообщений в системе. Цель работы – разработка метода, позволяющего надежно идентифицировать целевой поток в случае возникновения коллизий кодов аутентификации.</p></sec><sec><title>Методы</title><p>Методы. Для анализа и выделения паттернов активности агентов в потоке сообщений использованы контекстуальные характеристики сообщений: частота отправки, размер, временные метки и исторические данные взаимодействий. Метод включает формирование статистических характеристик потока сообщений между двумя агентами многоагентной системы (коэффициенты асимметрии и эксцесса, параметры распределения количества сообщений между событиями целевого источника) и их классификацию с помощью логистической регрессии.</p></sec><sec><title>Результаты</title><p>Результаты. В ходе проведенных экспериментов было установлено, что разработанный метод демонстрирует значения метрики Precision (полнота) в диапазоне 0.81–0.85 (от 81% до 85% сообщений, классифицированных как принадлежащие целевому источнику, действительно являются таковыми), что на 40–50% превышает показатели существующих методов, основанных на анализе межпакетных интервалов времени. ROC-анализ подтвердил высокую эффективность модели и приемлемое качество классификации.</p></sec><sec><title>Выводы</title><p>Выводы. Результаты исследования показали, что использование контекстуальных характеристик и статистического анализа позволяет точно выделять целевые потоки при общем числе агентов в многоагентных системах от 70 до 110. Метод может применяться в каналах связи с низкой пропускной способностью, где необходимо минимизировать размер заголовочных частей передаваемых пакетов данных и вычислительные затраты на выполнение процедур аутентификации.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The paper examines the problem of improving the accuracy of identifying the message flow between two subscribers in multi-agent systems. This is done by analyzing the contextual characteristics of the overall message flow in the communication channel. Situations may arise during the process of source identification and verification of authenticity in which authentication codes for two or more messages collide. One way to resolve such conflicts is to isolate the message flow between two subscribers by leveraging its unique statistical characteristics which differ from the characteristics of the general message flow within the system. The aim of the paper is to develop a method which reliably identifies the target message flow even in cases of authentication code collisions.</p></sec><sec><title>Methods</title><p>Methods. The contextual characteristics of messages are used, in order to analyze and highlight patterns of agent behavior in the message flow. These characteristics include frequency of sending, message size, timestamps, and historical interaction data. The method involves the formation of statistical characteristics of the message flow between two agents in a multi-agent system, such as skewness and kurtosis, as well as distribution parameters for the number of messages sent between events from the target source along with their classification by means of logistic regression.</p></sec><sec><title>Results</title><p>Results. During experiments, the method developed has been found to demonstrate a Precision metric value in the range of 0.81–0.85. This is 40–50% higher than existing methods based on the analysis of inter-packet time intervals, indicating that 81–85% of the messages classified as belonging to the target source are actually such. ROC analysis confirmed the high efficiency of the model and acceptable classification quality.</p></sec><sec><title>Conclusions</title><p>Conclusions. The results of the study show that the use of contextual characteristics and statistical analysis enables the accurate identification of target flows in multi-agent systems with a total number of agents ranging from 70 to 110. This method can be used in low-bandwidth communication channels where it is essential to minimize the size of the transmitted batch header and computational costs associated with authentication procedures.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>многоагентные системы</kwd><kwd>контекстуальные характеристики</kwd><kwd>бинарная классификация</kwd><kwd>логистическая регрессия</kwd><kwd>асимметрия</kwd><kwd>эксцесс</kwd><kwd>ROC-анализ</kwd></kwd-group><kwd-group xml:lang="en"><kwd>multi-agent systems</kwd><kwd>contextual characteristics</kwd><kwd>binary classification</kwd><kwd>logistic regression</kwd><kwd>skewness</kwd><kwd>kurtosis</kwd><kwd>ROC analysis</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Öztürk G., Saran N., Doğanaksoy A. Modified Attribute-Based Authentication for Multi-Agent Systems. Int. J. Inform. Security Sci. 2023;12(3):1–13. https://doi.org/10.55859/ijiss.1294580</mixed-citation><mixed-citation xml:lang="en">Öztürk G., Saran N., Doğanaksoy A. Modified Attribute-Based Authentication for Multi-Agent Systems. Int. J. Inform. Security Sci. 2023;12(3):1–13. https://doi.org/10.55859/ijiss.1294580</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кулешова Е.А., Марухленко А.Л., Добрица В.П., Таныгин М.О., Плугаторев А.В. Вариант алгоритма генерации псевдослучайных двоичных последовательностей, основанный на свойствах линейных клеточных автоматов. Прикаспийский журнал: управление и высокие технологии. 2021;54(2):62–70. https://doi.org/10.21672/2074-1707.2021.53.1.062-070</mixed-citation><mixed-citation xml:lang="en">Kuleshova E.A., Maruhlenko A.L., Dobritsa V.P., Tanygin M.O., Plugatorev A.V. A variant of the algorithm for generating pseudorandom binary sequences based on the properties of linear cellular automata. Prikaspiiskii zhurnal: upravlenie i vysokie tekhnologii = Caspian Journal: Control and High Technologies. 2021;54(2):62–70 (in Russ.). https://doi.org/10.21672/2074-1707.2021.53.1.062-070</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Таныгин М.О., Кулешова Е.А., Митрофанов А.В., Гладилина Е.Ю. Повышение скорости обнаружения ошибок при формировании цепочек блоков данных на основе анализа числа совпадений хешей. Прикаспийский журнал: управление и высокие технологии. 2022;1(57):85–93. https://doi.org/10.54398/2074-1707_2022_1_85</mixed-citation><mixed-citation xml:lang="en">Tanygin M.O., Kuleshova E.A., Mitrofanov A.V., Gladilina E.U. Increasing the speed of error detection when forming data block chains based on the analysis of the number of hash matches. Prikaspiiskii zhurnal: upravlenie i vysokie tekhnologii = Caspian Journal: Control and High Technologies. 2022;1(57):85–93 (in Russ.). https://doi.org/10.54398/2074-1707_2022_1_85</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Yuan J., Yang J., Zhou S., Wang C. Efficient Group Authentication with Multiple Authentications on Resource-Limited Devices. J. Supercomput. 2025;81:929. https://doi.org/10.1007/s11227-025-07404-6</mixed-citation><mixed-citation xml:lang="en">Yuan J., Yang J., Zhou S., Wang C. Efficient Group Authentication with Multiple Authentications on Resource-Limited Devices. J. Supercomput. 2025;81:929. https://doi.org/10.1007/s11227-025-07404-6</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Gopirajan P.V., Mani K. Secure Multi-Authentication using Blockchain-Technology in Cloud based Internet of Things. Telematique. 2022;21(1):6640–6650.</mixed-citation><mixed-citation xml:lang="en">Gopirajan P.V., Mani K. Secure Multi-Authentication using BlockchainTechnology in Cloud based Internet of Things. Telematique. 2022;21(1):6640–6650.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Wee A.K., Chekole E.G., Zhou J. Excavating Vulnerabilities Lurking in Multi-Factor Authentication Protocols: A Systematic Security Analysis. arXiv Cornell University. 2024;2407(20459):1–24. https://doi.org/10.48550/arXiv.2407.20459</mixed-citation><mixed-citation xml:lang="en">Wee A.K., Chekole E.G., Zhou J. Excavating Vulnerabilities Lurking in Multi-Factor Authentication Protocols: A Systematic Security Analysis. arXiv Cornell University. 2024;2407(20459):1–24. https://doi.org/10.48550/arXiv.2407.20459</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Chenchev I. Framework for Multi-factor Authentication with Dynamically Generated Passwords. In: Arai K. (Ed.). Advances in Information and Communication. FICC 2023. Lecture Notes in Networks and Systems. Springer; 2023. V. 652. P. 563–576. https://doi.org/10.1007/978-3-031-28073-3_39</mixed-citation><mixed-citation xml:lang="en">Chenchev I. Framework for Multi-factor Authentication with Dynamically Generated Passwords. In: Arai K. (Ed.). Advances in Information and Communication. FICC 2023. Lecture Notes in Networks and Systems. Springer; 2023. V. 652. P. 563–576. https://doi.org/10.1007/978-3-031-28073-3_39</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Li H., Han D. Blockchain-assisted secure message authentication with reputation management for VANETs. J. Supercomput. 2023;79(17):19903–19933. https://doi.org/10.1007/s11227-023-05394-x</mixed-citation><mixed-citation xml:lang="en">Li H., Han D. Blockchain-assisted secure message authentication with reputation management for VANETs. J. Supercomput. 2023;79(17):19903–19933. https://doi.org/10.1007/s11227-023-05394-x</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Xu Y., Jian X., Li T., Zou S., Li B. Blockchain-Based Authentication Scheme with an Adaptive Multi-Factor Authentication Strategy. Mobile Inform. Syst. 2023;2023:4764135. https://doi.org/10.1155/2023/4764135</mixed-citation><mixed-citation xml:lang="en">Xu Y., Jian X., Li T., Zou S., Li B. Blockchain-Based Authentication Scheme with an Adaptive Multi-Factor Authentication Strategy. Mobile Inform. Syst. 2023;2023:4764135. https://doi.org/10.1155/2023/4764135</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Liu J., Mu Q., Che R., et al. Multi-participant quantum anonymous communication based on high-dimensional entangled states. Physica Scripta. 2024;99(9):095109. https://doi.org/10.1088/1402-4896/ad69d9</mixed-citation><mixed-citation xml:lang="en">Liu J., Mu Q., Che R., et al. Multi-participant quantum anonymous communication based on high-dimensional entangled states. Physica Scripta. 2024;99(9):095109. https://doi.org/10.1088/1402-4896/ad69d9</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Кулешова Е.А., Таныгин М.О. Исследование характеристик современных генераторов псевдослучайных последовательностей. Телекоммуникации. 2023;7:28–39. https://doi.org/10.31044/1684-2588-2023-0-7-28-39</mixed-citation><mixed-citation xml:lang="en">Kuleshova E.A., Tanygin M.O. Study of characteristics of modern generators of pseudorandom sequences. Telekommunikatsii = Telecommunications. 2023;7:28–39 (in Russ.). https://doi.org/10.31044/1684-2588-2023-0-7-28-39</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Таныгин М.О. Восстановление порядка следования информационных пакетов на основе анализа хеш-последовательностей. Известия Юго-Западного государственного университета. 2020;24(1):175–188.</mixed-citation><mixed-citation xml:lang="en">Tanygin M.O. Restoring the order of information packets based on hash sequence analysis. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta = Proceedings of the Southwest State University. 2020;24(1):175–188 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Alamgir N., Negati S., Bright C. SHA-256 Collision Attack with Programmatic SAT. arXiv Cornell University. 2024;2406.20072. https://doi.org/10.48550/arXiv.2406.20072</mixed-citation><mixed-citation xml:lang="en">Alamgir N., Negati S., Bright C. SHA-256 Collision Attack with Programmatic SAT. arXiv Cornell University. 2024;2406.20072. https://doi.org/10.48550/arXiv.2406.20072</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Fang Y.Aresearch on different digital signature schemes. Appl.Comput.Eng. 2023;16(1):27–35. http://doi.org/10.54254/2755-2721/16/20230855</mixed-citation><mixed-citation xml:lang="en">Fang Y.Aresearch on different digital signature schemes. Appl.Comput.Eng. 2023;16(1):27–35. http://doi.org/10.54254/2755-2721/16/20230855</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Phatangare S., Jadhav S., Kawane S., Holkar P., Gaikwad P. Multi-Level Encryption System using AES and RSAAlgorithms. Int. J. Res. Appl. Sci. Eng. Technol. 2024;15(5):4043–4051. https://doi.org/10.22214/IJRASET.2024.62420</mixed-citation><mixed-citation xml:lang="en">Phatangare S., Jadhav S., Kawane S., Holkar P., Gaikwad P. Multi-Level Encryption System using AES and RSAAlgorithms. Int. J. Res. Appl. Sci. Eng. Technol. 2024;15(5):4043–4051. https://doi.org/10.22214/IJRASET.2024.62420</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Tanygin M.O., Alshaeaa H.Y., Kuleshova E.A. A method of the transmitted blocks information integrity control. Radio Electronics, Computer Science, Control. 2020;1:181–189.</mixed-citation><mixed-citation xml:lang="en">Tanygin M.O., Alshaeaa H.Y., Kuleshova E.A. A method of the transmitted blocks information integrity control. Radio Electronics, Computer Science, Control. 2020;1:181–189.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Tao M., Li Q., Yu J. Multi-Objective Dynamic Path Planning with Multi-Agent Deep Reinforcement Learning. J. Marin. Sci. Eng. 2025;13(1):20. https://doi.org/10.3390/jmse13010020</mixed-citation><mixed-citation xml:lang="en">Tao M., Li Q., Yu J. Multi-Objective Dynamic Path Planning with Multi-Agent Deep Reinforcement Learning. J. Marin. Sci. Eng. 2025;13(1):20. https://doi.org/10.3390/jmse13010020</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Morais D., Zuquete A., Mendes A. Adaptive, Multi-Factor Authentication as a Service for Web Applications. In: 2023 7th Cyber Security in Networking Conference (CSNet). 2023. P. 74–80. http://doi.org/10.1109/CSNet59123.2023.10339695</mixed-citation><mixed-citation xml:lang="en">Morais D., Zuquete A., Mendes A. Adaptive, Multi-Factor Authentication as a Service for Web Applications. In: 2023 7th Cyber Security in Networking Conference (CSNet). 2023. P. 74–80. http://doi.org/10.1109/CSNet59123.2023.10339695</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Плугатарев А.В. Модель определения источника сообщений на основе статистического анализа метаданных в открытом канале связи. Прикаспийский журнал: управление и высокие технологии. 2022;4(60):30–37.</mixed-citation><mixed-citation xml:lang="en">Plugatarev A.V. Model for determining the message source by statistical analysis of metadata in an open communication channel. Prikaspiiskii zhurnal: upravlenie i vysokie tekhnologii = Caspian Journal: Control and High Technologies. 2022;4(60):30–37 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Dharrao D., Gaikwad P., Gawai S.V., Bongale A.M., Patel K., Singh A. Classifying SMS as spam or ham: Leveraging NLP and machine learning techniques. Int. J. Saf. Secur. Eng. 2024;14(1):289–296. https://doi.org/10.18280/ijsse.140128</mixed-citation><mixed-citation xml:lang="en">Dharrao D., Gaikwad P., Gawai S.V., Bongale A.M., Patel K., Singh A. Classifying SMS as spam or ham: Leveraging NLP and machine learning techniques. Int. J. Saf. Secur. Eng. 2024;14(1):289–296. https://doi.org/10.18280/ijsse.140128</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Placzek B. A Multi-Agent Prediction Method for Data Sampling and Transmission Reduction in Internet of Things Sensor Networks. Sensors. 2023;23(20):8478. https://doi.org/10.3390/s23208478</mixed-citation><mixed-citation xml:lang="en">Placzek B. A Multi-Agent Prediction Method for Data Sampling and Transmission Reduction in Internet of Things Sensor Networks. Sensors. 2023;23(20):8478. https://doi.org/10.3390/s23208478</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Vedmiediev D., Shapoval N. Text Message Clustering. Electronics and Control Systems. 2023;4(78):16–20.</mixed-citation><mixed-citation xml:lang="en">Vedmiediev D., Shapoval N. Text Message Clustering. Electronics and Control Systems. 2023;4(78):16–20.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Katwal S., Sharma N., Kumar K. A Deep Learning Approach for Throughput Enhanced Clustering and Spectrally Efficient Resource Allocation in Ultra-Dense Networks. IEEE Trans. Netw. Service Manag. 2025;22(1):582–591. https://doi.org/10.1109/TNSM.2024.3470235</mixed-citation><mixed-citation xml:lang="en">Katwal S., Sharma N., Kumar K. A Deep Learning Approach for Throughput Enhanced Clustering and Spectrally Efficient Resource Allocation in Ultra-Dense Networks. IEEE Trans. Netw. Service Manag. 2025;22(1):582–591. https://doi.org/10.1109/TNSM.2024.3470235</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Huang X., Zhou S. QMNet: Importance-Aware Message Exchange for Decentralized Multi-Agent Reinforcement Learning. IEEE Trans. Mobile Comput. 2023;23(5):4739–4751. https://doi.org/10.1109/TMC.2023.3296726</mixed-citation><mixed-citation xml:lang="en">Huang X., Zhou S. QMNet: Importance-Aware Message Exchange for Decentralized Multi-Agent Reinforcement Learning. IEEE Trans. Mobile Comput. 2023;23(5):4739–4751. https://doi.org/10.1109/TMC.2023.3296726</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Головешкин В.А., Жукова Г.Н., Ульянов М.В., Фомичев М.И. Использование квантильных коэффициентов асимметрии и эксцесса для оценки сложности решения задачи коммивояжера. Int. J. Open Inform. Technol. 2016;4(12):7–12. https://elibrary.ru/xetabh</mixed-citation><mixed-citation xml:lang="en">Goloveshkin V.A., Zhukova G.N., Ulyanov M.V., Fomichev M.I. The estimation of the complexity of solving a particular travelling salesman problem by quantile-based measures for skewness and kurtosis. Int. J. Open Inform. Technol. 2016;4(12):7–12 (in Russ.). https://elibrary.ru/xetabh</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Таныгин М.О., Добрица В.П., Митрофанов А.В., Ахмат Х.И. Математическая интерпретация результатов когнитивного анализа метаданных сетевых пакетов. Известия Юго-Западного государственного университета. 2023;27(3):66–78.</mixed-citation><mixed-citation xml:lang="en">Tanygin M.O., Dobritsa V.P., Mitrofanov A.V., Ahmat Kh.I. Mathematical interpretation of the results of cognitive analysis of network packets metadata. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta = Proceedings of the Southwest State University. 2023;27(3):66–78 (in Russ.).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
