Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
