Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Dynamic hypergraphs of renewal processes in mobile networks.
View through CrossRef
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.
Informatization and Communication Journal Editorial Board
Title: Dynamic hypergraphs of renewal processes in mobile networks.
Description:
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.
Related Results
Complement Reducible Uniform Hypergraphs
Complement Reducible Uniform Hypergraphs
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given ...
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
A Systematic Research on Various Types of Hausdorff Hypergraphs
A Systematic Research on Various Types of Hausdorff Hypergraphs
A hypergraph H = (V, E) is said to be a Hausdorff hypergraph if for any two distinct vertices u, v of V there exist hyperedges e1, e2 ∈ E such that u ∈ e1, v ∈ e2 and e1 ∩ e2 = ∅.
...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Mobile phone usage for m‐learning: comparing heavy and light mobile phone users
Mobile phone usage for m‐learning: comparing heavy and light mobile phone users
PurposeMobile technologies offer the opportunity to embed learning in a natural environment. The objective of the study is to examine how the usage of mobile phones for m‐learning ...
Transportation mobility management
Transportation mobility management
Today, the world has observed a remarkable growth in the use of transportation mobile communications for road safety. While a user in a vehicle moves to a new communication cell, a...
Mobile Communication Studies
Mobile Communication Studies
Mobile media are recognized as the fastest-growing media category. Although mobile media users were already enjoying mobile devices in their everyday lives, prior to the millennium...
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturingsuper-dyadicinteractions among entities. In t...