Mathematical Models of Effective Topology of Computer Networks for Electric Power Supply Control on Railway Transport

2022 ◽  
Vol 24 (2) ◽  
pp. C27-C32
Author(s):  
Oleksandr Stasiuk ◽  
Valeriy Kuznetsov ◽  
Vitalii Zubok ◽  
Lidiya Goncharova ◽  
Antonina Muntian
Keyword(s):  
Mathematical Models ◽  
Electric Power ◽  
Computer Networks ◽  
Information Exchange ◽  
Computer Network ◽  
Railway Transport ◽  
Electric Power Supply ◽  
Traction Substations ◽  
Consumption Control ◽  
Intelligent Computer

The paper is devoted to analysis of modern directions of innovation-investment formation of intelligent computer networks that control the fast-moving technological processes of electricity supply. It is based on the conclusion that the problem of increasing the productivity of information exchange between information resources and consumers is dominant. A method for increasing the efficiency of information exchange is proposed as a search for the rational location of a new node and the organization of such a set of its connections among the whole set of nodes of the computer network, which provides a minimum average topological distance. Mathematical models of effective topological organization of connections in computer network of power consumption control at the level of traction substations, electric power distances and the railway in general are proposed.

scholarly journals Software Model for Determining the Optimal Routes in a Computer Network Based on the Two-Colonial Ant Algorithm

2021 ◽  
pp. 38-49
Author(s):  
V. M Pakhomova ◽  
A. O Opriatnyi
Keyword(s):  
Computer Networks ◽  
Evaporation Rate ◽  
Computer Network ◽  
Optimal Path ◽  
Ant Algorithm ◽  
Optimal Route ◽  
Railway Transport ◽  
Telecommunication System ◽  
Total Delay ◽  
Software Model

Purpose. At present, the computer networks of the information and telecommunication system (ITS) of railway transport use the OSPF protocol, which does not allow taking into account several metrics when determining the optimal route. Therefore, there is a need to study the possibility of organizing routing in computer networks of rail transport ITS using a two-colonial ant algorithm. Methodology. According to the Two-ACO software model, created in the Python language based on the two-colonial ant algorithm, the optimal route in a computer network was determined. Two-ACO model inputs: computer network parameters (network adjacency matrix, number of routers); parameters of the ant algorithm (number of iterations; number of ants in the colony; number of elite ants; initial pheromone level; evaporation rate; parameter for adjusting the amount of pheromone deposition). Findings. The results of the Two-ACO model are presented in the form of graphs depicting the optimal paths: the criterion of the total delay on the routers (for the first colony of ants) and the number of hops (for the second colony of ants). Originality. According to the created Two-ACO software model for a computer network of 7 routers and 17 channels, a study of the time for determining the optimal path in a computer network by the number of ordinary and elite ants, evaporation rate and deposited pheromone was conducted. It is determined that it is enough to use the number of ants equal to the number of routers and have 2 elite ants in the colony, with 1000 iterations, evaporation rate from 0.2 to 0.7, and pheromone deposition by ants close to one. Practical value. Created Two-ACO software model using two colonies of ants on the following criteria: the total delay on the routers (for the first colony of ants) and the number of hops that make up the route (for the second colony of ants) allows you to parallel determine the optimal routes in a computer network of railway transport. It is estimated that for a computer network of 15 routers and 17 channels, it is sufficient to have 30 agents (two ants on top), the value of the pheromone deposited by the agents is close to one, and the evaporation rate is 0.4.

Innovative principles of electric power supply of non-traction power consumers of railway transport

2020 ◽  
pp. 44-50
Author(s):  
A. V. Bondarenko ◽  
Keyword(s):  
Electric Power ◽  
High Voltage ◽  
Power Supply ◽  
Railway Transport ◽  
Supply Source ◽  
Electric Power Supply ◽  
Block System ◽  
Line Section ◽  
Power Supply Source ◽  
Magnetic Resistance

The issues of fundamental changes of electric power-supply of non-traction devices, such as, line-section devices and systems of railway transport are addressed in the article. It is clearly shown that the possibility of electric power-supply of such consumers without using the common high-voltage line-section power-supply lines of alternative voltage of 6 or 10 kV and respective power-supply substations can be implemented in practice. The essence of the proposed is that the electric power-supply source is not a high-voltage power-supply line, but a device which converts potential mechanical energy of a train, moving along a line section between signal points of railway automatic block system, into electrical one. Putting the described power-supply devices into operation provides technical as well as economic advantages over currently and widely used power-supply systems. The conversion of energy is carried out by changing magnetic resistance of a magnetic circuit, which includes railway car wheel-set in motion and direct neodymium magnet. Change in magnetic resistance due to the law of electromagnetic induction results in alternate voltage in the inductance coil, which is used as the electric power-supply source for non-traction line-section power consumers, including but not limited to, signal point of railway automatic block system. In case there is no wheel-set on the converter, electric power-supply for the power consumer is delivered by the electric energy accumulated in an ionistor (supercapacitor).

Properties of geometric hypergraphs of wireless computer networks

2020 ◽  
Vol 4 ◽  
pp. 60-66
Author(s):  
Alexander I. Mikov ◽  
◽  
Alexander A. Mikov
Keyword(s):  
Standard Deviation ◽  
Mathematical Models ◽  
Computer Networks ◽  
Mathematical Expectation ◽  
Computer Network ◽  
Natural Form ◽  
Network Nodes ◽  
Radio Signals ◽  
Geometric Hypergraphs ◽  
Random Hypergraphs

Mathematical models of wireless computer networks are considered, reflecting two types of interaction between nodes of the same network — broadcast and routing. A natural form of representation of such a network is a hypergraph, in which the direct links between nodes that do not require routing are specified by the hyper-edges. The routes are chains of hyper-edges. The concepts of geometric and random hypergraphs are introduced, the dependences of the probabilistic characteristics of random geometric hypergraphs on the number of vertices and radii of reliable reception / transmission of radio signals by network nodes are studied — the mathematical expectation and standard deviation of the number of hyperedges, degrees of hyperedges. The properties of dynamic geometric hypergraphs are discussed, their influence on the connectivity of a computer network, and the requirements for algorithms for managing connectivity in terms of hypergraphs are formulated.

Sign in / Sign up

Export Citation Format

Share Document