RU2514144C1 - Method of simulating mobile subscriber search in communication networks - Google Patents

Abstract

FIELD: radio engineering, communication.

SUBSTANCE: method involves measuring performance indices of real heterogeneous communication networks, simulating processes of operation and interaction of the simulated heterogeneous communication networks with each other, simulating the process of operation and movement of subscribers in heterogeneous communication networks, simulating the subscriber search process in heterogeneous communication networks.

EFFECT: high accuracy of evaluating simulated operating processes and conditions of dynamically moving communication network subscribers relative real, real-time operating networks taking into account the need to search for subscribers in heterogeneous communication networks.

6 dwg

Description

The invention relates to the field of modeling and can be used in the design of electronic, technical systems for evaluating the performance indicators of their functioning.

Interpretation of terms used in the application

The search task is understood as the task of determining the position of the search object - the subscriber located in a given region Ω of the n-dimensional Euclidean space R _n (O. Hellman, "Introduction to the theory of optimal search" - M .: Nauka, 1985. - 248 p., P. 7).

The position of the search object (subscriber) in a given area is described by an n-dimensional vector, the coordinates of which are the characteristics of the signal and information flows transmitted by it and the elements of communication networks.

Under the characteristics of the transmitted signal and information flows, determined by the signal propagation medium and the types of telecommunications and reflecting the location and state of the search objects - their sources, we mean (MV Garanin and other Information transmission systems and networks: Textbook for universities. - M .: Radio and communications, 2001. - 336 p., Pp. 11-12):

- spatial polarization and energy characteristics of the transmitted signals;

- used communication operator (real or virtual system);

- used operating frequencies (frequency range) and spectral characteristics of the transmitted carrier (analog) signals;

- characteristics of the structure of the transmitted data streams, the used data transfer protocols, service protocols (control, diagnostic, etc.), data exchange application services (services);

- identification signals and information (messages, data) of subscribers;

- service (control, diagnostic, etc.) signals and information (messages, data) of elements of heterogeneous communication networks.

The elementary search area is understood as the totality of values (elementary ranges of values) of the characteristics of the transmitted signal and information streams, estimated at one scan (view) step by the search unit (means) in the search process (V. A. Martynov, Yu. I. Selikhov “Panoramic receivers and spectrum analyzers ”- M.: Soviet Radio, 1980. - 352 p., p. 36).

By heterogeneous communication networks are understood (MV Garanin and others. Information transmission systems and networks: Textbook for universities. - M .: Radio and communications, 2001. - 336 p., Pp. 13-19): a) - primary communication networks, differing in the used medium of signal propagation and (or) b) - secondary communication networks deployed on their basis, differing in the type of telecommunication being implemented (type of transmitted messages, application data transmission service).

There is a known modeling method implemented in the invention ("Method for building a secure communication system", RF patent No. 2459370, H04L 12/00, published 08/20/2012, bull. No. 23). The method consists in modeling the joint functioning of a deployable communication system and already functioning in a given territory according to the criterion of a uniform change in the information content of unmasking signs.

However, in the analogue, a low reliability of the assessment of the simulated processes of functioning and states of subscribers of communication networks relative to actually functioning (existing) in real time, taking into account the need to search for subscribers on heterogeneous communication networks, is provided.

The closest in technical essence to the claimed method is the method selected as a prototype, implemented in the invention ("Method for modeling communication networks", RF patent No. 2379750, G06F 11/22, H04W 16/22, published on 01.20.2010, bull. No. 2). The prototype method consists in measuring the values of the functioning indicators of a real communication network, simulating changes in the network topology, simulating the movement of elements of a communication network, simulating the functioning of a simulated communication network, according to the results of which, the time for timely servicing of subscribers of the simulated communication network is calculated and time values for timely servicing of subscribers are measured on a really functioning communication network.

However, in the prototype method, a low reliability of the assessment of simulated processes of functioning and states of subscribers of communication networks relative to actually functioning (existing) in real time, taking into account the need to search for subscribers on heterogeneous communication networks, is provided.

The objective of the invention is to provide a method for simulating the search for mobile subscribers on communication networks, which allows to expand the capabilities of the prototype method, increase the reliability of the assessment of simulated processes of functioning and conditions of dynamically moving subscribers of communication networks relative to actually functioning (existing) in real time, taking into account the need to search for subscribers on heterogeneous communication networks.

This problem is solved by the fact that in the method of modeling the search for mobile subscribers on communication networks, which consists in forming a graph of the investigated communication network, writing to the generator registers a pseudo-random sequence of probability values for the existence of the ith vertex of the network graph, writing the code for the number of planned experiments, measuring the values of the performance indicators real communication network, simulating the functioning of a simulated communication network, according to the results of which the time of timely customer service is calculated the likelihood of connectivity of a simulated communication network, taking measurements of the values of the time for timely servicing of subscribers and the likelihood of connectivity of a really functioning communication network, comparing the values of the time of timely servicing of subscribers and the likelihood of connectivity with the required values, additionally form several graphs according to the number of simulated heterogeneous communication networks, set the initial data (boundaries areas of search for signals of subscribers and elements of communication networks in the process of information exchange, the sizes of elementary search areas, the average duration of a single scan (view) of the elementary search area, the multiplicity (number of times) of scan (view) of the elementary search areas, the frequency of scanning of elementary areas) during the formation of network graphs. For several heterogeneous communication networks, the probability values of the existence of the ith vertex of each network graph are recorded in registers of the pseudo-random sequence, the code of the number of planned experiments is recorded, and the characteristics of the functioning heterogeneous communication networks and their subscribers are measured (time distribution parameters of the intensities of information exchanges of subscribers in various communication networks , probability distribution parameters (intensities) of using different locations, frequency ranges, types of networks communication, signals for transmitting information, the probability of subscribers changing locations (used binding nodes, operators or communication networks), distribution parameters between elements (communication lines) of a subscribers information exchange network, probabilities (intensity) of warning (confirming) signals being transmitted by subscribers and communication network elements on the change of location (state) by subscribers, the average duration of periods of termination of information exchange by subscribers when changing their location (state), the degree of the severity of the transmitted signals and information of subscribers and network elements, the probability of detection (correct identification) of transmitted signals and information of subscribers and elements of communication networks, the probability of detection (correct identification) of warning (confirming) signals of communication network elements about a subscriber changing location (state), the dependence of the listed probabilities from the characteristics of the tension (intensity) of the search), simulate the topology and structure of heterogeneous communication networks, simulate the percent The essences of the functioning and interaction of the simulated heterogeneous communication networks among themselves, perform physical modeling of the functioning and movement of subscribers on heterogeneous communication networks and, therefore, the intensities (probabilities) of manifestation in various elementary search areas, imitate the transmission of warning signals by the elements of communication networks of a subscriber's change their topology on the ground, imitate the subscriber changing the network (operator, service) of communication, check the need to search for a subscriber nta on heterogeneous networks, simulate a subscriber search on heterogeneous communication networks, while generating a variant of distributing the total amount of information exchange of a subscriber over heterogeneous communication networks, generating a variant of distributing information exchange of a subscriber in a specific network by its nodes (lines), generating time and directions changes by the subscriber of his location (binding to nodes or a telecom operator), generation of time and directions of exchange between network elements about the status of the subscriber on communication networks , verify that the subscriber changes his condition (location, binding to nodes or a telecom operator), if not, then continues to simulate the functioning of the simulated heterogeneous communication networks and measure the values of the timeliness of customer service on functioning communication networks and calculate the probability of connectivity, and if time If the subscriber changes his location (state), it is simulated by temporarily turning off the subscriber’s equipment (when moving on the ground), imitating information transfer between communication network elements about a subscriber changing his state, imitation of a subscriber’s change of a communication operator (network) and redistribution of information exchange across heterogeneous communication networks, imitation of a subscriber’s change of an anchor node and redistribution of information exchange over nodes (communication lines) of a network, accumulation and refinement of statistical data on the basis of the subscriber.

It is checked whether the search for the subscriber is required, if not, then the simulation continues of the functioning of the simulated heterogeneous communication networks and the measurement of the indicators of timeliness of customer service on functioning communication networks and the calculation of the likelihood of connectivity, and if the search for the subscriber is required, then a list of elementary areas is generated for conducting a search, generating scan time (viewing) of the elementary search area for detecting subscriber signals or service information the elements of the network about the subscriber’s state, simulating a scan (view) of the next elementary search area, it checks whether additional scanning (view) of the elementary search area is required, if so, the simulation of its scan (view) is repeated, and if the additional scan (view) ) the elementary area is not required, then the scan results are generated, check whether the subscriber’s signal is detected or information about the subscriber’s status (position), if so, then check the list accordingly to elementary areas to continue the search, taking into account the information of the network element about the status (position) of the subscriber and evaluate the reliability (completeness) of the detection if the reliability (completeness) of the detection is not sufficient or neither the signal of the subscriber nor the information of the network element on the status (position) of the subscriber , then the simulation of the search for the subscriber on heterogeneous communication networks continues, and if the reliability (completeness) of the detection of the subscriber is sufficient, then the simulation of the functioning of the simulated heterogeneous communication networks continues and measuring the values of indicators of the timeliness of customer service on functioning communication networks and calculating the likelihood of connectivity.

Thus, the above additions provide an extension of the capabilities of the prototype method, an increase in the reliability of the assessment of simulated processes of functioning and conditions of subscribers of communication networks relative to actually functioning (existing) in real time, taking into account the need to search for subscribers on heterogeneous communication networks.

The analysis of the prior art allowed to establish that analogues, characterized by sets of features that are identical to all the features of the claimed method, are absent. Therefore, the claimed invention meets the condition of patentability "novelty."

Search results for known solutions in this and related fields of technology in order to identify features that match the distinctive features of the claimed invention from the prototypes showed that they do not follow explicitly from the prior art. From the prior art determined by the applicant, the influence of the provided by the essential features of the claimed invention on the achievement of the specified technical result is not known. Therefore, the claimed invention meets the condition of patentability "inventive step".

"Industrial applicability" of the method is due to the presence of the element base, on the basis of which devices that implement this method can be made, with the achievement of the destination specified in the invention.

The claimed method is illustrated by drawings, which show:

figure 1 is a generalized block diagram of a simulation of a communication network;

figure 2 is a generalized block diagram of a simulation of the functioning of the simulated heterogeneous communication networks;

figure 3 is a generalized block diagram of a simulation of the functioning and movement of subscribers on simulated heterogeneous communication networks;

figure 4 is a generalized block diagram of a simulation of a subscriber search on heterogeneous communication networks;

5 is a generalized block diagram of a scan (view) simulation of another elementary search area;

6 is a diagram of a variant of ranking of elementary search areas using an example of a space of two characteristics.

To implement the claimed method can be in the form of a generalized block diagram of the simulation shown in figure 1. In block 1, the basic input data is entered:

- the boundaries of the areas of search for signals of subscribers' equipment and elements of communication networks in the process of information exchange;

- types and sizes of elementary search areas;

- the average duration of a single scan (view) of the elementary search area;

- the multiplicity (number of times) of scanning (viewing) elementary search areas, the frequency of scanning elementary areas.

In block 2, the measurement of characteristics is carried out for really functioning heterogeneous communication networks and their subscribers. Measurement is carried out by collecting, accumulating and updating statistical data on the structure and functioning of communication networks, their subscribers and the transmitted signal and information flows using technical control equipment (Menshakov Yu.K. Protection of objects and information from reconnaissance equipment. - M .: Russian State Humanitarian University, 2002 .-- 399 p., Pp. 385-387):

- structural, statistical and logical (semantic) characteristics of signals and messages of subscribers (including identification data - phone numbers, personal details, addresses, identifiers, codes, etc.);

- parameters of the time distribution of the intensities of information exchanges of subscribers in various communication networks;

- parameters of the probability distribution (intensity) of using various locations, frequency ranges, types of communication networks, signals for transmitting information;

- the likelihood of subscribers changing locations (used binding nodes, operators or communication networks);

- distribution parameters between elements of the network of information exchanges of subscribers;

- probabilities (intensities) of transmission by subscribers and communication network elements of warning (confirming) signals about subscribers changing locations (states);

- average durations of periods of termination of information exchange by subscribers when changing their locations (conditions);

- the degree of distortion of the transmitted signals and information of subscribers and network elements;

- the probability of detection (correct identification) of transmitted signals and information of subscribers and elements of communication networks;

- the probability of detection (correct identification) of warning (confirming) signals of communication network elements about a subscriber changing his location (state);

- dependencies of the listed probabilities on the characteristics of the tension (intensity) of the search.

In block 3, the topology and structure of heterogeneous communication networks are modeled. Moreover, the layout topology of communication network elements is presented taking into account several N groups of elements. For each group of elements, the coordinates of the regions of their distribution are generated.

The first group consists of elements of communication networks, the locations of which are limited to the areas where the subscribers of communication networks are located. Representation of their coordinates is provided using the relations:

$$X_{CC}^{\left(\mathrm{one}\right)}=X_{\min }^{\left(\mathrm{one}\right)}+\left(X_{\max }^{\left(\mathrm{one}\right)}-X_{\min }^{\left(\mathrm{one}\right)}\right)D_{0.1},$$

$$Y_{CC}^{\left(\mathrm{one}\right)}=Y_{\min }^{\left(\mathrm{one}\right)}+\left(Y_{\max }^{\left(\mathrm{one}\right)}-Y_{\min }^{\left(\mathrm{one}\right)}\right)D_{0.1},$$

$$Y_{CC}^{\left(1\right)}$$

- координаты элемента сети соответственно по осям Х и Y;Where $$X_{CC}^{\left(\mathrm{one}\right)},$$

$$Y_{CC}^{\left(\mathrm{one}\right)}$$

- the coordinates of the network element, respectively, along the X and Y axes;

$$X_{\min }^{\left(1\right)}$$

- соответственно максимально и минимально возможное удаление элемента сети связи от места нахождения абонента (абонентов) по оси X; $$X_{\max }^{\left(\mathrm{one}\right)},$$

$$X_{\min }^{\left(\mathrm{one}\right)}$$

- respectively, the maximum and minimum possible removal of a communication network element from the location of the subscriber (s) along the X axis;

$$Y_{\min }^{\left(1\right)}$$

- соответственно максимально и минимально возможное удаление элемента сети связи от места нахождения абонента (абонентов) по оси Y; $$Y_{\max }^{\left(\mathrm{one}\right)},$$

$$Y_{\min }^{\left(\mathrm{one}\right)}$$

- respectively, the maximum and minimum possible removal of the communication network element from the location of the subscriber (s) along the Y axis;

D _0,1 is a random number distributed over the interval (0,1), obtained using a random number sensor.

The second group includes elements of communication networks whose coordinates depend on the position of elements of communication networks of the first group. Simulation of their areas of accommodation is carried out using the expressions:

$$X_{CC}^{\left(2\right)}=X_{CC}^{\left(\mathrm{one}\right)}+\cos \alpha \left[L_{\min }^{\left(2\right)}+\left(L_{\max }^{\left(2\right)}-L_{\min }^{\left(2\right)}\right)D_{0.1}\right],$$

$$Y_{CC}^{\left(2\right)}=Y_{CC}^{\left(\mathrm{one}\right)}+\sin \alpha \left[M_{\min }^{\left(2\right)}+\left(M_{\max }^{\left(2\right)}-M_{\min }^{\left(2\right)}\right)D_{0.1}\right],$$

$$Y_{CC}^{\left(1\right)}$$

- координаты района развертывания элемента сети связи первой группы;Where $$X_{CC}^{\left(\mathrm{one}\right)},$$

$$Y_{CC}^{\left(\mathrm{one}\right)}$$

- the coordinates of the deployment area of the communication element of the first group;

- соответственно максимально и минимально возможное удаление элемента сети связи второй группы от элемента сети связи первой группы по оси X, $$L_{\max }^{\left(2\right)},$$

- respectively, the maximum and minimum possible removal of the communication network element of the second group from the communication network element of the first group along the X axis,

- соответственно максимально и минимально возможное удаление элемента сети связи второй группы от элемента сети связи первой группы по оси Y; $$M_{\max }^{\left(2\right)},$$

- respectively, the maximum and minimum possible removal of the communication network element of the second group from the communication network element of the first group along the Y axis;

α is the angle determining the location of the communication element of the second group relative to the element of the communication network of the first group.

The third group consists of elements of communication networks whose location is correlated with the coordinates of the elements of networks of the second group.

The nth group consists of elements of communication networks whose location is correlated with the coordinates of elements of communication networks of the (N-1) th group. Simulation of their areas of accommodation is carried out using the expressions:

$$X_{CC}^{\left(N\right)}=X_{CC}^{\left(N-\mathrm{one}\right)}+\cos \beta \left[L_{\min }^{\left(N\right)}+\left(L_{\max }^{\left(N\right)}-L_{\min }^{\left(N\right)}\right)D_{0.1}\right],$$

$$Y_{CC}^{\left(N\right)}=Y_{CC}^{\left(N-\mathrm{one}\right)}+\sin \beta \left[M_{\min }^{\left(N\right)}+\left(M_{\max }^{\left(N\right)}-M_{\min }^{\left(N\right)}\right)D_{0.1}\right],$$

- координаты района развертывания элемента сети связи (N-1)-й группы;Where $$X_{CC}^{\left(N-\mathrm{one}\right)},$$

- coordinates of the deployment area of the communication network element (N-1) of the group;

- соответственно максимально и минимально возможное удаление элемента сети связи N-й группы от элемента сети связи (N-1)-й группы по оси X; $$L_{\max }^{\left(N\right)},$$

- respectively, the maximum and minimum possible removal of the communication network element of the Nth group from the communication network element of the (N-1) th group along the X axis;

- соответственно максимально и минимально возможное удаление элемента сети связи N-й группы от элемента сети связи (N-1)-й группы по оси Y; $$M_{\max }^{\left(N\right)},$$

- respectively, the maximum and minimum possible removal of the communication network element of the Nth group from the communication network element of the (N-1) th group along the Y axis;

β is the angle determining the location of the communication network element of the Nth group relative to the communication network element of the (N-1) th group.

Simulation of the coordinates of the placement of elements of communication networks of all groups is carried out sequentially from groups with the lowest numbers to groups with the highest numbers in ascending order.

The structures of simulated heterogeneous communication networks can be modeled using simulators of formal mathematical models of communication channels based on the apparatus of system functions (Galkin A.P. et al. Modeling of communication system channels. - M .: Communication, 1979. - 96 p., P. .40-52). The generalized functional diagram of such a simulator includes a control device and a shaper of a system function. The control device generates a pseudo-random sequence that characterizes the outage stream of the corresponding branch (communication channel) and, accordingly, the termination of information exchange through it. Each branch disconnection may relate to:

- to a separate type of telecommunication (type of transmitted messages, application data service) provided by this secondary communication network;

- several types of telecommunications (types of transmitted messages, application data services) provided by this secondary communication network;

- or in general to the primary network communication channel based on a given used signal propagation medium.

Moreover, each branch (communication channel) of heterogeneous communication networks is associated with a separate such simulator.

In block 4, the process of functioning of the simulated heterogeneous communication networks is simulated (figure 2). Moreover, the structures of the studied communication networks are considered as a set of {M} bipolar systems. The poles in bipolar systems are the subscribers of communication networks. The information direction of communication (subscriber-subscriber) is considered efficient if there is at least one way of successful functioning from one subscriber to another (Simulation of means and complexes of communication and automation. Ivanov E.V. SPb .: VAS, 1992, 206 pp., p. 125).

Block 5 imitates the process of functioning and movement of subscribers on simulated heterogeneous communication networks (Fig. 3).

In block 6, a measure of the timeliness of customer service on functioning communication networks is measured and the likelihood of connectivity is calculated. At the same time, the durations of existence (absence) of at least one way of successful functioning for each communication information direction (subscriber-subscriber) in heterogeneous networks, the statistics of the number of other subscribers in heterogeneous networks with which a given subscriber is connected, as well as the duration of periods, are measured search for subscribers on heterogeneous communication networks.

In block 7, the collection, accumulation and refinement of statistical data based on the characteristics of the subscriber. In block 8, the end of the simulation time is checked. Block 9 simulates the verification of the need for a subscriber search. If the search is not required, then control is transferred to blocks 4, 5, 6, and if required, then to block 10.

In block 10, a subscriber search is simulated on heterogeneous communication networks (Fig. 4).

The process of functioning simulated heterogeneous communication networks is implemented in the flowchart shown in figure 2.

In block 4.1, the initial data are input: the average value of the time of termination (failure) of communication in specific directions (lines) of each element of communication networks, the average value of the time of renewal (restoration) of communication in specific directions (lines) of each element of communication networks and the laws of their distribution.

In block 4.2, formalization of the structures of the studied communication networks is carried out. The scheme is presented in the form of separate groups. The type of group depends on the inclusion of elements within the group. Three types of groups are distinguished (Simulation of means and complexes of communication and automation. Ivanov EV, St. Petersburg: VAS, 1992, 206 pp., P. 126):

- the simplest, consisting of one element;

- parallel, in which the elements duplicate each other;

- complex, in which there is a parallel-sequential inclusion of elements.

All selected types of groups are assigned serial numbers.

In block 4.3, a matrix is constructed for describing elements of communication networks, as well as a matrix for describing groups of elements.

In block 4.4, a matrix of paths for successful functioning (FFM) is constructed.

In block 4.5, the next communication network is selected, the elements of the communication networks are numbered in ascending order, and the number 1 is assigned to the first element.

In blocks 4.6 and 4.7, a check of the condition for exclusion (resumption of operation) of the next branch (communication channel) of the selected element of the communication network is simulated. If an exception (resumption of operation) of the next branch (communication channel) has occurred, then control is transferred to block 4.8, and if the state of the branch has not changed, then to block 4.18.

In block 4.8, the time for terminating (resuming) the transmission of information and signals corresponding to the types of telecommunications provided by this network by the selected element of the communication network via this branch (communication channel) is fixed.

In block 4.9, the termination (resumption) of transmission of a selected element of a communication network of the types of messages and signals corresponding to the types of telecommunications provided by this network is simulated by a branch (communication channel).

In block 4.10, exclusion (inclusion) of the paths of successful operation in the selected communication network containing this branch (communication channel) is made.

In blocks 4.11 and 4.12, the presence of other (bypassing for this branch) paths of successful operation in the selected communication network is simulated. If there are other ways of successful functioning in the selected communication network, then control is transferred to block 4.13, and if there are no other (workarounds), then to block 4.14.

In block 4.13, the translation (reverse translation) of the transmitted information exchange corresponding to the types of telecommunications provided by this network is simulated to workarounds for successful operation (restored path) in the selected network.

In blocks 4.14 and 4.15, it is imitated that there are other (bypassing for this branch) ways of successful functioning for the transmitted information exchange corresponding to the types of telecommunications provided by the network in question in other communication networks. If there are ways of successful functioning in other communication networks, then control is transferred to block 4.16, and if there are no other (bypassing in other communication networks) ways, then to block 4.17.

In block 4.16, the translation (reverse translation) of the transmitted information exchange corresponding to the types of telecommunications provided by this network is mimicked to workarounds for successful operation in other communication networks (to the restored path in the selected network).

Block 4.17 imitates the termination (resumption) of the transmission of information exchange corresponding to specified types of telecommunications in this information direction (directions) of communication. In block 4.18, the check of completion of the list of branches (communication channels) of the selected element of the communication network is simulated. If there are still unverified branches, then control is transferred to block 4.6, and if they are not, then to block 4.19.

In block 4.19, the check of completion of the list of elements of the selected communication network is simulated. If there are still unverified elements, then control is transferred to block 4.20, and if they are not, then to block 4.21.

In block 4.20, the number of the element being checked is increased by 1. Next, control is transferred to block 4.6.

In block 4.21, the check of completion of the list of heterogeneous communication networks is simulated. If there are still unverified communication networks, then control is transferred to block 4.5, and if they are not, then to block 7.

The process of functioning and movement of subscribers on simulated heterogeneous communication networks is implemented in the flowchart shown in figure 3.

In block 5.1, a variant of the distribution of the total amount of information exchange of the subscriber over heterogeneous communication networks is generated. Moreover, in accordance with the method of simulation by lot (simulation of means and complexes of communication and automation. Ivanov EV SPb .: VAS, 1992, 206 pp., P. 10), taking into account the given law of distribution of random variables of shares of total intensity the total information exchange of the subscriber, corresponding to several heterogeneous networks, the values of random values of these shares are selected.

In block 5.2, a variant of the distribution of subscriber information exchange in each network by its nodes (communication lines) is generated. In this case, by analogy with block 5.1, the values of random values of the fractions of the intensity of the information exchange of the subscriber in each network are selected.

In blocks 5.3 and 5.4, the time and directions of change by the subscriber, respectively, of their location (binding to nodes or a telecom operator) and the time and directions of exchange between elements of specific networks about the status of the subscriber on communication networks are generated. In this case, by analogy with block 5.1, the values of the listed random variables are selected.

In block 5.5, the duration of the time interval for simulating the functioning of the subscriber on simulated communication networks is controlled. At the same time, the accumulated simulation time is increased by the value of an elementary unit of model time (Simulation modeling of communication and automation systems and complexes. Ivanov, EV St. Petersburg: VAS, 1992, 206 p., P. 103).

In block 5.6, the fulfillment of the condition for simulating the movement of the subscriber is checked (the subscriber changes his location, binding to nodes or a telecom operator). If not, then control is transferred to block 7. If the time has come to simulate the movement, then control is transferred to block 5.7.

In block 5.7, the verification of the conditions for changing the location of the subscriber is simulated. If the location does not change, then control is transferred to block 5.14. If a change in the location of the subscriber is necessary, then control is transferred to block 5.8.

In block 5.8, the duration of the time interval simulating the change in the location of the subscriber is controlled. The initial data for modeling the variable coordinates of subscribers of communication networks X _ab , Y _ab are the motion parameters: the speed of movement of the subscriber of the communication network υ, the angle Θ of the movement of the subscriber of the network or the projection of the velocity vector:

υ _x = υ · cosΘ ,

υ _y = υ · sinΘ.

Wherein:

$$X_{\mathrm{but}b}={\upsilon }_{x}t+X_{\mathrm{but}b}^{\left(t_0\right)},{\text{Y}}_{\mathrm{but}b}={\upsilon }_{y}t+Y_{\mathrm{but}b}^{\left(t_0\right)},$$

where t ₀ is the time the subscriber started moving;

$$Y_{аб}^{\left(t_0\right)}$$

- координаты начального местоположения абонента. $$X_{\mathrm{but}b}^{\left(t_0\right)},$$

$$Y_{\mathrm{but}b}^{\left(t_0\right)}$$

- coordinates of the initial location of the subscriber.

Simulation of the value of the time the subscriber moves from one location to another is carried out taking into account the formula:

t = t _cp + D _0.1 ,

where t _cf - the average value of the time the subscriber moves when changing location.

The procedure for selecting the coordinates of the location area of the roaming subscriber of the communication network is iterative. The rule for completing the coordinate selection procedure uses the criterion:

$$R_{\mathrm{to}R.i,j}\ge R_{\max }|\; |\; |{}_{t_{\mathrm{about}b\mathrm{from}l}\le t_{\mathrm{about}b\mathrm{from}l}^{tR}},$$

where R _{cr.i, j} is the territorial separation between the i-th position of the moved subscriber and the j-th position of the elements of the communication network interacting with this subscriber;

R _max - the maximum allowable territorial separation;

- соответственно время обслуживания и требуемое время обслуживания абонентов.t _obsl $$t_{\mathrm{about}b\mathrm{from}l}^{tR}$$

- respectively, the service time and the required customer service time.

In block 5.9, it is checked whether the change of location of the subscriber is completed. If not, then control is transferred to block 5.11. If the change of location of the subscriber is completed, then control is transferred to block 5.10.

Block 5.10 imitates the resumption of the functioning of the subscriber after a change of location. In this case, the simulation of transmission and receipt by the subscriber of message flows with the specified distribution parameters over the nodes of heterogeneous communication networks is resumed.

Block 5.11 imitates the temporary cessation of work (when moving on the ground) of the subscriber. In this case, the establishment ("reset") of values equal to zero for the transmission and receipt rates by the subscriber of message flows over all nodes and branches (communication lines) of dissimilar communication networks.

In block 5.12, the conditions for the next exchange of service information between network elements on the status of subscribers are checked. If not, control is transferred to block 5.9. If the time has come to make the next exchange of service information, then control is transferred to block 5.13.

In blocks 5.13 and 5.18, the transmission of service information by network elements on the status of subscribers on communication networks is simulated.

In block 5.14, the fulfillment of the conditions for the shift by the subscriber of the telecom operator is checked. If not, control is transferred to block 5.16. If it is time for the subscriber to change the carrier, then control is transferred to block 5.15. At the same time, a subscriber’s change of a telecom operator means a change in the values of the characteristics of the transmitted signal and information flows that corresponds to the use by the subscriber of a different (new) telecom operator.

In block 5.15, a new version of the distribution of the total amount of information exchange of the subscriber over heterogeneous communication networks is simulated. In this case, by analogy with block 5.1, new values of random values of fractions of the total intensity of the total information exchange of the subscriber corresponding to several heterogeneous networks are selected.

In block 5.16, the fulfillment of the conditions for the change of the binding site by the subscriber is checked. If not, then control is transferred to block 5.18. If it is time for the subscriber to change the binding node, then control is transferred to block 5.17. At the same time, by a subscriber changing a binding node in a communication network is meant a change in the characteristics of the transmitted signal and information flows that corresponds to the subscriber using another (new) network node.

In block 5.17, a new version of the distribution of the total amount of information exchange of the subscriber over the nodes (lines) of the communication network is simulated. In this case, by analogy with block 5.1, new values of random values of the fractions of the intensity of the information exchange of the subscriber in a particular network are selected.

The simulation of the subscriber search process on heterogeneous communication networks is implemented in the flowchart shown in Fig.4. At the same time, the methods of action of simulated search tools can be modeled using algorithms for passing search areas of the form “search in a given area”, “search at the boundary”, “search by call”, “search with variable courses” (Abchuk V.A. et al. Introduction to the theory of decision-making. - M .: Military Publishing House, 1972.- 344 p., Pp. 117-127).

In block 10.1, a list of elementary regions for conducting a search is generated. The generation of this list is based on the source data (see block 1) about the boundaries of the search areas, types and sizes of elementary search areas for signals of subscribers' equipment and elements of communication networks. In this case, by analogy with block 5.1, the values of the probabilities (intensities) of the use by specific heterogeneous networks of each elementary search area from the generated list are selected.

In block 10.2, the list of elementary search areas is ranked according to the probabilities (intensities) selected in the previous block for their use for the subscriber (transmission of signals of the subscriber’s equipment or exchange of service information by network elements about his location and condition) and / or average rates of change of these values by to all subscribers. The latter determine the minimum frequency (activity) of repeated scanning (viewing) of individual elementary regions in order to ensure the reliability of data on the values of the indicated intensities (probabilities) in the search system. The values of the intensities (probabilities) of use for subscribers of certain elementary areas and other characteristics of subscribers and their equipment (search "portraits" of subscribers), reflecting their location and condition, are determined during blocks 2-7 of the generalized modeling block diagram (Fig. 1) . An illustration of a ranking option for elementary search areas using an example of a space of two characteristics is shown in FIG. 6. In this figure, using the ovals indicated by dashed lines, as well as using various saturation of the shading, groups of elementary search areas are shown with different probability of finding signals and information transmitted by the subscriber’s equipment in them. The illustration clearly demonstrates how narrowed the search area is if there is data on the direction and approximate speed of movement of the subscriber’s equipment.

In block 10.3, the scanning (viewing) time of the elementary search area of the identification characteristics (attributes) of the subscriber signals and (or) the service information of the communication network elements about its state is generated. In this case, by analogy with block 5.1, a random value of a given scan time is selected.

In block 10.4, a scan (view) of the next elementary subscriber search area from the ranked list is simulated (FIG. 5). At the same time, elementary areas are viewed first, for which the intensities (probabilities) of using them for the subscriber (signaling the equipment of the subscriber himself or exchanging service information with network elements about his location and condition) and / or average rates of change of these values for all subscribers are higher.

In block 10.5, it is checked whether the simulation of the search for a specific subscriber is to be continued at the current moment or whether the task of detecting it has already been completed. In this case, the result of checking the correspondence of the current value of the indicator of reliability (completeness) of the subscriber’s detection to the required value is taken into account (blocks 10.10 and 10.11). If the simulation of the search for the specific desired subscriber should be continued, then control is transferred to block 10.6, and if the task of detecting the subscriber is completed, i.e. the current value of the indicator of reliability (completeness) of subscriber detection corresponds to the desired value, then to block 10.12. The latter imitates the function of refinement of search “portraits” of subscribers without targeting specific ones by scanning (viewing) the rest of the search area.

In block 10.6, the presence of detected overhead information of communication network elements about the status of the subscriber is checked according to the results of viewing the next elementary search area. If such information of network elements is not detected, then control is transferred to block 10.8, and if detected, then to block 10.7.

In block 10.7, the list of elementary search areas of the subscriber is refined taking into account the new service information of the network element about the status of the subscriber.

In block 10.8, a list of estimates of the values of the characteristics of the detected signals and messages is generated with the values of the characteristics of the equipment (search "portrait") of the subscriber.

In block 10.9, it is checked whether a signal directly to the equipment of the subscriber is detected. If yes, then control is transferred to block 10.10, and if not, then to block 10.13. The signal of the subscriber’s equipment is understood to mean the signal emitted (transmitted) by a set of communication equipment directly from the subscriber or re-emitted (relayed) by the elements of the communication network. The decision to detect the signal of the subscriber’s equipment is made on the basis of determining the Euclidean distance between the set of estimates of the characteristics of the detected signals and messages with the search “portrait” of the subscriber (Abchuk V.A. et al. Introduction to the theory of decision-making. - M .: Voenizdat, 1972. - 344 p., Pp. 110-113).

In blocks 10.10 and 10.11, respectively, the calculation and verification of the correspondence of the current value of the indicator of reliability (completeness) of subscriber detection to the required value is performed. If the requirement is not met, then control is transferred to block 10.13, and if it is, then to block 10.15.

In block 10.12, the intensities (probabilities) of the use of the next elementary search area are refined for various subscribers, taking into account the results of its current viewing (scanning).

In block 10.13, the transition to the next elementary search area is performed, and in block 10.14, the conditions for completing the search area are checked. If it has not completed (N _EO > 0), then control is transferred to block 10.4, and if completed, then to block 8.

In block 10.15, the subscriber’s characteristics (search “portrait”) are refined based on the results of his search on heterogeneous networks. In this case, the distribution of the intensities (probabilities) of the use of elementary search areas for a given subscriber is refined taking into account the results of their current viewing (scanning), as well as the refinement of the values of other subscriber characteristics. Further, by analogy with block 5.1, new values of the probabilities (intensities) of the use by each subscriber of each elementary search area from the generated list are selected.

In block 10.16, the list of elementary search areas is refined taking into account the results of subscriber detection and the need to continue the search in order to clarify the intensities (probabilities) of using elementary search areas by different subscribers, as well as to correct search “portraits” of subscribers. In this case, the distributions of the intensities (probabilities) of the use of elementary search areas for other subscribers are refined taking into account the results of their current viewing (scanning), as well as the refinement of the values of other characteristics of the subscribers. Then, by analogy with block 5.1, new values of the probabilities (intensities) of the use by other subscribers of each elementary search area from the generated list are selected.

The process of simulating scanning (viewing) of the next elementary search area of the subscriber is implemented in the flowchart shown in Fig.5. In this case, simulated events of coincidence of the settings of the search tools with the characteristics of the settings of the subscriber’s equipment and the resolutions (recognitions) of signals during the search can be modeled using the approach based on the conditional probability of detection (V.A. Martynov, Yu.I. Selikhov “Panoramic receivers and spectrum analyzers ”- M .: Soviet Radio, 1980. - 352 p., pp. 34-53).

In block 10.3.1, the duration of the time period of scanning (viewing) simulation of the next elementary search area is controlled.

In block 10.3.2, it is checked whether the scanning (viewing) of the next elementary search area is completed. If not, then control is transferred to block 10.3.5. If the scan is completed, then control is transferred to block 10.3.3.

In block 10.3.3, it is checked whether additional scanning of this elementary search area is required. If yes, then control is transferred to block 10.3.1, and if no additional measurement is required, then to block 10.3.4.

In block 10.3.4, a search result is generated (a simulated version of the decision on detection / non-detection is generated) in this elementary search area for identification characteristics (signs) of the subscriber’s equipment signals or service information of communication network elements about its status. In this case, the coincidence of the following events is recorded:

- the scanned (viewed) line (channel) of communication with the equipment of the subscriber or element of the communication network has not stopped (has already resumed) the transmission of information and signals (see blocks 4.8-4.10);

- the fraction of the total intensity of the total information exchange of the subscriber attributable to the scanned (viewed) communication line (channel) is not equal to zero (see blocks 5.1-5.2);

- the model time of transmission of signals and information regarding the subscriber coincided with the scan time of this elementary search area (see blocks 10.3-10.4).

To fix the match, you can use the TEST function of the GPSS environment (Simulation of means and complexes of communication and automation. Ivanov EV, St. Petersburg: VAS, 1992, 206 pp. 64).

Evaluation of the effectiveness of the proposed method was carried out by comparing the reliability of the assessment of the obtained results when modeling communication networks for the prototype method and when modeling the search for subscribers on communication networks for the proposed method.

From the formula 11.8.6 (Ventzel E.S., Ovcharov L.A. Probability theory and its engineering applications. - M.: Nauka. Gl. Ed. Phys.-Math. Lite. - 1988, 480 p., p. 463):

$$P\left(|\; |\; |R_{\mathrm{about}w}-R_{\mathrm{about}w}^{*}|\; |\; |<\epsilon \right)=2F\left(\frac{\epsilon \sqrt{N}}{\sqrt{R_{\mathrm{about}w}^{*}\cdot \left(\mathrm{one}-R_{\mathrm{about}w}^{*}\right)}}\right),$$

where Φ is the Laplace function;

N is the number of simulated events;

r _osh - the real value of the assessment;

- требуемое значение оценки;

- the required value of the assessment;

ε is the value of the confidence interval,

we will determine the reliability of the results of modeling subscriber servicing processes on functioning communication networks for a complex system (set) of heterogeneous communication networks, taking:

$$D=P\left(|\; |\; |R_{\mathrm{about}w}-R_{\mathrm{about}w}^{*}|\; |\; |<\epsilon \right)=2F\left(\frac{\epsilon \sqrt{N}}{\sqrt{R_{\mathrm{about}w}^{*}\cdot \left(\mathrm{one}-R_{\mathrm{about}w}^{*}\right)}}\right).$$

We pass from the Laplace function to its argument (Simulation of means and complexes of communication and automation. Ivanov EV St. Petersburg: VAS, 1992, 206 p. 14):

$$t_{\alpha }=\left(\frac{\epsilon \sqrt{N}}{\sqrt{R_{\mathrm{about}w}^{*}\cdot \left(\mathrm{one}-R_{\mathrm{about}w}^{*}\right)}}\right).$$

Then:

$$t_{\alpha }^2=\frac{{\epsilon }^{2}N}{R_{\mathrm{about}w}^{*}\cdot \left(\mathrm{one}-R_{\mathrm{about}w}^{*}\right)}.$$

вычислить не удается, можно воспользоваться упрощенной формулой для наихудшего случая $${р}_{ош}={р}_{ош}^{*}=\mathrm{0,5.}$$

Тогда:For the case when r _osh ;

cannot be calculated, you can use the simplified worst-case formula $$R_{\mathrm{about}w}=R_{\mathrm{about}w}^{*}=\mathrm{0.5.}$$

Then:

$$t_{\alpha }^2=\mathrm{four}{\epsilon }^{2}N.$$

и $$t_{\alpha 2}^2,$$

принимая ε=0,05, а N=7 для прототипа (при моделировании: а) процесса формирования структуры сети связи, б) процесса размещения на местности (формирования топологии) элементов сети связи, в) изменений структуры сети связи, г) изменений топологии сети связи, д) процесса функционирования реальной сети связи, е) процесса функционирования абонентов на моделируемой сети связи, ж) перемещения абонентов на моделируемой сети связи) и N=8 для предлагаемого способа (при моделировании: а) процесса формирования разнородных сетей связи, б) процесса размещения на местности (формирования топологии) элементов сети связи, в) изменений структур разнородных сетей связи, г) изменений топологии сети связи, д) процессов функционирования реальных сетей связи, е) процессов функционирования абонентов на моделируемых разнородных сетях связи, ж) перемещения абонентов на моделируемой сети связи, з) процессов проведения поиска абонентов (сигналов и информации, касающихся их) на разнородных сетях связи):Define

and $$t_{\alpha 2}^2,$$

assuming ε = 0.05, and N = 7 for the prototype (when modeling: a) the process of forming the structure of the communication network, b) the process of locating on the ground (forming the topology) elements of the communication network, c) changes in the structure of the communication network, d) changes in the topology communication network, e) the process of functioning of a real communication network, f) the process of functioning of subscribers on a simulated communication network, g) the movement of subscribers on a simulated communication network) and N = 8 for the proposed method (when modeling: a) the process of forming heterogeneous communication networks, b ) placement process n and the terrain (topology formation) of the elements of the communication network, c) changes in the structures of the heterogeneous communication networks, d) changes in the topology of the communication network, e) the processes of functioning of real communication networks, e) the processes of functioning of subscribers on the simulated heterogeneous communication networks, g) the movement of subscribers on the simulated communication networks, h) the processes of searching for subscribers (signals and information relating to them) on heterogeneous communication networks):

$$t_{\alpha \mathrm{one}}=2\cdot 0.05\cdot \sqrt{7}=\mathrm{2,646,}$$

$$t_{\alpha 2}=2\cdot 0.05\cdot \sqrt{8}=\mathrm{2,848.}$$

Evaluation of the effectiveness of the claimed method:

$$E=|\; |\; |\frac{t_{\alpha \mathrm{one}}-t_{\alpha 2}}{t_{\alpha 2}}|\; |\; |\cdot \mathrm{one\; hundred}\%;$$

$$E=|\; |\; |\frac{\mathrm{2,646}-\mathrm{2,848}}{\mathrm{2,848}}|\; |\; |\cdot \mathrm{one\; hundred}\approx 6.4\%.$$

Thus, the claimed technical result is achieved.

Claims (1)

A method for simulating the search for mobile subscribers on communication networks, which consists in forming a graph of the investigated communication network, writing to the generator registers a pseudo-random sequence of probability values for the existence of the i-th vertex of the network graph, writing the code for the number of planned experiments, measuring the values of the functioning indicators of a real communication network, simulating the functioning a simulated communication network, according to the results of which the time of timely customer service and the likelihood of model connectivity are calculated communication network, measuring the values of the time for timely servicing of subscribers and the likelihood of connectivity of a really functioning communication network, comparing the values of the time of timely servicing of subscribers and the likelihood of connectivity with the required values, characterized in that several graphs are formed according to the number of modeled heterogeneous communication networks, the initial data are set for the formation of network graphs, the values of the probabilities of the existence of the i-th vertex of each are recorded in the registers of the pseudo-random sequence network graph for several heterogeneous communication networks, write the code for the number of planned experiments and measure the characteristics of functioning heterogeneous communication networks and their subscribers, simulate the topology and structure of heterogeneous communication networks, simulate the functioning and interaction of the modeled heterogeneous communication networks with each other, and perform physical modeling of the functioning process and movement of subscribers on heterogeneous communication networks and changes in connection with this intensity or probability of occurrence in different elementary search areas, imitate the transmission by the elements of communication networks of warning signals about a subscriber changing their topology on the ground, imitate a subscriber changing a network, operator, communication service, check the need for a subscriber search on heterogeneous networks, simulate a subscriber search on heterogeneous communication networks, while generate a variant of the distribution of the total amount of information exchange of the subscriber over heterogeneous communication networks, a generation of a variant of the distribution of information exchanging a subscriber in a particular network for its nodes and lines, generating time and directions for a subscriber to change his location, linking to nodes or a telecom operator, generating time and directions for exchanging between network elements about a subscriber’s status on communication networks, verify that the subscriber is changing his condition, if not, then the simulation continues of the functioning of the modeled heterogeneous communication networks and the measurement of the timeliness of customer service on functioning communication networks and the calculation of connectivity, and if the subscriber changes his condition, it imitates temporary shutdown of the subscriber’s equipment when moving on the ground, imitates the transfer of information between the communication network elements about the subscriber’s change in their state, imitates the subscriber’s change of the operator or communication network and the redistribution of information exchange across heterogeneous communication networks, imitation of a change by a subscriber of a binding site and redistribution of information exchange among nodes and communication lines of a network, collection, accumulation e and refinement of statistical data by subscriber’s attributes, it is checked whether a subscriber search is required, if not, then the simulation continues to simulate the functioning of simulated heterogeneous communication networks and the measurement of the timeliness of customer service on functioning communication networks and the calculation of the likelihood of connectivity, and if the subscriber is searched required, then generate a list of elementary areas for the search, the generation time of viewing the elementary search area to detect the subscriber’s signals or service information of network elements about the subscriber’s status, the simulation of viewing the next elementary search area, it is checked whether additional viewing of the elementary search area is required, if so, the simulation of its viewing is repeated, and if additional viewing of the elementary area is not required, then the scan results are generated, it is checked whether the signal of the subscriber’s equipment and / or information about the status of the subscriber is detected, if so, then the list of elementary items is updated accordingly areas to continue the search, taking into account the information of the network element about the status of the subscriber, and evaluate the reliability and / or completeness of detection, if the reliability and / or completeness of detection are not sufficient or neither the signal of the subscriber nor the information of the network element on the status of the subscriber is found, then the search subscriber is imitated on heterogeneous communication networks continues, and if the reliability and / or completeness of subscriber detection is sufficient, then the simulation continues of the functioning of the simulated heterogeneous communication networks and the measurement of her timely service to subscribers on functioning communication networks and the calculation of the likelihood of connectivity.