Connectivity of autonomous wireless computer networks in localities of poor infrastructure
UDC
519.173.1, 519.245Abstract
Mathematical model of a wireless computer ad hoc network is discussed. Extremal packing of network nodes on the plane is described. The probability characteristics of random networks such as connectivity, nodes degrees, number of edges, node isolating property are estimated. Also the influence of shape of a region for wireless network properties is studied.
Keywords:
computer network, autonomous computing, geometric graph, connectivity, packing, statistical modelingFunding information
Работа выполнена при поддержке РФФИ (13-07-96506а) и НИР 8.2934.2011 (12/19т).
References
- Миков А.И., Мезенцева А.С. Характеристики геометрических графов, моделирующих ad hoc сети // Информатизация и связь. 2012. №5. С. 85-88.
- Конвей Дж., Слоэн Н. Упаковки шаров, решетки и группы. М.: Мир, 1990. Т. 1. 415 с.
- Харари Ф. Теория графов. М.: Эдиториал УРСС, 2003. 297 с.
- Bollobás B. Random Graphs. Cambridge University Press, 2001. 498 pp.
- Харари Ф., Палмер Э. Перечисление графов. М.: Мир, 1977. 324 с.
Downloads
Downloads
Dates
Submitted
October 2, 2013
Accepted
December 7, 2013
Published
March 24, 2014
How to Cite
[1]
Mikov, A.I., Connectivity of autonomous wireless computer networks in localities of poor infrastructure. Ecological Bulletin of Research Centers of the Black Sea Economic Cooperation, 2014, № 1, pp. 70–75.
License
Copyright (c) 2014 Миков А.И.
This work is licensed under a Creative Commons Attribution 4.0 International License.
