2022 № 4(57)

CONTENTS

Zubarev A. Y. Comparison of trace and bisimulation equivalences on time Petri nets with weak time policy
Kalney A. M. Optimizing Placement of Control Devices on Channels in Monitoring Networks
Rodionov A. S. Is it possible to achieve further acceleration of the calculation of the connectivity characteristics of a random graph?
Gimadi E.Kh., Shtepa A. A. Asymptotically Optimal Approach for the Maximum Spanning Tree Problem with Given Diameter in a Complete Undirected Graph on UNI(0; 1)-Entries
Bakulina M. P. Efficient lossless compression of large information arrays
Bredikhin S. U, Lyapunov V. M., Scherbakova N. G. The hyper-network of scientific coauthorship. DB RePEc data analysis
Milihat R., Kalimoldaev M., Abdildaeva A., Otman M. How Artificial Intelligence is Revolutionizing the Marketing
Malyshkin * ** ***V.E.,Chmil**A.V. , Perepelkin*’** ***V. A. Dynamic Load Balancing Algorithms Application Automation Subsystem Development for LuNA System
Shakhov V. K, Chen H., Yurgenson A. N., Loshkarev A. V. On reliability of linear wireless sensor networks

A. P. Ershov Institute of Informatics Systems, 630090, Novosibirsk, Russia

COMPARISON OF TRACE AND BISIMULATION EQUIVALENCES ON TIME PETRI NETS WITH WEAK TIME POLICY

DOI: 10.24412/2073-0667-2022-4-5-27

EDN: BQQUXA

The security of many information and computer systems is critically important, since their failure can lead to large losses. Behavioral equivalences play an important role in the specification and verification both to compare distinct systems and to reduce the structure of a system without affecting its behavior. Various behavioral equivalences for concurrent and distributed systems have been promoted in the literature and the relationships between them have been fairly well-studied. Two dichotomies are usually considered when comparing the equivalences. The first dichotomy is the ‘linear time - branching time’ spectrum. Here, various possibilities of taking into account the choice points between the alternative actions of systems are discussed.

Alternative choice points are completely ignored in the linear time semantics. As a result, the system behavior is described by the set of all sequences of system actions. Trace equivalence is a typical example of linear time equivalence. The standard example of branching time equivalence is bisimulation assuming that systems should behave in the same way, mutually simulating each other. Bisimulation carefully takes into account the branching structure of the systems behaviors. The second dichotomy is the so-called ‘interleaving - partial’ order spectrum. Here, it determines how to take into account partial order representing causal dependences between system actions. The essence of the interleaving approach is to represent the concurrency relation as a nondeterministic choice between the executions of linearly ordered actions, rather than directly. The advantage of the interleaving interpretation of concurrency is its simplicity, mathematical elegance, and allowing for the analysis of some safety and liveness properties of systems. However the difference between concurrency and nondeterminism is lost. A way to overcome the limitations of the interleaving approach is to model concurrency as a lack of causality dependence between system actions, which is presented, as a rule, by a partial order.

In the step semantics located between the boundaries of the spectrum, concurrency is presented as a step - a set of concurrent actions.

Petri nets (PN) is one of the generally accepted models for analysis of concurrent and distributed systems. The PN consists of two different sets of elements - places and transitions and a labeling function mapping each transition to an action. A state of the PN is called a marking - a subset of places that receive tokens when the net functions. A transition is enabled at a marking if the input places of the transition contain tokens. The firing of a transition enabled at a marking results in the new marking in which tokens are consumed from the input places and tokens are produced to the output places of the transition.

In verification systems, there is an obvious need for considering time. Different timed extensions of Petri nets have been proposed. Time Petri Nets (TPNs) are now a well-established model to describe and study safety-critical systems that require verification of real time (quantitative) characteristics, in addition to functional (qualitative) properties. In the TPN, each transition is associated with a time interval. With that, each transition is assumed to have its own local clock. A state of the TPN contains a current marking and readings of the local clocks of enabled transitions. A transition can fire from a state only if the transition is enabled at the corresponding marking and its clock reaches a moment in time that is within the interval associated. So, the firing of an enabled transition can be suspended for a certain time. Along with that, the firing itself takes no time. State changes are divided in two types: either time elapses, i.e. the clocks of enabled transitions go forward, or a transition fires, i.e. a current marking is changed to a new one and the clocks of the transitions that become enabled at the new marking (newly enabled transitions) are reset to zero.

There are two policies of time elapsing in TPNs, which define strong and weak semantics. In the former semantics, time elapsing cannot exceed the upper bounds of enabled transitions and, therefore, an enabled transition must fire no later than the upper bound of its time interval is reached. On the contrary, any time elapsing is allowed in the latter semantics and, therefore, enabled transitions are not forced to fire. It is known that the two semantics are incomparable w.r.t. timed weak bisimulation.

Memory policies in TPNs determine when the local clocks of enabled transitions are reset. Intermediate and atomic memory policies are put forward in the literature. The former treats intermediary marking, i.e. the marking after consumption of tokens from the input places and before production of tokens to the output places of a transition t that fires. A transition t' is regarded as newly enabled and its clock is reset to zero after the firing of t whenever t' is disabled at the intermediary marking and becomes enabled at the new marking, i.e. after production of tokens to the output places of t. Instead, the latter policy considers a firing as one-step. The clock of t' is reset to zero only if it is disabled at the marking before t fires and becomes enabled at the new marking after t fires. It is known that the marking reachability/coverability and boundedness problems are undecidable for time Petri nets with strong semantics and any memory policy, whereas the problems are decidable in the case of TPNs with weak intermediate semantics but not with weak atomic semantics.

The aim of this paper is to define trace and bisimulation equivalences in the dichotomy of ‘interleaving — partial order’ in terms of time Petri nets with weak time and intermediate memory policies.

Key words: time Petri nets, weak time semantics, intermediate memory policy, behavioral equivalences, interleaving semantics, step semantics, partial order semantics, time processes, trace and bisimulation equivalences.

References

1. Tarasyuk, I.V. Equivalences for behavioral analysis of concurrent and distributed computing systems // Academic Publishing House Geo, 2007.

2. Boyer M., Roux O.H. Comparison of the expressiveness of arc, place and transition time Petri nets // International Conference on Application and Theory of Petri Nets. 2007. pp. 63-82.

3. Berard B., Cassez F., Haddad S., Lime D., Roux O.H. Comparison of different semantics for time Petri nets // International Symposium on Automated Technology for Verification and Analysis. 2005. pp. 293-307.

4. Reynier P.A., Sangnier A. Weak time Petri nets strike back! // International Conference on Concurrency Theory. 2009. pp. 557-571.

5. Virbitskaite I. B., Zubarev A. Y. ‘True concurrency’ semantics for time Petri nets with weak time and persistent atomic policies // Programming and Computer Software, 47(5), 2021. pp. 389-401.

6. Virbitskaite I., Bushin D., Best E. True concurrent equivalences in time Petri nets // Fundamenta Informaticae, 149(4), 2016. pp. 401-418.

Bibliographic reference: Zubarev A. Y. Comparison of trace and bisimulation equivalences on time Petri nets with weak time policy //journal “Problems of informatics”. 2022, № 4. P.5-27. DOI:10.24412/2073-0667-2022-4- 5-27. EDN: BQQUXA

A. M. Kalney

Technograd Plus Ltd, 630087, Novosibirsk, Russia, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia

OPTIMIZING PLACEMENT OF CONTROL DEVICES ON CHANNELS IN MONITORING NETWORKS

DOI: 10.24412/2073-0667-2022-4-28-38

EDN: FBQEUC

The main task of any information control in the network is to analyze the behavior of the network and simulate options for its development based on real information. The more complex the network topology and configuration, the more information is required to conduct its adequate analysis. When analyzing or designing large monitoring networks, the problem of chosen control devices (b-nodes) for gathering information is often arised. After some pre-processing or directly b-nodes transfer information to central node (c-node) by reliable channels. One of the main indices of quality for such networks is a size of area that is under reliable monitoring, which may be estimated by MENC - a mathematical expectation of a number of nodes that are connected with one special node.

Earlier this problem of optimal placement of control devices was described in [1]. But model was limited by graph only and no algorithm was offered for optimization. In present paper random hypernet with unreliable branches are considered. Simulated annealing algorithm was applied to optimize the cost-consuming placement of b-nodes.

As need in adequate presentation of multi-layered networks is urgent, many researchers propose their models, mainly while solving special tasks. Yet there are some papers that consider the problem in general terms. Most known are such models as sandwiching graphs [2], graphs with different kinds of edges [3], and layered complex networks (LCN) [4]. All these models lacks fundamental and systematical mathematical description. At the same time, more than 30 years ago Russian scientist Vladimir Popkov invented conception of hypernets that allows description of multi-layered networks of different kinds using common basics. Unfortunately,

First mention of this model in English occurs in 2005 only [12]. Later some papers had been published concerning solving some special problems based on the hypernet model: the task of optimal placement of the monitoring devices on channels of communication network [6]; design of utility network [7, 8]; optimizing transport network [9]. Last two use random and fuzzy hypernet, respectively.

The task of accurately calculating the connectivity probability of a random network with unreliable elements belongs to the class of NP-hard ones; therefore, various approximate methods were previously used in practice, while exact calculation methods were mostly of purely academic interest. However, the development of computer technology has led to a revival of interest in the use of exact methods in practice, since it became possible in a reasonable time to calculate the reliability of small and medium-sized networks (up to tens of nodes). Of the exact methods for determining the probability of a network being connected with unreliable elements, the factorization or Moore- Shannon method is most widely known. This method consists in recursively breaking a hypernet into several simpler branches, respectively, where the vertex is “reliable” (the probability of presence becomes equal to one) and where it is removed. Recursion continues until a reliable path connecting the selected vertices is obtained, or until an unconnected secondary network is obtained; the recursion also ends when a two-vertex hypernet is received. Due to the fact that the number of recursions grows exponentially with the number of vertices, additional techniques are required to accelerate this method. The following methods are used: before calling a recursion, edges in hanging trees and in connected components that do not contain selected vertices in the secondary network are deleted, when the vertex is deleted, the network connectivity is checked and if both selected vertices are in the same connected component, then the reliability is calculated in this component, if the selected vertices lie in different components, then we get a disconnected network. In both of the above methods, the number of elements of the hypernet decreases, the reliability indicator does not change.

Classic cost-reliability model is considered for optimization. Each placement of b-node on branch changes hypernet elements. First we get b-node that split branch and also creates new edges in secondary network.

It is required to design a hypernet taking throughputs of channels and route length into account. For solving this problem we search the shortest route for each pair of nodes from X on branches of a primary network. Breadth-first search algorithm is used. By solving this problem the embedding of the secondary network into the primary is obtained, and therefore hypernet is obtained.

Various heuristic algorithms have been considered. Simulated annealing (SA) algorithm seems quite appropriate because it does not require too much calculation MENC in condition (3). As a negative example, a genetic algorithm can be cited, which requires frequent computation of this condition. On every step of SA algorithm we found solution that satisfy condition (3) by one-point random change.

This paper continues research of finding optimal placement in monitoring network. Instead of well known graph model, hypernet model are considered. Also was offered appropriate optimization algorithm. Future works may concern parallel realizations of algorithm, extension of model (e.g. adding lengths for channels), consideration of reliability maximization problem with limited number of b-nodes.

Key words: Network reliability, hypernets, optimizing placement of control devices.

References

1. Alexev S. Rodionov, Artvom M. Kalnev. Reliabilitv Polynomials in Optimizing Placement of Base Stations in Monitoring Networks // In: Proc, of the XIV International Scientific-Technical Conference “Actual Problems of Electronic Instrument Engineering” (APEIE 2018), P. 252-259

2. J. Kim and V. Vu, “Sandwiching random graphs: universality between random graph models,” Advances in Mathematics, vol. 188, no. 2, pp. 444 - 469, 2004. [Online]. Available: http://www. .

sciencedirect.com/science/article/pii/S0001870803003475

3. F. Dijkstra, B. Andree, K. Koymans, J. van der Ham, P. Grosso, and C. de Laat, „А multilayer network model based on itu-t g.805,“ Computer Networks, vol. 52, no. 10, pp. 1927 - 1937, 2008, challenges and Opportunities in Advanced Optical Networking. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1389128608000844

4. M. Kurant and P. Thiran, „Layered complex networks", Phys. Rev. Lett., vol. 96, 2006.

5. Popkov, V.K., Sokolova, O.D.: Application of Hyperneet Theory for the Networks Optimazation Problems. In: 17th IMACS World Congress, Scientific Computation, Applied Mathematics and Simulation, July 2005, Paper T4-I-42-0112.

6. A. Rodionov, O. Sokolova, A. Yurgenson, and H. Choo, “On optimal placement of the monitoring devices on channels of communication network,” in Computational Science and Its Applications - ICCSA 2009, O. Gervasi, D. Taniar, B. Murgante, A. Lagana, Y. Mun, and M. L. Gavrilova, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 465-478.

7. Guljigit Toktoshov, Anastasiya Yurgenson, Denis Migov Design of Utility Network Subject to Reliability Constraint// Proc, of International Multi-Conference on Engineering, Computer and Information Sciences, IEEE SIBIRCON 2017, Novosibirsk, Russia, 18-22 Sept. 2017 - P. 172-17.

8. Gulzhigit Y. Toktoshov, Anastasia N. Yurgenson and Denis A. Migov On a Problem of the Utility Network Design // Proc, of OPTA-SCL 2018, (Springer), 8-14 July.2018, vol.2098, P.385-395

9. К. E. Garbuzov, “Some problems of fuzzy networks modeling,” in Computational Science and Its Applications - ICCSA 2016 - 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part I, ser. Lecture Notes in Computer Science, O. Gervasi, B. Murgante, S. Misra, A. M. A. C. Rocha, С. M. Torre, D. Taniar, В. O. Apduhan, E. N. Stankova, and S. Wang, Eds., vol. 9786. Springer, 2016, pp. 529535. [Online]. Available: https://doi.org/10.1007/978-3-319-42085-l_42

10. Valiant L.G. The complexity of computing the permanent // Theor. Comput. Sci. - 1979. - P. 189 - 201.

11. A.S. Rodionov, D.A. Migov. Obtaining and Using Cumulative Bounds of Network Reliability // in: System reliability, C. Volosencu, editor, Chapter 5, - Intech, - P. 93-112, DOI: 10.5772/intechopen.72182

12. Popkov, V.K., Sokolova, O.D.: Application of Hyperneet Theory for the Networks Optimazation Problems. In: 17th IMACS World Congress, Scientic Computation, Applied Mathematics and Simulation, July 2005, Paper T4-I-42-0112.

13. Rodionov, A.S., Rodionova, O.K.: Random Hypernets in Reliability Analysis of Multilayer Nel works I.eci ure Notes in Electrical Engineering, 343, 307-315 (2015).

14. Moore, E.F. & Shannon, C.E.. (1956). Reliable Circuits Using Less Reliable Relays. Journal of the Franklin Institute. 262. 191-208. 10.1016/0016-0032(56)90559-2.

Bibliographic reference: Kalney A. M. Optimizing Placement of Control Devices on Channels in Monitoring Networks //Problems of informatics. 2022, № 4. P.28-38. DOI:10.24412/2073-0667-2022-4- 28-38. EDN: FBQEUC

A. S. Rodionov

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia

IS IT POSSIBLE TO ACHIEVE FURTHER ACCELERATION OF THE CALCULATION OF THE CONNECTIVITY CHARACTERISTICS OF A RANDOM GRAPH?

DOI: 10.24412/2073-0667-2022-4-39-52

EDN: FMEYBE

The article discusses new methods for accelerating the calculation of some characteristics of the connectivity of a random graph (the probability of a subset of vertices being connected (all-terminal reliability, ATR), the average probability of pairwise connectivity (ARC), the mathematical expectation of the size of a connected subgraph containing a selected vertex (MENC), and some others). These problems have a proven non-polynomial complexity and, as a rule, approximate solutions are sought. However, with the development of computer technology and the development of parallel algorithms, finding exact solutions has become possible for graphs of a sufficiently large dimension to solve practical problems (up to hundreds of vertices in the case of a small average degree). In addition, the solutions to these problems found over the years, including various methods of reduction and decomposition by the author of the article [1-10], made it possible to further increase the dimension of the calculated graphs. Exact solutions are also needed to assess the quality of approximate algorithms.

Most explored is the task of finding ATR and two-terminal reliability (pairwise connectivity, s — t connectivity), while various tasks may require and other characteristics of network’s reliability [11] and consider different constrains, graph diameter in particular [12].

Various techniques are proposed for developing the well-known factorization method, when instead of considering one resolving edge, a certain small subset of edges chosen in a special way is considered. It is shown how to use cut edges as such a subset, leading to the possibility of effective use of known decomposition formulas for cut of 1, 2 or 3- vertices [13].

Key words: random graph, network reliability, algorithm.

This work was carried out under state contract with ICM&MG SB RAS 0251-2021-0005).

References

Moore E., Shannon C. Reliable circuits using less reliable relays /7 Journal of the Franklin Institute. 1956. V. 262, N 3. P. 191-208. [Electron. Res.]: article/pii/0016003256905592.

http://www.sciencedirect.com/science/

2. Colbourn C. J. The Combinatorics of Network Reliability. New York, NY, USA: Oxford University Press, Inc., 1987. ISBN: 0195049209.

3. Jcrcb L. Network reliability: models, measure and analysis // Proceedings of the 6th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks. 1998. P. T02/1-T02/10.

4. Lucct C., Manouvrier J.-F. Statistical and Probabilistic Models in Reliability / ed. by Ionescu D. C., Limnios N. Boston, MA: Birkhauser Boston, 1999. P. 279-294. ISBN: 978-1-4612-1782-4.

Теоретическая и системная информатика

5. Shooman А. М. Algorithms for network reliability and connection availability analysis // Electro/95 International. Professional Program Proceedings. 1995. Jun. P. 309-333.

6. Hofstad R. v. d. Random Graphs and Complex Networks. Cambridge University Press, 2016. V. 1 of Cambridge Series in Statistical and Probabilistic Mathematics.

7. Erdos P., Renyi A. On Random Graphs I // Publicationes Mathematicae Debrecen. 1959. V. 6. P. 290-297.

8. Erdos P., Renyi A. On the evolution of random graphs // Publ. Math. Inst. Hungary. Acad. Sci. 1960. V. 5. P. 17-61.

9. Chari M., Colbourn C. J. Reliability Polynomials: A Survey // Journal of Combinatorics, Information & System Sciences. 1997. V. 22. P. 177-192.

10. Some open problems on reliability polynomials: Rep.: 93-28 / University of Waterloo; executor: Colbourn C. J. Waterloo, Ontario, Canada: 1999.

11. Ellis-Monaghan J. A., Merino C. Graph Polynomials and Their Applications I: The Tutte Polynomial // Structural Analysis of Complex Networks / Ed. by Dehmer M. Birkhauser Boston, 2011. P. 219255. [Electron. Res.]: . http://dx.doi.org/10.1007/978-0-8176-4789-6\_9

12. Oxlev J., Welsh D. Chromatic, Flow and Reliabilitv Polvnomials: The Complexitv of Their Coefficients // Comb. Probab. Comput. 2002. July. V. 11, N 4. P. 403-426. [Electron. Res.]: http: //dx.doi.org/10.1017/S0963548302005175.

13. Valiant L. G. The Complexity of Enumeration and Reliability Problems // SIAM Journal on Computing. 1979. V. 8, N 3. P. 410-421. [Electron. Res.]: .

http://dx.doi.org/10.1137/0208032

14. A Note on the Complexity of Network Reliability Problems / Bodlaender H. L., Bodlaender H. L., Wolle T., and Wolle T. // IEEE Trans. Inf. Theory. 2004. V. 47. P. 1971-1988.

15. Shooman A. M., Kershenbaum A. Exact graph-reduction algorithms for network reliability analysis // Global Telecommunications Conference, 1991. GLOBECOM ’91. ’Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services. 1991. Dec. V. 2. P. 14121420.

16. Yubin Chen, Jiandong Li, Jiamo Chen. A new algorithm for network probabilistic connectivity // MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. N 99CH36341). 1999. V. 2.

P. 920-923.

17. Page L., Perry J. A practical implementation of the factoring theorem for network reliability // Reliability, IEEE Transactions on. 1988. Aug. V. 37, N 3. P. 259-267.

18. Rodionova О. K., Rodionov A. S., Choo H. Network Probabilistic Connectivity: Optimal Structures // Computational Science and Its Applications — ICCSA 2004 / Ed. by Lagana A., Gavrilova M. L., Kumar V. et al. Springer Berlin Heidelberg, 2004. V. 3046 of Lecture Notes in Computer Science. P. 431-440. [Electron. Res.]: 46. http://dx.doi.org/10.1007/978-3-540-24768-5_

19. Rodionova О. K., Rodionov A. S., Choo H. Network Probabilistic Connectivity: Exact Calculation with Use of Chains // Computational Science — ICCS 2004, 4th International Conference, Part I / Ed. by Bubak M., van Albada G. D., Sloot P. M. A., Dongarra J. Springer Berlin Heidelberg, 2004. V. 3036 of Lecture Notes in Computer Science. P. 565-568.

20. Gadyatskaya O., Rodionov A., Rodionova O. Using EDP-Polynomials for Network Structure Optimization // Computational Science and Its Applications — ICCSA 2008 / ed. by Gervasi O., Murgante B., Lagana A. et al. Berlin, Heidelberg: Springer Berlin Heidelberg. 2008. P. 10611076.

21. Cumulative Updating of Network Reliability with Diameter Constraint and Network Topology Optimization / Migov D. A., Nechunaeva K. A., Nesterov S. N., and Rodionov A. S. // Computational Science and Its Applications — ICCSA 2016 — 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part I / ed. by Gervasi O., Murgante B., Misra S. et al. Springer. 2016. V. 9786 of Lecture Notes in Computer Science. P. 141-152. [Electron. Res.]: 978-3-319-42085-l_ll. https://doi.org/10.1007/

22. Rodionov A., Rodionova О. Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes // High Performance Computing and Communications / Ed. by Gerndt M., Kranzlmuller D. Springer Berlin Heidelberg, 2006. V. 4208 of Lecture Notes in Computer Science. P. 101-109. [Electron. Res.]: . http://dx.doi.org/10.1007/11847366_ll

23. Rodionov A. Speeding up computation of the reliability polynomial coefficients for a random graph // Automation and Remote Control. 2011. V. 72, N 7. P. 1474-1486. [Electron. Res.]:

http: //dx.doi.org/10.1134/S0005117911070150.

24. Rodionov A. S., Migov D. A., Rodionova О. K. Improvements in the Efficiency of Cumulative Updating of All-Terminal Network Reliability // IEEE Trans. Reliab. 2012. V. 61, N 2. P. 460-465. [Electron. Res.]: .

https://doi.org/10.1109/TR.2012.2196172

25. Rodionov A. S., Rodionova О. K. Exact bounds for average pairwise network reliability // The 7th International Conference on Ubiquitous Information Management and Communication, ICUIMC T3, Kota Kinabalu, Malaysia. January 17-19, 2013. ACM. 2013. P. 45. [Electron. Res.]: https://doi.org/10.1145/2448556.2448601.

26. Rodionov A. S., Rodionova О. K. Reliability Polynomials: Obtaining and Usage // Mathematical models and computational methods, 2nd Edition. Proc, of the Int. Conf. Applied Mathematics, Computational Science & Engineering, Crete, Greece, October 17-19, 2015. INASE. 2015. P. 226-229.

27. Rodionov A. S., Migov D. A. New Advantages of Using Chains in Computing Multiple s — t Probabilistic Connectivity // Computational Science and Its Applications — ICCSA 2016 — 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part II / ed. by Gervasi O., Murgante B., Misra S. et al. Springer. 2016. V. 9787 of Lecture Notes in Computer Science. P. 117128. [Electron. Res.]: . https://doi.org/10.1007/978-3-319-42108-7\_9

28. Satyanarayana A., Chang M. K. Network reliability and the factoring theorem // Networks. 1983. V. 13. N 1. P. 107-120. [Electron. Res.]: .http://dx.doi.org/10.1002/net.3230130107

29. Migov D. A., Rodionov A. S. Parallel Implementation of the Factoring Method for Network Reliability Calculation // Computational Science and Its Applications — ICCSA 2014 — 14th International Conference, Guimaraes, Portugal, June 30 - July 3, 2014, Proceedings, Part VI / ed. by Murgante B., Misra S., Rocha A. M. A. C. et al. Springer. 2014. V. 8584 of Lecture Notes in Computer Science. P. 654-664. [Electron. Res.]: . https://doi.org/10.1007/978-3-319-09153-2_49

30. Rodionov A. S. Some New Ideas About Obtaining and Estimating Reliability Polynomial of a Random Graph // 2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM). 2020. P. 1-5.

31. Network Probabilistic Connectivity: Using Node Cuts / Migov D. A., Rodionova О. K., Rodionov A. S., and Choo H. // Emerging Directions in Embedded and Ubiquitous Computing / ed. by Zhou X., Sokolsky O., Yan L. et al. Berlin, Heidelberg: Springer Berlin Heidelberg. 2006. P. 702-709.

32. D. Migov. Dekompozitciia seti po secheniiam pri raschete ее nadezhnosti // Pricladnaia diskretnaia matematika. 2020. N 47. S. 62-86. DOI 10.17223/20710410/47/6

33. Gadyatskaya O., Rodionov A. S., Rodionova О. K. Using EDP-Polynomials for Network Structure Optimization // Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part II / ed. by Gervasi O., Murgante B., Lagana A. et al. Springer. 2008. V. 5073 of Lecture Notes in Computer Science. P. 10611076. [Electron. Res.]: http://dx.doi.org/10.1007/978-3-540-69848-7\_84.

Bibliographic reference: Rodionov A. S. Is it possible to achieve further acceleration of the calculation of the connectivity characteristics of a random graph? //Problems of informatics. 2022, № 4. P.39-52. DOI:10.24412/2073-0667-2022-4- 39-52. EDN: FMEYBE

E. Kh. Gimadi*’**, A. A. Shtepa**

*Sobolev Institute of Mathematics SB RAS, 630090, Novosibirsk, Russia

**Novosibirsk State University, 630090, Novosibirsk, Russia

ASYMPTOTICALLY OPTIMAL APPROACH FOR THE MAXIMUM SPANNING TREE PROBLEM WITH GIVEN DIAMETER IN A COMPLETE UNDIRECTED GRAPH ON UNI(0; 1)-ENTRIES

DOI: 10.24412/2073-0667-2022-4-53-62

EDN: GMGWHI

We consider two well-known optimization problems: the Minimum Spanning Tree Problem and the Maximum Spanning Tree Problem. There are some extensions of these problems, for example, if we want to find extremal spanning tree with bounded maximum degree of vertices or we search for extremal spanning tree with bounded diameter from above or from below by some integer. The diameter of a tree is the number of edges in the longest simple path within the tree connecting a pair of vertices. In current work, we consider the intractable problem of finding a maximum-weight spanning tree with a given diameter in a complete undirected graph. We construct O(n2)-time approximation algorithm solving the Maximum Spanning Tree Problem with a given diameter in a complete undirected n-vertex graph, and prove the sufficient conditions of asymptotic optimality for this algorithm in the case of independent uniformly distributed UNI(0; 1)-entries. This algorithm uses the algorithm for the Minimum Spanning Tree Problem with given diameter in a complete undirected graph.

Key words: Maximum Spanning Tree, Minimum Spanning Tree, approximation algorithm, probabilistic analysis, asymptotic optimality.

The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics SB RAS (project FWNF-2022-0019) and supported by Russian Foundation for Basic Research (project 20-3190091).

References

1. Angel O., Flaxman A.D., Wilson D.B. A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks / / Combinatorica, Vol. 32, 2012, P. 1-33. doi: 10.1007/s00493-012-2552-z

2. Cooper C., Frieze A., Ince N., Janson S., Spencer J. On the Length of a Random Minimum Spanning Tree // Combinatorics, Probability and Computing, Vol. 25, No. 1, 2016, P. 89-107. doi: 10.1017/S0963548315000024

3. Gimadi E.Kh., Istomin A.M., Shin E.Yu. On Algorithm for the Minimum Spanning Tree Problem Bounded Below // Proc. DOOR 2016, Vladivostok, Russia, 2016, CEUR-WS, Vol. 1623, P. 11-17.

4. Gimadi E.Kh., Istomin A.M., Shin E.Yu. On Bounded Diameter MST Problem on Random Instances // CEUR Workshop Proceedings, 2019, P. 159-168.

5. Gimadi E.Kh., Serdyukov A.I. A probabilistic analysis of approximation algorithm for the minimum weight spanning tree problem with a bounded below diameter // Oper. Res. Proceed. (Inderfurth K. eds.), Vol. 99, Springer, Berlin, 2000, P. 63-68. doi: 10.1007/978-3-642-58300-l_12

6. Gimadi E.Kh., Shevyakov A.S., Shin E.Yu. Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Instances // Proceedings of 15th International Asian School-Seminar OPCS-2019, Publisher: IEEE Xplore, 2019, P. 48-52. doi: 10.1109/OPCS.2019.8880223

7. Gimadi E.Kh., Shevyakov A.S., Shtepa A.A. A Given Diameter MST on a Random Graph // In N. Olenev, Y. Evtushenko, M. Khachay, V. Malkova (eds.), the 11th International Conference - Optimization and Applications, OPTIMA 2020, LNCS, Vol. 12422, 2020, P. 110-121. doi: 10.1007/978- 3-030-62867-3_9

8. Gimadi E.Kh., Shevyakov A.S., Shtepa A.A. On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with Random Edge Weights // In P. Pardalos, M. Khachay, A. Kazakov (eds.), Mathematical Optimization Theory and Operations Research, MOTOR 2021, LNCS, Vol. 12755, P. 67-78. doi: 10.1007/978-3-030-77876-7_5

9. Gimadi E.Kh., Shin E.Yu. On Given Diameter MST Problem on Random Input Data // In I. Bykadorov, V. Strusevich, T. Tchemisova (eds.), MOTOR 2019, Communications in Computer and Information Science, Vol. 1090, Springer, Cham, 2019, P. 30-38. doi: 10.1007/978-3-030-33394-2_3

10. Erzin A.I. The problem of constructing a spanning tree of maximal weight with a bounded radius // Upravlyaemye Sistemy, Vol. 27, 1987, P. 70-78. (in Russian)

11. Serdyukov A.I. On problem of maximal spanning tree with bounded radius // Diskretn. Anal. Issled. Oper., Ser. 1, Vol. 5, No. 3, 1998, P. 64-69. (in Russian)

12. Garey M.R., Johnson D.S., Computers and Intractability. Freeman, San Francisco, 1979, 340 p.

13. Gimаdi E.Kh., Glebov N.I., Perepelitsa V.A. Algorithms with Estimates for Discrete Optimization Problems // Problemy Kibernetiki, Vol. 31, 1975, P. 35-42. (in Russian)

14. Petrov V.V., Limit Theorems of Probability Theory. Sequences of Independent Random Variables. Clarendon Press, Oxford, 1995, 304 p.

15. Gimadi E.Kh., Khachay M.Yu. Extremal Problems on Sets of Permutations. UrFU Publ. Ekaterinburg, 2016, 219 p. (in Russian)

Bibliographic reference: Gimadi E.Kh., Shtepa A. A. Asymptotically Optimal Approach for the Maximum Spanning Tree Problem with Given Diameter in a Complete Undirected Graph on UNI(0; 1)-Entries //journal “Problems of informatics”. 2022, № 4. P.53-62. DOI:10.24412/2073-0667-2022-4- 53-62. EDN: GMGWHI

M. P. Bakulina

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia

EFFICIENT LOSSLESS COMPRESSION OF LARGE INFORMATION ARRAYS

DOI: 10.24412/2073-0667-2022-4-63-69

EDN: HIQWPK

The problem of efficient lossless compression of large information arrays is considered. The use of efficient coding for such data allows not only to reduce their physical size, but also to increase the speed of query execution speed. In this paper, a new coding large information data arrays is offered. It allows you to efficiently compress both numeric and string data. An experimental data confirm of compression increase and coding speed increase of the proposed method.

Key words: lossless coding, information array, compression ratio, coding time, method efficiency.

References

1. Bakulina M. P. IspoEzovanie zakona Tcipfa dlia szhatiia tekstov. Diskretny‘i‘ analiz i issledovanie operate!?. Scriia 2, tom 14, N 2, s. 3-13, 2007.

2. Riabko B. la. E‘ffektivny‘i‘ metod kodirovaniia istochnikov informatcii, ispol‘zuiushchii‘ algoritm by‘strogo umnozheniia // Problcmy‘ pcredaclii informatcii. T. 31, vy‘pusk 1, s. 3-12, 1995.

3. Li J., Rotem D., Wong H. A New Compression Method with Fast Searching on Large Databases // Proceedings of 13th International Conference on Very Large Data Bases, Brighton, p. 311-318, 1987.

4. Eggers S., Shoshani A. Efficient Access of Compressed Data Performance // Proc. VLDB, Montreal, p. 205, 1980.

5. Eggers S., Olken F., Shoshani A. A Compression Technique for Large Statistical databases // Proc. VLDB Conf. p. 114, 1981.

6. Li J., Rotem D., Wong EL A New Compression Method with Fast Searching on Large Databases // Proceedings of 13th International Conference on Very Large Data Bases, Brighton, pp. 311-318, 1987.

7. Ziv J., Lempel A. Compression of individual sequences via variable-length coding // IEEE Trans.Inform.Theory. V. IT-24, N 5, pp. 530-536, 1978.

8. Elias P. Interval and recency rank source encoding: two on-line adaptive variable-length schemes // IEEE Trans. Inform. Theory. V. 33, N 1, pp. 3-10, 1987.

9. Bell T. C., Cleary J. EL, Witten I. EL Text Compression. Prentice Hall. Englewood Cliffs, 1990.

10. Zipf G. K. Human behavior and the principle of least effort. Cambridge: Addison Wesley, 1949.

Bibliographic reference: Bakulina M. P. Efficient lossless compression of large information arrays // Problems of informatics. 2022. № 4. P.63-69. DOI:10.24412/2073-0667-2022-4- 63-69. EDN: HIQWPK

S.V. Bredikhin, V. M. Lyapunov, N.G. Scherbakova

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia

THE HYPER-NETWORK OF SCIENTIFIC CO-AUTHORSHIP. DB REPEC DATA ANALYSIS

DOI: 10.24412/2073-0667-2022-4-70-83

EDN: MJFKPC

The article deals with the modeling of a complex network of co-authorship, presented in the form of a hypergraph. The formal information necessary to describe multiple relationships between coauthors is given and two models of the analyzed object are presented. Based on real information extracted from the bibliographic database RePEc, a hypergraph of the co-authorship network is constructed.

Most of the previous studies consider the co-authorship relation between two authors as a collaboration. So a network is represented as a simple graph in which link relates only a pair of authors that are coauthors of at least one scientific paper (SP). These pairwise networks have been studied from many aspects such as degree distribution analysis, community extraction, authors ranking, see, for example, [4-8]. Such networks does not provide a complete description of the collaboration because we only know whether scientists have collaborated or not but we can’t know whether a group of authors linked together in the network were coauthors of the same paper or not. As a variant of the representation that takes into account n-ary relations between authors, a bipartite graph may be considered, in which one partite set represents the authors, the other — SPs prepared by these authors. This makes it possible to use the apparatus of graph theory, but at the same time, heterogeneity in the definition of nodes makes more complicated the study of such topological properties as connectivity and clustering. Therefore, in [10], it is proposed to use a graph generalization, a hypergraph [П], to represent a complex system and call it a hyper-network. Edges of a hypergraph can relate groups of more than two nodes.

Key words: complex networks, scientific co-authorship, hypergraph, bipartite graph, bibliometry.

This work was carried out under state contract with ICMMG SB RAS (0251-2021-0005).

References

1. Boccaletti S., Latora V., Moreno Y., Chavez M., Hwang D. U. Complex networks: Structure and dynamics // Phys. Rep. 2006. V. 424, iss. 4-5. P. 175-308. DOI: 10.1016/j.physrep.2005.10.009.

2. BattistonF., CencettiG., IacopiniI., LatoraV., LucasM., PataniaA. YoungJ-G., PetriG. Networks beyond pairwise interactions: Structure and dynamics // Phys. Rep. 2020. V. 874. P. 1-92. DOI: 10.1016/j.physrep.2020.05.004.

3. Shcherbakova N. G. Modelirovanie gruppovykh vzaimodejstvij kompleksnykh sistem. Obzor // Problemy informatiki. 2022. N. 3. S. 24-45.

4. Newman M. E. J. Scientific collaboration networks. I. Network construction and fundamental results // Phys Rev. E, 64(1), 016131. DOI: 10.1103/PhysRevE.64.016131.

5. Newman M. E. J. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality // Phys. Rev. E, 64(1), 016132. DOI: 10.1103/PhysRevE.64.016132.

6. Savic M., Ivanovic M., Radovanovic M., Ognjanovic Z., Pejovic A. Exploratory analysis of communities in co-authorship networks: A case study // Intern. Conf, on ICT Innovations, Springer, 2019. P. 55-64.

7. Barabasi A. L., Jeong H., Neda Z., Ravasz E., Schubert A., Vicsek T. Evolution of the social network of scientific collaborations // Physica A. 2002. V. 311. P. 590-614. DOI: 10.48550/arXiv.cond-mat/0104162.

8. Uddin S., Hossain L., Abbasi A., Rasmussen K. Trend and efficiency analysis of coauthorship network // Scientometrics. 2012. V. 90, No. 2. P. 687-699. DOI: 10.1007/slll92-011-0511-x.

9. Newman M. E. J., Strogatz S. H., Watts D. J. Random graphs with arbitrary degree distributions and their applications // Phys. Rev. E 64, 026118. 2001. DOI: 10.1103/PhysRevE.64.026118.

10. Estrada E., Rodriguez-Velazquez J. A. Complex networks as hypergraphs // Arxiv: physics/0505137, 2005. DOI: 10.1016/j.physa.2005.12.002.

11. Berge C. Hypergraphs. Amsterdam; N. Y.; Oxford; Tokyo: North-Holland, 1989.

12. Torres L., Blevins A. S., Basset D., Eliassi-Rad T. The why, how, and when of representations for complex systems // SIAM Rev. 2021. V. 63, No 3. P. 415-485. DOI: 10.1137/20M1355896.

13. Ouvrard X., LE Goff X-М., MARCHAND-MAILLET S. Networks of collaborations: Hypergraph modeling and visualization // ArXiv: 1809.00164vl. DOI: 10.48550/arXiv.1809.00164.

14. Han Y., Zhou B., Pei J., Jia Y. Understanding importance of collaborations in coauthorship networks: A supportiveness analysis approach // Proc. 2009 SIAM Intern. Conf, on Data Mining. 2009. P. 1112-1123. DOI: 10.1137/ 1.9781611972795.95.

15. Bredikhin S.V., Lyapunov V. М., Shcherbakova N. G. Struktura i parametry nevzveshennoj seti soavtorstva na osnove dannykh BD RePEc // Problemy informatiki. 2021. N. 3. S. 56-67. DOI: 10.24411/2073-0667-2021-3-56-57.

16. Bredikhin S.V., Lyapunov V. M., Shcherbakova N. G. Ranzhirovanie uzlov vzveshennoj seti soavtorstva: analiz dannykh BD RePEc // Problemy informatiki. 2021. N. 4. S. 5-15. DOI: 10.24412/2073-0667-2021-4-67-83.

17. VOLOSHIN V. I. Introduction to graph and hypergraph theory. N. Y.: Nova Science Publishers, Inc., 2009.

18. Bretto A. Hypergraph theory: An introduction. Heidelberg: Springer Intern. Publishing, 2013. DOI: 10.1007/978-3-319-00080-0. '

19. MartIinez M. G., Stark H. M., Terras A. A. Some Ramanujan hypergraphs associated to GL(n, Fq) jj Proc. Am. Math. Soc. 2001. V. 129, P. 1623-1629. S. 0002-9939(00)05965-7.

20. OUVRARD X. Hypergraphs: An introduction and review // Arxiv: 2002.05014v2, 2020. DOI: 10.48550/arXiv.2002.05014.

21. Zhou D., Huang J., Schokopf B. Learning with hypergraphs: Clustering, classification, and embedding // Proc. 19th Internal. Conf, on Neural Inform. Proc. Syst. 2007. P. 1601-1608. DOI: 10.7551/mitpress/7503.003.0205.

22. Bahmanian M. A., Sajna M. Connection and separation in hypergraphs // Theory and Appl. of Graphs. 2015. V. 2, iss. 2. D01:10.20429/tag.2015.020205.

23. Distel’ R. Teoriya grafov. Per. s angl. Novosibirsk: Izdatekstvo instituta matematiki. 2002. 336 s. ISBN 5-86134-101-X.

24. Zykov A. A. Gipergrafy // Uspekhi mat. nauk. 1974. T. 29, vyp. 6. S. 89-156.

25. Borgatti S. P., Everett M. G. Network analysis of 2-mode data // Social networks. 1997. V. 19. P. 243-269. DOI: 10.1016/S0378-8733(96)00301-2.

26. Cooper J., Dutle A. Spectra of uniform hypergraphs // Lin. Algebra and Its Appl. 2012. V. 436. P. 3268-3292. DOI: 10.48550/arXiv.ll06.4856.

27. Banerjee A., Char A., Mondal B. Spectra of general hypergraphs // Lin. Algebra and Its Appl. 2017. V. 518. P. 14-30. DOI: 10.1016/j.laa.2016.12.022.

28. Kumar T., Vaidyanathan S., Ananthapadmanabhan H. Hypergraph clustering: A modularity maximization approach // ArXiv: 1812.10869[cs.G]. DOI: 10.48550/arXiv.1812.10869.

29. Kaminski B., Poulin V., Pralat P., Szufel P., Theberge F. Clustering via hypergraph modularity // PLoS ONE. 2019. V. 14(11), e0224307. DOI: 10.1371/journal.pone.0224307. '

30. Zhou V., Nakhleh L. Properties of metabolic graphs: biological organization or representation artifacts? // BMC Bioinformatics. 2011. V. 12, 132. DOI: 10.1186/1471-2105-12-132.

Bibliographic reference: Bredikhin S. U, Lyapunov V. M., Scherbakova N. G. The hyper-network of scientific co-authorship. DB RePEc data analysis //Problems of informatics. 2022, № 4. P.70-83. DOI:10.24412/2073-0667-2022-4- 70-83. EDN: MJFKPC

R. Milihat*, M. Kalimoldaev**, A. Abdildaeva**, M. Osyman***’****

*Vysshaya shkola informatcionnykh tekhnologiy i inzhenerii Mezhdunarodnogo universiteta Astana, Astana, Kazakhstan

**Institut informatcionno-vychislitelnykh tekhnologiy, Almaty, Kazakhstan

***Kafedra kommunikatcionnykh tekhnologiy i setey, University Putra Malaysia, 43400 UPM Serdang, Selangor Darul Ehsan, Malaysia

****Laboratoriia vychislitelnoi nauki i matematicheskoi fiziki, Institut matematicheskikh isslcdovanii, University Putra Malaysia, 43400 UPM Serdang, Selangor DE, Malaysia

HOW ARTIFICIAL INTELLIGENCE IS REVOLUTIONIZING THE MARKETING

DOI: 10.24412/2073-0667-2022-4-84-106

EDN: NSTTIT

The power of artificial intelligence (AI) with machine learning algorithms are rapidly revolutionizing the business world and generating new trends in marketing. Many high- tech companies have already started benefitting from the power of AI in Marketing. Tech Giants such as Alphabet (Google), Amazon, Apple, and Meta (Facebook) are earning multi- billion dollar incomes with the assistance of AI based algorithms. Recent years, the great results of AI in marketing have attracted many scientists around the globe.

In this paper, we review the role of AI in marketing and its strategic implementation framework, as well as main research directions of AI in businesses. Key challenges and opportunities of state-of-the-art technologies in the time of the fourth industrial revolution. We argue that AI will substantially change both marketing strategies and customer behaviors, as well as it opens new avenues for industries and businesses. Also, we describe the key challenges of AI in marketing. In the future, AI will become a new branch of business management and commerce. Integration of computer science and business management will be a novel trend of the future.

Key words: Artificial intelligence, Machine learning, Marketing, Digital Marketing, Marketing strategy.

References

1. Davenport T., Guha A., Grewal D., Brcssgott T. How artificial intelligence will change the future of marketing / / Journal of the Academy of Marketing Science, 2020. N 48. P. 24-42.

2. Thcodoridis P. K., Gkikas D.C. How Artificial Intelligence Affects DM. Strategic Innovative Marketing and Tourism, Springer, Proceedings in Business and Economics. 2019.

3. Rust R. T. The future of marketing. International Journal of Research in Marketing. 37 (1). P. 15-26 2020.

4. Bruyn A.D., Viswanathan V., Beh Y. S., Brock J.K-U., Wangenheim F. Artificial Intelligence and Marketing: Pitfalls and Opportunities. Journal of Interactive Marketing. 2020. N 51. P. 91-105.

Р. Милихат, М. Калимолдаев, А. Абдилдаева, М. Отман

5. Bakpayev М., Ваек Т.Н., Esch Р., Yoon S. Programmatic creative: AI can think but it cannot feel // Australasian Marketing Journal, 2022. N 30 (1).

6. Paschen J., Paschen U., Pala E., Kietzmann J. Artificial intelligence (AI) and value co-creation in B2B sales: Activities, actors and resources // Australasian Marketing Journal, 2021. N 29 (3).

7. Xu Y., Shieh С-H., Esch P., Ling I-L. AI Customer Service: Task Complexity, Problem Solving Ability, and Usage Intention // Australasian Marketing Journal, 2020. N 28 (4).

8. Escha P., Black J. S. Factors that influence new generation candidates to engage with and complete digital, Al-enabled recruiting // Business Horizons, 2019. N 62(6). P. 729-739.

9. Mogaji E., Soetan T. O., Kieu T. A. The implications of artificial intelligence on the digital marketing of financial services to vulnerable customers // Australasian Marketing Journal, 2021. N 29(3).

10. Verma S., Sharma R., Deb S., Maitra D. Artificial intelligence in marketing: Systematic review and future research direction. International Journal of Information Management Data Insights, 2021. N 1(1).

11. Gacanin H., Wagner M. Artificial Intelligence Paradigm for Customer Experience Management in Next-Generation Networks: Challenges and Perspectives // IEEE Network, 2019. N 33 (2). P. 188194.

12. Maxwell A. L., Jeffrey S. A., Levesque M. Business angel early stage decision making // Journal of Business Venturing, 2011. N 26 (2). P. 212-225.

13. Chan-Olmsted S.M. A Review of Artificial Intelligence Adoptions in the Media Industry // International Journal on Media Management, 2019. N 21 (19). P. 193-215.

14. Duana Y., Edwards J.S., Dwivedi Y. K. Artificial intelligence for decision making in the era of Big Data — evolution, challenges and research agenda // International Journal of Information Management, 2019. N 48. P. 63-71.

15. Bolton C., Machova V., Kovacova M., Valaskova K. The power of human-machine collaboration: Artificial intelligence, business automation, and the smart economy // Economics, Management, and Financial Markets, 2018. N 51 (4).

16. Kietzmann J., Paschen J., Treen E. Artificial intelligence in advertising: How marketers can leverage artificial intelligence along the consumer journey // Journal of Advertising Research, 2018. N 58(3). P. 263-267.

17. Mou Y., Xu K. The media inequality: Comparing the initial human-human and human-AI social interactions // Computers in Human Behavior, 2017. P. 432-440.

18. Wright S. A., Schultz A. E. The rising tide of artificial intelligence and business automation: Developing an ethical framework // Business Horizons, 2018. N 61 (6). P. 823-832.

19. Zhang J. Z. Z ed., Fan M., Gu B., Mukherjee V., Zhang B., Zhao J. L. Business values/implications of AI and machine learning // Data Information Management, 2018. N 2(3). P. 121-129.

20. Zhang X., Ming X., Liu Z., Yin D., Chen Z., Chang Y. A reference framework and overall planning of industrial artificial intelligence (LAI) for new application scenarios // The International Journal of Advanced Manufacturing Technology, 2018. N 1.

21. Vlacic, B., Corbo L., Silva S.C., Dabic, M. The evolving role of artificial intelligence in marketing: A review and research agenda // Journal of Business Research, 2021. N 128. P. 187-203.

22. Devang V., Chintan S., Gunjan T., Krupa R. Applications of Artificial Intelligence in Marketing, Annals of “Dunarea de Jos”. University of Galati Fascicle I. // Economics and Applied Informatics, 2019.

23. Loureiro S. M. C., Guerreiro J., Tussyadiah I. Artificial intelligence in business: State of the art and future research agenda // Journal of Business Research, 2021. N129. P. 911-926.

24. Feng C.M., Park A., Pitt L., Kietzmann J., Northey G. Artificial intelligence in marketing: A bibliographic perspective // Australasian Marketing Journal, 2021. N 29(3).

25. Mustak М., Salminen J., Pie, L., Wirtz J. Artificial intelligence in marketing: Topic modeling, scientometric analysis, and research agenda // Journal of Business Research, 2021. N 124. P. 389-404.

26. Kumar V., Rajan B., Venkatesan R., Lecinski J. Understanding the Role of Artificial Intelligence in Personalized Engagement Marketing // California Management Review, 2019. N 61 (4).

27. Mogaji E., Soetan T. O., Kieu T. A. The implications of artificial intelligence on the digital marketing of financial services to vulnerable customers // Australasian Marketing Journal, 2021. N 29(3).

28. Kannan P. K., Li H. S. Digital marketing: A framework, review and research agenda // International Journal of Research in Marketing, 2017. N 34(1). P. 22-45.

29. Gokerik M., Giirbuz A., Erkan I., Mogaji E., Sap S. Surprise me with your ads! The impacts of guerrilla marketing in social media on brand image // Asia Pacific Journal of Marketing and Logistics, 2018. N 30(5). P. 1222-1238.

30. Kumar V., Rajan B., Venkatesan R., Lecinski J. Understanding the Role of Artificial Intelligence in Personalized Engagement Marketing // California Management Review, 2019. N 61 (4).

31. Puntoni S., Reczek R. W., Giesler M., Botti S. Consumers and Artificial Intelligence: An Experiential Perspective // Journal of Marketing, 2021. N 85(1).

32. Grandinetti R. How artificial intelligence can change the core of marketing theory // Innovative Marketing, 2020. N 16 (2). P. 91-103.

33. Bag S., Gupta S., Kumar A., Sivarajah U. An integrated artificial intelligence framework for knowledge creation and B2B marketing rational decision making for improving firm performance // Industrial Marketing Management, 2021. N 92, P. 178-189.

34. Prentice, C,. Lopes S. D., Wang X. Emotional intelligence or artificial intelligence — an employee perspective // Journal of Hospitality Marketing Management, 2020. N 29 (4). P. 377-403.

35. Belk R. Machines and Artificial Intelligence // Journal of Marketing Behavior, 2019. N 4 (11). P. 11-30.

36. Kumar V., Ramachandran D., Kumar B. Influence of new-age technologies on marketing: A research agenda // Journal of Business Research, 2021. N 125. P. 864-877.

37. Theodoridis P. K., Gkikas D.C. How Artificial Intelligence Affects DM // Strategic Innovative Marketing and Tourism, Springer, Proceedings in Business and Economics, 2019.

38. Gkikas D. C., Theodoridis P. K. Artificial Intelligence (AI) Impact on DM Research // Strategic Innovative Marketing and Tourism, Springer, Proceedings in Business and Economics, 2019. P. 12511259.

39. Al-Sukkar A.S., Hussein, A-H.M. M.A, Jalil M.M. A. The Effect of Applying Artificial Intelligence in Shaping Marketing Strategies: Field Study at the Jordanian Industrial Companies // International Journal of Applied Science and Technology, 2013. N 3 (4).

40. Kietzmann T.C., Kietzmann J., Paschen J. Artificial intelligence (AI) and its implications for market knowledge in B2B marketing // Journal of Business Industrial Marketing, 2018. N 34 (7). P. 1410-1419.

41. Stone M., Aravopoulou E., Ekinci Y., Evans G., Hobbs M., Labib A., Laughlin P. Artificial intelligence (AI) in strategic marketing decision-making: a research agenda // The Bottom Line, 2020. N 33(2). P. 183-200.

42. Mikalef P., Conboy K., Krogstie J. Artificial intelligence as an enabler of B2B marketing: A dynamic capabilities micro-foundations approach // Industrial Marketing Management, 2021. N 98. P. 80-92.

43. Prior D.D., Keranen J. Revisiting Contemporary Issues in B2B Marketing: It’s Not Just about Artificial Intelligence // Australasian Marketing Journal, 2020. N 28(2).

44. Frank B. Artificial intelligence-enabled environmental sustainability of products: Marketing benefits and their variation by consumer, location, and product types // Journal of Cleaner Production, 2021. N 285. P. 125242.

45. Triberti S., Durosini I., Curigliano G., Pravettoni G. Is Explanation a Marketing Problem? The Quest for Trust in Artificial Intelligence and Two Conflicting Solutions // Public Health Genomics, 2020. N 23. P. 2-5.

46. Toorajipour R., Sohrabpour V., Nazarpour A., Oghazi P., Fischl M. Artificial intelligence in supply chain management: A systematic literature review // Journal of Business Research, 2021. N 122. P. 502-517.

47. Caner S., Bhatti F. A Conceptual Framework on Defining Businesses Strategy for Artificial Intelligence // Contemporary Management Research, 2020. N 16(3). P. 175-206.

48. Prentice C., Lopes S.D., Wang X. The impact of artificial intelligence and employee service quality on customer satisfaction and loyalty // Journal of Hospitality Marketing & Management, 2020. N 29(7). P. 739-756.

49. Chalmers D., MacKenzie N. G., Carter S. Artificial Intelligence and Entrepreneur ship: Implications for Venture Creation in the Fourth Industrial Revolution // Entrepreneurship Theory and Practice, 2021. N 45 (5). P. 1028-1053.

50. Jian Z., Qingyuan Z., Living T. Market revenue prediction and error analysis of products based on fuzzy logic and artificial intelligence algorithms // Journal of Ambient Intelligence and Humanized Computing, 2020. N 11. P. 4011-4018.

51. Nordin M. A. W., Vedenyapin D., Alghifari M. F., Gunawan T. S. The disruptometer: an artificial intelligence algorithm for market insights // Bulletin of Electrical Engineering and Informatics, 2019. N 8(2). P. 727-734.

52. Sonia N., Sharma E.K., Singh N., Kapoor A. Artificial Intelligence in Business: From Research and Innovation to Market Deployment // Procedia Computer Science, 2020. N 167. P. 2200-2210.

53. Weber F.D., Schutte R. State-of-the-art and adoption of artificial intelligence in retailing // Digital Policy, Regulation and Governance, 2019. N 21 (3). P. 264-279.

54. Brill T.M., Munoz L., Miller R. J. Siri, Alexa, and other digital assistants: a study of customer satisfaction with artificial intelligence applications // Journal of Marketing Management, 2019. N 35. P. 1401-1436.

55. Kietzmann J., Pitt L.F. Artificial intelligence and machine learning: What managers need to know // Business Horizons, 2020. N 63(2). P. 131-133.

56. Lies J. Marketing Intelligence and Big Data: Digital Marketing Techniques on their Way to Becoming Social Engineering Techniques in Marketing // International Journal of Interactive Multimedia and Artificial Intelligence, 2019. N 5(5). P. 134-144.

57. Grewal D., Hulland J., Kopalle P. K., Karahanna E. The future of technology and marketing: a multidisciplinary perspective // Journal of the Academy of Marketing Science, 2020. N 48. P. 1-8.

58. Singh J., Flaherty K., Ravipreet R. S., Deeter-Schmelz D., Habel J., Meunier-FitzHugh K.L., Malshe A., Mullins R., Onyemah,V. Sales profession and professionals in the age of digitization and artificial intelligence technologies: concepts, priorities, and questions // Journal of Personal Selling & Sales Management, 2019. N 39(1). P. 2-22.

59. Lu W. Research on Marketing Development under the Background of Artificial Intelligence Technology // Journal of Physics: Conference Series, 2021. N 1769. P. 012071.

60. Pantano E., Pizzi G. Forecasting artificial intelligence on online customer assistance: Evidence from chatbot patents analysis // Journal of Retailing and Consumer Services, 2022. N 55. P. 102096.

61. Ghimire A., Thapa S., Kumar J. A., Adhikari S., Kumar A. Accelerating Business Growth with Big Data and Artificial Intelligence // 2020 Fourth International Conference on LSMAC (loT in Social, Mobile, Analytics and Cloud) (LSMAC), 2020. P. 441-448.

62. Chintalapati S., Kumar Pandey S. Artificial intelligence in marketing: A systematic literature review // International Journal of Market Research, 2022. N 64(1).

63. Tripathi S., Verma S. Social media, an emerging platform for relationship building: A study of engagement with nongovernment organizations in India // Journal of Philanthropy and Marketing, 2018. N 23(1). P. 1589.

64. Verma S., Yadav N. Past, Present, and Future of Electronic Word of Mouth (EWOM) // Journal of Interactive Marketing, 2021. N 53. P. 111-128.

65. Capatina A., Kachour M., Lichy J., Micu A., Micu A.E., Codignola F. Matching the future capabilities of an artificial intelligence-based software for social media marketing with potential users expectations // Technological Forecasting and Social Change, 2020. N 151. P. 119794.

66. Kuhl N., Miihlthaler M., Goutier M. Supporting customer-oriented marketing with artificial intelligence: automatically quantifying customer needs from social media // Electronic Markets, 2020. N 30. P. 351-367.

67. Benabdelouahed R., Dakouan C. The Use of Artificial Intelligence in Social Media: Opportunities and Perspectives // Expert Journal of Marketing, 2020. N 8 (1). P. 82-87.

68. [Electron. Res.]: : ~ :text=In\7,202020\7,2C\7,20over\7,203.6\7.20billion, almost\7.204. 41\7.20billion\7.20in\7.202025

https://www.statista.com/statistics/278414/number-of-worldwide- social-network-users/#

69. Abraham M., Mitchelmore S., Collins S., Maness J., Kistulinec M., Khodabandeh S., Hoenig D., Visser J. Profiting from Personalization, 2017. N 15.

70. Lee L.W., Dabirian A., McCarthy L.P., Kietzmann J. Making sense of text: artificial intelligence-enabled content analysis // European Journal of Marketing, 2020. N 54(3). P. 615-644. .

71. Capatina A., Kachour M., Lichy J., Micu A., Micu A.E., Codignola F. Matching the future capabilities of an artificial intelligence-based software for social media marketing with potential users’ expectations Technological Forecasting and Social Change, 2020. N 151. P. 119794.

72. Mogaji E., Soetan T-О., Kieu T. A. The implications of artificial intelligence on the digital marketing of financial services to vulnerable customers // Australasian Marketing Journal, 2021. N 29(3).

73. Hildebrand C. The Machine Age of Marketing: How Artificial Intelligence Changes the Way People Think, Act, and Decide // NIM Marketing Intelligence Review, 2019. N 11. P. 10-17.

74. Jarek K., Mazurek G. Marketing and Artificial Intelligence // Central European Business Review, 2019. N 8 (2). P. 46-55.

75. Eriksson T., Bigi A., Bonera M. Think with me, or think for me? On the future role of artificial intelligence in marketing strategy formulation // The TQM Journal, 2020. N 32 (4). P. 795-814.

76. Kaczorowska-Spychalska D. How chatbots influence marketing // Sci, 2019. N 23(1). P. 251270.

77. Ameen N., Tarhini A., Reppel A., Anand A. Customer experiences in the age of artificial intelligence // Computers in Human Behavior, 2021. N 114. P. 106548.

78. Luo X., Tong S., Fang Z., Qu Z. Frontiers: Machines vs. Humans: The Impact of Artificial Intelligence Chatbot Disclosure on Customer Purchases // Marketing Science, 2019. N 38(6). P. 937947.

79. Cheng Y., Jiang H. Customer-brand relationship in the era of artificial intelligence: understanding the role of chatbot marketing efforts // Journal of Product & Brand Management, 2022. N 31(2). P. 252-264.

80. Pitt C., Eriksson T., Dabirian A., Vella J. Elementary, My Dear Watson: The use of artificial intelligence in marketing research: An abstract [Conference session] // Academy of Marketing Science, New Orleans, LA, United States, 2018.

81. Marinchak C.M., Forrest E., Hoanca B. Artificial intelligence: Redefining marketing management and the customer experience // International Journal of E-Entrepreneurship and Innovation 2018, N 8 (2). P. 14-24.

82. Tiwari R., Srivastava S., Gera R. Investigation of Artificial Intelligence Techniques in Finance and Marketing // Procedia Computer Science, 2020. N 173. P. 149-157.

83. Yu, C-S. The era of artificial intelligence: Relationship between Taiwan’s machine tool international trade show marketing and international agents // International Journal of Business and Economic Affairs, 2019. N 4(3). P. 116-123.

84. Huang М-H., Rust R. T. A strategic framework for artificial intelligence in marketing // Journal of the Academy of Marketing Science, 2020.

85. Overgoor G., Chica M., Rand W., Weishampel A. Letting the Computers Take Over: Using AI to Solve Marketing Problems // California Management Review, 2019. N 61 (4).

86. Gkikas D. C., Theodoridis P. K. Artificial Intelligence (AI) Impact on DM Research // Strategic Innovative Marketing and Tourism, Springer, Proceedings in Business and Economics, 2019. P. 12511259.

87. Mouncey P. Gaining insights without questions // International Journal of Market Research, 2018. N 60. P. 425-434.

88. Karapistolis G.S.D., Vafeiadis A. Marketing decision support using artificial intelligence and knowledge modeling: Application to tourist destination management // Procedia—Social and Behavioral Sciences, 2015. N 175. P. 106-113.

89. Huang М-H., Rust R. T. Engaged to a Robot? The Role of AI in Service // Journal of Service Research, 2021. N 24(1).

90. Haenlein M., Kaplan A. A Brief History of Artificial Intelligence: On the Past, Present, and Future of Artificial Intelligence // California Management Review, 2019. N 61 (4).

91. Kozinets R. V., Gretzel U. Artificial Intelligence: The Marketer’s Dilemma // Journal of Marketing. 2021. N 85 (1). .

92. Paschen J., Wilson M., Ferreira J. J. Collaborative intelligence: How human and artificial intelligence create value along the B2B sales funnel // Business Horizons, 2020. N 63 (3). P. 403-414.

93. Krafft M., Sajtos L., Haenlein M. Challenges and Opportunities for Marketing Scholars in Times of the Fourth Industrial Revolution // Journal of Interactive Marketing, 2020. N 51. P. 1-8.

94. Dumitriu D., Ana-MariaPopescu M. Artificial Intelligence Solutions for Digital Marketing // Procedia Manufacturing, 2020. N 46. P. 630-636.

95. Rekha A. G., Abdulla M. S., Asharaf S. Artificial intelligence marketing: An application of a novel lightly trained artificial intelligence marketing: An application of a novel lightly trained support vector data description // Journal of Information and Optimization Sciences, 2016. N 37. P. 681-691.

Bibliographic reference: Milihat R., Kalimoldaev M., Abdildaeva A., Otman M. How Artificial Intelligence is Revolutionizing the Marketing //Problems of informatics. 2022, № 4. P.84-106. DOI:10.24412/2073-0667-2022-4-84-106. EDN: NSTTIT

V.E. Malyshkin * ** ***A.V. Chmil**, V. A. Perepelkin*’** ***

*Novosibirsk State University, 630090, Novosibirsk, Russia

**Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia

*** Novosibirsk State Technical University, 630073, Novosibirsk, Russia

DYNAMIC LOAD BALANCING ALGORITHMS APPLICATION AUTOMATION SUBSYSTEM DEVELOPMENT FOR LUNA SYSTEM

DOI: 10.24412/2073-0667-2022-4-107-119

EDN: SKJWTU

The imbalance of computational load is one of the key problems of parallel programming. The imbalance of the computational load occurs due to various factors. The causes of the imbalance can be both hardware and software. Hardware imbalance occurs due to heterogeneity of computing system resources. The program imbalance is associated with such factors as the dynamics of the simulated phenomenon and an inefficiently parallelized program containing excessive communications, an unsuccessful distribution of calculations between nodes, etc.

Parallel implementation on supercomputers of large numerical models which requires dynamic load balancing on computing nodes is a complex task of system parallel programming. Solving this problem requires certain qualifications. Ordinary users of supercomputers in the field of scientific numerical modeling usually do not have such qualifications, which makes it difficult to use supercomputers in the relevant tasks. The problem is partially solved by using specialized software, where dynamic load balancing has already been implemented. However, the use of such software is not always possible, especially for new numerical models.

Dynamic load balancing is a relatively well-developed topic. There are many publications on this topic. There are algorithms, methods, software implementations and studies of their properties. However, the task of ensuring efficient and balanced performance of supercomputer computing resources is still time-consuming and requires relevant qualifications. Even a "simple" adjustment of the parameters of the load balancing algorithm can become an insurmountable problem in practice. The problem is especially relevant for modern supercomputers of the peta and exaflops ranges, since it is not trivial to provide a sufficiently full load of computing resources of such supercomputers even for simple tasks.

The elimination of the imbalance is a non-trivial task, for which there is no single method. There are many algorithms aimed at eliminating the imbalance, but none of them is universal.

The principal solution is automation of dynamic balancing of the computing load. Automation in this case refers to a situation when various methods, algorithms and programs that perform dynamic load balancing accumulate in some database or library in a form that allows their automatic application. User creates his program in such a way that the corresponding methods, algorithms, and programs are applied automatically, without the need for the user to deeply understand the problems of dynamic load balancing. A specific case is the support for dynamic balancing of computational load in software such as Charm++ or PICADOR. A general case would be a situation where the programming system is not specialized, and all the knowledge about dynamic load balancing accumulated by researchers is available and automatically applied in the library.

It is significant that there are no universal dynamic balancing algorithms due to the algorithmic complexity of this problem in the general formulation. Therefore, various particular and heuristic methods and algorithms used in various practical tasks are being researched in the relevant field. Accordingly, the automation of dynamic load balancing is based on the accumulation of these particular and heuristic algorithms, as well as on the information about their appropriate usage, and on how to determine which case is more suitable in a particular situation.

The LuNA system of automatic design of parallel programs develops with an understanding of this circumstance. One of the tasks of the system is to ensure the accumulation and automatic application of knowledge about dynamic balancing of computing load. The paper reveals the question of how fundamentally the LuNA system is suited to provide this accumulation and automatic application, and also provides information about the extent at which this approach is currently implemented. In particular, the results of an experimental study of the performance characteristics of programs on LuNA systems using various dynamic load balancing algorithms are presented.

Key words: load balancing automation, fragmented programming technology, LuNA system.

References

1. Victor Malyshkin. Active Knowledge, LuNA and Literacy for Oncoming Centuries // LNCS, Vol. 9465. 2015. P. 292-303. DOI: 10.1007/978 - 3 - 319 - 25527 - 919

2. Kale L. V., Krishnan S. Charm++ A portable concurrent object oriented system based on C++ //Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications. — 1993. — pp. 91-108.

3. Bastrakov S. et al. Particle-in-cell plasma simulation on heterogeneous cluster systems //Journal of Computational Science. — 2012. — 3(6) — pp. 474-479.

4. Malyshkin, V., Perepelkin, V.: LuNA Fragmented Programming System, Main Functions and Peculiarities of Run-Time Subsystem. In: Parallel Computing Technologies. LNCS 6873, pp. 53-61 (2011).

5. Malyshkin V. E., Perepelkin V. A., Schukin G. A. Distributed algorithm of data allocation in the fragmented programming system LuNA //International Conference on Parallel Computing Technologies. — Springer, Cham, 2015. — pp. 80-85.

6. Acar U. A., Chargueraud A., Rainey M. Scheduling parallel programs by work stealing with private deques //Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming. — 2013. — pp. 219-228.

Bibliographic reference: Chmil A. K, Perepelkin V.A. Dynamic Load Balancing Algorithms Application Automation Subsystem Development for LuNA System //Problems of informatics. 2022, № 4. P. 107-119. DOI:10.24412/2073-0667-2022-4-107-119. EDN: SKJWTU

V.V. Shakhov*’**, H. Chen***, A. N. Yurgenson**, A.V. Loshkarev****

* Novosibirsk State Technical University, 630073, Novosibirsk, Russia,

**Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090, Novosibirsk, Russia,

***China University of Petroleum, 266580, Qindao, China,

****Siberian State University of Telecommunications and Informatics, 630102, Novosibirsk, Russia

ON RELIABILITY OF LINEAR WIRELESS SENSOR NETWORKS

DOI: 10.24412/2073-0667-2022-4-120-128

EDN: XDGSRY

Many solutions in the field of architecture of the Internet of things are based on the results of wireless sensor networks (WSN) research. Currently, corporations and government agencies, especially in the US, Europe and the Middle East, are making serious efforts to research, develop and patent wireless sensor network-based technologies for monitoring long pipelines for various purposes. WSNs are able to carry out continuous monitoring of critical infrastructure objects, detect any anomalies in real time and deliver the necessary data to the decision-making center. However, in this case, it becomes necessary to solve a number of problems, such as rational placement of nodes, optimization of energy consumption, efficient organization of data flows, etc., for the solution of which it is necessary to use methods for assessing the reliability and lifetime of the WSN. After all, these networks can be operated in harsh climatic conditions, network nodes can be located in places that are difficult to access for regular inspection.

The main role of sensor nodes in the WSN used for monitoring is to periodically collect and transmit data to an intelligent central base station (sink, sink), where the collected data is processed to detect various anomalous events. In large- scale WSNs used to monitor long objects, such as pipelines, most sensor nodes are geographically distant from the base station and are usually equipped with self-contained low-cost batteries, the capacity of which is relatively small. This circumstance largely determines the main disadvantages of extended WSNs, since the periodic transmission of raw data over long distances through several hops to the base station leads to a rapid discharge of the battery of sensor nodes and reduces the life of the network. Other disadvantages include low reliability of wireless channels, high cost of bandwidth, low level of data security. Thus, there is a need to solve optimization problems for extended WSNs, where the objective function or constraints contain a reliability indicator.

Authors propose an approach to solving a number of problems that arise when monitoring long pipelines using wireless sensor networks.

A typical scenario used in a number of recent publications on this topic is considered. The WSN consists of several sensor nodes located on the surface of the pipe, the topology is a simple chain, at the end of which there is a base station. The sensors are responsible for collecting data, periodically sending packets to the base station. All nodes play an important role in data forwarding, the node closest to the base station transmits data directly to the sink, intermediate nodes are used to transmit packets from other nodes, i.e. data sent by the sender to the sink is relayed by nodes located between

the sender and the sink. The main power consumption is caused by traffic transmission. Obviously, this leads to excessive waste of energy of the sensor nodes located closer to the base station due to the high asymmetric load on these nodes.

Each sensor node performs periodic monitoring within its sensitivity range. All sensor nodes are initially in the same conditions, have similar communication capabilities, power consumption, their behavior is described by the same conceptual models. Each node transmits its packet to the neighboring node in the direction of the base station. The corresponding software module deployed on the base station receives data from all sensor nodes, decides on the presence or absence of a problem on its own, or via a highly reliable IP network, the data is transmitted to the decision center.

To formalize the reliability criteria, the corresponding mathematical models based on Markov processes have been developed. The obtained results make it possible to find a compromise between the reliability of the monitoring network and the costs of its deployment and maintenance.

Key words: wireless sensor networks, Internet of Things, structural health monitoring.

References

1. Uckelmann, D., Harrison, M., Michahelles, F. Architecting the Internet of Things. Springer: Berlin/Heidelberg, Germany, 2011.

2. Quintana-Suarez M., Sanchez-Rodriguez D., Alonso-Gonzalez I., Alonso-Hernandez J. A Low Cost Wireless Acoustic Sensor for Ambient Assisted Living Systems // Applied Sciences, vol. 7, no. 9, p. 877, Aug. 2017

3. Nkemeni V., Mieyeville F., and Tsafack P. A Distributed Computing Solution Based on Distributed Kalman Filter for Leak Detection in WSN-Based Water Pipeline Monitoring// Sensors, vol. 20, no. 18, p. 5204, Sep. 2020.

4. Ali S. et al. SimpliMote: A Wireless Sensor Network Monitoring Platform for Oil and Gas Pipelines // IEEE Systems Journal, vol. 12, no. 1, pp. 778-789, March 2018.

5. Albaseer A., Baroudi U. Cluster-Based Node Placement Approach for Linear Pipeline Monitoring// IEEE Access, vol. 7, pp. 92388-92397, 2019.

6. Tong F., He S., Pan J. Modeling and Analysis for Data Collection in Duty-Cycled Linear Sensor Networks With Pipelined-Forwarding Feature // IEEE Internet of Things Journal, vol. 6, no. 6, pp. 9489-9502, Dec. 2019.

7. Shakhov V. V., Yurgenson A. N. // Towards Edge Computing Based Monitoring for Smart Ports // Springer Lecture Notes in Computer Science (2021), vol. 12956.

8. Wang Q. Packet traffic: a good data source for wireless sensor network modeling and anomaly detection // IEEE Network, vol. 25, no. 3, pp. 15-21, May-June 2011.

9. Shakhov V., Koo I. Depletion-of-Battery Attack: Specificity, Modelling and Analysis // Sensors, vol. 18, no. 6, June 2018.

10. Shakhov V. V., Yurgenson A.N. Towards Edge Computing Based Monitoring for Smart Ports // Springer Lecture Notes in Computer Science, vol. 12958, 2021.

Bibliographic reference: Shakhov V. K, Chen H., Yurgenson A. N., Loshkarev A. V. On reliability of linear wireless sensor networks //Problems of informatics. 2022, № 4. P.120-128. DOI:10.24412/2073-0667-2022-4-120-128. EDN: XDGSRY

Main menu

2022 № 4(57)

Languages

Main menu

You are here

2022 № 4(57)

Languages