Technology modification for distance calculation between pairs of adjacent clusters in multilevel thresholding


DOI: 10.34759/trd-2021-118-14

Аuthors

Tanygin M. O.*, Dobroserdov O. G.**, Vlasova A. O.***, Ahmad A. A.****

South-Western State University, 94, 50-let Oktyabrya str., Kursk, 305040, Russia

*e-mail: tanygin@yandex.ru
**e-mail: serfingk@yandex.ru
***e-mail: anononanav@gmail.com
****e-mail: aliayid2013@gmail.com

Abstract

The purpose of the study consists in developing a method, algorithm and models of authenticity enhancing of the information packets source identification. This goal is achieved by extra checking the content of a special service word that is a part of the data packet for falling into the value range dynamically generated by the receiver. As the result, the number of packets, being analyzed by the receiver while identifying the source of the structured set of information packets, reduces. The article demonstrates that reduction of the number of packets being analyzed leads to the probability of identification errors origin reduction. Models for identification authenticity evaluation were developed based Markov chains apparatus. The process of information packs acceptance by the receiver from various sources is presented as a random process, in which a part of the states corresponds to the data packets processing errors occurrence, while the other part corresponds to the possibility of the reliable packets processing. The model parameters are the values range width, used for checking the data packet special word; the probability of a single data block inclusion into the structured set; the length of the structured set of data packets from the single source; the total number of data packets being processed by the receiver. The article shows that application of the method of limiting the analyzed packets set being analyzed allows enhancing identification reliability of the distributed information systems subjects, which exchange data packets of limited size. The probability of identification herewith of false source, which formed a certain structured set of packets, reduces by two or three times. In practical terms, it allows reducing the size of extra service margins in each data packet. This, in its turn, allows reducing information excessiveness of the processed data, increasing the data processing speed by the receiver, and reducing the size of both internal register memory and random-access memory of the receiver.

Keywords:

Markov chain, mathematical modeling, messages receiver, network packet, identification

References

  1. Bukharin V.V., Dvoryadkin V.V., Pikalov E.D. et al. Patent RU 2547628 S2, 10.04.2015.

  2. Bukharin V.V., Kazachkin A.V., Karaichev S.Yu. et al. Patent RU 2710284 C1, 25.12.2019.

  3. Gorokhov Aleksei, Kkhandekar Aamod, Borran Mokhammad D., Prakash Radzhat. Patent RU 2419219 S2, 20.05.2011.

  4. Spevakov A.G., Kalutskii I.V. Trudy MAI, 2020, no. 115. URL: http://trudymai.ru/eng/published.php?ID=11993. DOI: 10.34759/trd-2020-115-13

  5. Predvaritel’nyi natsional’nyi standart RF. Informatsionnye tekhnologii. Internet veshchei. Protokol obmena dlya vysokoemkikh setei s bol’shim radiusom deistviya i nizkim energopotrebleniem (Preliminary national standard of the Russian Federation. Information technology. Internet of Things. Exchange protocol for high-capacity networks with a long range and low power consumption). URL: http://docs.cntd.ru/document/554596382

  6. 802.15.4-2015. IEEE Standard for Low-Rate Wireless Personal Area Networks, IEEE Computer Society. DOI: 10.1109/ieeestd.2016.7460875

  7. Black J., Rogaway P. CBC MACs for arbitrary-length messages: The three-key constructions, Journal of Cryptology, 2005, vol. 18, no. 2, pp. 111 — 131.

  8. Stallings W. NIST Block Cipher Modes of Operation for Confidentiality, Cryptologia, 2010, no. 34 (2), pp. 163 — 175. DOI: 10.1080/01611190903185401

  9. Borzov D.B., Dyubryuks S.A., Sokolova Yu.V. Trudy MAI, 2020, no. 114. URL: http://trudymai.ru/eng/published.php?ID=118998. DOI: 10.34759/trd-2020-114-13

  10. Mytsko E.A., Mal’chukov A.N., Ivanov S.D. Pribory i sistemy. Upravlenie, kontrol’, diagnostika, 2018, no. 6, pp. 22 — 29.

  11. Xie J., Pan X. An improved rc4 stream cipher, International Conference on Computer Application and System Modeling, 2010. DOI: 10.1109/IC-CASM.2010.5620800

  12. Allouch A., Cheikhrouhou O., Koubaa A. MAVSec: Securing the MAVLink Protocol for Ardupilot/PX4 Unmanned Aerial Systems, International Wireless Communications and Mobile Computing Conference (IWCMC), Morrocco, 2019. DOI: 10.1109/IWCMC.2019.8766667

  13. Bespilotnye aviatsionnye sistemy. Chast’ 3. Ekspluatatsionnye protsedury, Standart ISO 21384-3:2019 (E). URL: https://cdn.standards.iteh.ai/sam-ples/70853/7ec34c8a22bf46958423b7e3a2e43693/ISO-21384-3-2019.pdf

  14. Zhao J., Cheng D., Hao Ch. An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle, Mathematical Problems in Engineering, 2016, no. 12. DOI: 10.1155/2016/7672839

  15. Iwata T., Kurosawa K. OMAC: one-key CBC MAC, Fast Software Encryption, 2003, pp. 129 — 153. DOI: 10.1007/978-3-540-39887-5_11

  16. Liu C., Ji J., Liu Z. Implementation of DES Encryption Arithmetic based on FPGA, AASRI Procedia, 2013, vol. 5, pp. 209 — 213. DOI: 10.1016/j.aasri.2013.10.080

  17. Tanygin M.O., Alshaia Kh.Ya Telekommunikatsii, 2020, no. 1, pp. 2 — 9.

  18. Tanygin M.O. Teoreticheskie osnovy identifikatsii istochnikov informatsii, peredavaemoi blokami ogranichennogo razmera (Theoretical basics of sources identification of information transmitted by limited size blocks), Kursk, Izd-vo Universitetskaya kniga, 2020, 198 p.

  19. Tanygin M.O., Alshaia Kh.Ya., Dobritsa V.P. Trudy MAI, 2020, no. 114. URL: http://trudymai.ru/eng/published.php?ID=119007. DOI: 10.34759/trd-2020-114-155

  20. Denisenko T.I. Fundamental’nye issledovaniya, 2009, no. 1, pp. 27 — 28.

  21. Naumov V.A., Samuilov K.E., Gaidamaka Yu.V. Mul’tiplikativnye resheniya konechnykh tsepei Markova (Multiplicative solutions of finite Markov chains), Moscow, RUDN, 2015, 159 p.


    Download

mai.ru — informational site MAI

Copyright © 2000-2024 by MAI

Вход