Properties of geometric hypergraphs of wireless computer networks

2020 ◽  
Vol 4 ◽  
pp. 60-66
Author(s):  
Alexander I. Mikov ◽  
◽  
Alexander A. Mikov

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.

Author(s):  
A.I. Mikov ◽  
A.A. Mikov

Random geometric hypergraphs are considered as mathematical models of large wireless computer networks. The dependences of the mathematical expectation of the number of hyper-edges in random geometric hypergraphs on the radii of reliable reception / transmission of radio signals by network nodes, as well as on the number of vertices in the hyper- graph are studied. The concepts of the shortest route in a geometric hypergraph are discussed. Calculations of the probabil- ity of connectivity of large random geometric hypergraphs, the mathematical expectation of the diameter of hypergraphs and its change with a change in the radii of the nodes are carried out. The presentation of the results is accompanied by graphs.


2020 ◽  
Vol 4 ◽  
pp. 50-59
Author(s):  
Alexander Mikov ◽  

New mathematical models of networks are considered — geometrical oriented graphs. Such models adequately reflect the structure of heterogeneous wireless computer, sensor and other networks. The strongly connected components of geometric digraphs, their dependence on the number of network nodes in a given area, on the distributions of the radii of the zones of reception and transmission of signals are investigated. The probabilistic characteristics of random geometric digraphs, the features of the dependences of the probability of strong connectivity on the number of nodes in the digraphs for various combinations of radii are analyzed.


Author(s):  
A.I. Mikov ◽  
◽  
A.A. Mikov

The characteristics of random geometric hypergraphs are studied as mathematical models of scalable wireless computer networks. An efficient algorithm for finding cliques in geometric graphs, constructing hypergraphs from geometric configurations has been developed. The types of hyper-edges in hypergraphs generated by a scalable configuration have been identified. The influence of random failures of nodes of computer networks and their restorations on the dynamics of hypergraphs of networks is considered. The analysis of the dynamics of the number of active nodes depending on the type of probability distributions of uptime and recovery time is carried out. The dependences of the mathematical expectation of the number of hyper-edges of certain types in the geometric hypergraph of a wireless computer network on the network operation time, on the radii of zones of reliable reception / transmission of a signal, on the ratio of the parameters of local recovery processes are obtained. The presentation of the results is accompanied by charts.


Author(s):  
Oleksandr Stasiuk ◽  
Valeriy Kuznetsov ◽  
Vitalii Zubok ◽  
Lidiya Goncharova ◽  
Antonina Muntian

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.


2019 ◽  
Vol 3 (1) ◽  
pp. 18-28
Author(s):  
Ammar Hasan ◽  
Tarik A. Rashid ◽  
Birzo Ismael ◽  
Nawzad K. AL-Salihi

Computer networks need protocols to govern all transmission and presentation processes. The transmission control protocol (TCP) is one of the most important protocols that have the compatibility to work with all types of computer networks, overcoming all architectural and operating system differences. Nowadays, networks depend on the TCP protocol to control data flow between all types of connected computers, whether it is client or server, over any type of media whether it is wired or wireless networks, for all network topologies. A simulation of a university campus network has been conducted to determine TCP protocol features; those features are taken into consideration as one of the most important network parameters. In all digital networks, the data transmission is not a continuous transmission – instead, it is a discreet transmission, presenting itself as packets. These packets transfer and propagate within the network between computers, and network nodes using the TCP protocol depending on the address, which is embedded in its header. TCP has a great influence on the network speed. The network simulator OPNET provides an easy way of campus design, predicting, and estimating the performance of networks in a university campus environment. In this research, wiredconnections reach all computer network users at fixed points to maintain higher Mbps and ensure reliable communications between all the campus network nodes, as well as to increase the overall network performance taking into account the future expansions for the university campus network design.


2018 ◽  
Vol 7 (2) ◽  
pp. 61-67
Author(s):  
Iga Revva Princiss Jeinever

Computer networks are basically not safe to access freely. Security gaps in the network can be seen by irresponsible people with various techniques. Opening a port for access carries a high risk of being attacked by an attacker. In this connection, network administrators are required to work more to be able to secure the computer network they manage. One form of network security that is often used by network administrators in server management is through remote login such as ports on telnet, SSH, etc. A port that is always open is a network security hole that can be used by people who are not responsible for logging into the server. Focusing on these problems, in this study, Random Port Knocking is the right way and can be used to increase network security. With Random Port Knocking, the port will be opened as needed, the port will automatically change when it fails to log in more than three times and IP will automatically be blocked and access will not continue so that attacks on the network can be avoided and network security stability can be further improved. The final result of this research shows that the method applied in this research makes server safe. Because port randomization and IP block make irresponsible parties try harder to penetrate firewall walls.


Author(s):  
А.А. Гончар ◽  
А.П. Овсянников ◽  
А.А. Сорокин ◽  
Б.М. Шабанов ◽  
А.В. Юрченко

Развитие национальной телекоммуникационной сети науки и образования играет ключевую роль в проведении научных исследований в современных условиях. В 2019 г. создана Национальная исследовательская компьютерная сеть (НИКС) телекоммуникационная сеть федерального масштаба, которая должна представлять национальную сеть науки и образования на международной арене. Планы развития НИКС включают организацию магистральной кольцевой инфраструктуры на территории Сибирского и Дальневосточного федеральных округов, расширение взаимодействия с региональными сетями, развитие сетевых сервисов, в том числе передачи данных с заданными требованиями по уровню обслуживания. Реализация планов позволит существенно расширить возможности информационно-телекоммуникационной инфраструктуры сферы науки и образования для проектов мегасайенс, высокопроизводительных и распределенных вычислений, искусственного интеллекта. National research and educational network (NREN) is a key factor for modern research and education. The article considers the prospects and directions of the NREN development in the Russian Federation. In 2019, as a result of the merging of the departmental research and educational networks RUNNet and RASNet, a federal scale telecommunications network called the National research computer network (NRCN) was created. It should play the role of a NREN for the international cooperation projects. The concept of NRCN was approved at the Meeting of the Council of the Ministry of Science and Higher Education of the Russian Federation on information and telecommunication infrastructure, information security and supercomputer technologies. NRCN development plans include setting up the circle backbone infrastructure as well as deploying the federal network nodes in the Siberia and the Far East and providing effective interconnection to the present regional network nodes. The plan is intended to optimize network connectivity and to improve the quality of the data transmission as well as to implement Service Level Agreement (SLA) and variety network services for research and education. The implementation of the considered plans will significantly improve the reliability of the backbone and regional components of the NRCN, expand the potential of the IT infrastructure for research and education, focused on the MegaScience, highperformance and distributed computing, Big Data, Deep Learning and AI.


2021 ◽  
Author(s):  
Celia J. Li

This thesis research has successfully completed two developments: an efficient Power-system Role-based Access Control (PRAC) and a secure Power-system Role-based kEy management (PREM). The PRAC significantly increases the security of computer networks for power systems, and surmounts the challenges caused by typical security and reliability concerns due to current technological and political changes faced in the electricity power industry. The PREM is designed to support the efficient operation of the PRAC using one-way hash functions and utilizing their advantages of computationally efficient and irreversibility security. PRAC and PREM are not only developed for handling single local computer network domain, but also extended for supporting multiple computer network domains. A platform for the comprehensive assessment of PREM is established for the fast and economical assessment of the key management developed in this thesis research.


2021 ◽  
Author(s):  
Celia J. Li

This thesis research has successfully completed two developments: an efficient Power-system Role-based Access Control (PRAC) and a secure Power-system Role-based kEy management (PREM). The PRAC significantly increases the security of computer networks for power systems, and surmounts the challenges caused by typical security and reliability concerns due to current technological and political changes faced in the electricity power industry. The PREM is designed to support the efficient operation of the PRAC using one-way hash functions and utilizing their advantages of computationally efficient and irreversibility security. PRAC and PREM are not only developed for handling single local computer network domain, but also extended for supporting multiple computer network domains. A platform for the comprehensive assessment of PREM is established for the fast and economical assessment of the key management developed in this thesis research.


Sign in / Sign up

Export Citation Format

Share Document