<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-449</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Показатель надёжности для беспроводных самоорганизующихся сетей</article-title><trans-title-group xml:lang="en"><trans-title>New network reliability model for wirelles ad hoc networks</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мигов</surname><given-names>Д. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Migov</surname><given-names>D. ..</given-names></name></name-alternatives><email xlink:type="simple">mdinka@rav.sscc.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Институт вычислительной математики и математической геофизики СО РАН</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>26</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>3</issue><fpage>3</fpage><lpage>12</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Мигов Д.А., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Мигов Д.А.</copyright-holder><copyright-holder xml:lang="en">Migov D...</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnik.sibsutis.ru/jour/article/view/449">https://vestnik.sibsutis.ru/jour/article/view/449</self-uri><abstract><p>Предлагается новый подход для описания надёжности беспроводных самоорганизующихся сетей. Предполагается, что узлы сети подвержены отказам и сеть способна оставаться работоспособной при выходе из строя определённого количества узлов. Для подобных сетей предлагается новый показатель надёжности - вероятность того, что стоки сети (узлы, предназначенные для сбора информации с остальных узлов) связаны друг с другом и имеют возможность устанавливать соединение с остальными узлами сети, количество которых должно превышать заданное пороговое значение. На основе известного метода факторизации разработан метод расчета данного показателя. Продемонстрирована его работа на примере задачи оптимального размещения стоков в сети.</p></abstract><trans-abstract xml:lang="en"><p>In this article, the problem of reliability analysis of wireless ad hoc networks is considered. It is assumed that a network contains imperfect nodes and carries on operating even if some nodes fail. We define the reliability of such network as the probability that sink nodes are connected and can collect data from other nodes the amount of which exceeds a specified threshold limit. New calculating method of this index is proposed which is based on a well-known factoring method. Experiments show that this method can be used for optimal sink nodes placement in network in order to obtain the most reliable version of network topology.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>надёжность сети</kwd><kwd>беспроводные самоорганизующихся сети</kwd><kwd>беспроводные сенсорные сети</kwd><kwd>оптимальное размещение стоков</kwd><kwd>случайный граф</kwd><kwd>метод факторизации</kwd></kwd-group><kwd-group xml:lang="en"><kwd>network reliability</kwd><kwd>wireless ad hoc network</kwd><kwd>wireless sensor network</kwd><kwd>optimal sink nodes placement</kwd><kwd>random graph</kwd><kwd>factoring method</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Colbourn Ch.J. The combinatorics of network reliability. N.Y.: Oxford Univ. press, 1987. 160 p.</mixed-citation><mixed-citation xml:lang="en">Colbourn Ch.J. The combinatorics of network reliability. N.Y.: Oxford Univ. press, 1987. 160 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Райгородский А.М. Модели случайных графов и их применение // Труды МФТИ. 2010. Т.2, №4. С. 130-140.</mixed-citation><mixed-citation xml:lang="en">Райгородский А.М. Модели случайных графов и их применение // Труды МФТИ. 2010. Т.2, №4. С. 130-140.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Мелентьев В.А. Функция структурной отказоустойчивости и d-ограниченная компонента связности графа вычислительной системы // Прикладная дискретная математика. 2008. № 2(2). С. 102-106.</mixed-citation><mixed-citation xml:lang="en">Мелентьев В.А. Функция структурной отказоустойчивости и d-ограниченная компонента связности графа вычислительной системы // Прикладная дискретная математика. 2008. № 2(2). С. 102-106.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Мигов Д.А. Расчёт надёжности двухполюсной сети с ограничением на диаметр с использованием сечений // Проблемы информатики. 2011. № 11. C. 4-9.</mixed-citation><mixed-citation xml:lang="en">Мигов Д.А. Расчёт надёжности двухполюсной сети с ограничением на диаметр с использованием сечений // Проблемы информатики. 2011. № 11. C. 4-9.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Petingi L. Combinatorial and computational properties of a diameter constrained network reliability model // Proc. Int. Conf. on Applied Computing (ACC'08). Istanbul, Turkey, 2008. P. 337-345.</mixed-citation><mixed-citation xml:lang="en">Petingi L. Combinatorial and computational properties of a diameter constrained network reliability model // Proc. Int. Conf. on Applied Computing (ACC'08). Istanbul, Turkey, 2008. P. 337-345.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Родионов А.С., Родионова О.К. Кумулятивные оценки средней вероятности связности пары вершин случайного графа // Проблемы информатики. 2013. № 19. C. 3-12.</mixed-citation><mixed-citation xml:lang="en">Родионов А.С., Родионова О.К. Кумулятивные оценки средней вероятности связности пары вершин случайного графа // Проблемы информатики. 2013. № 19. C. 3-12.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Youssef M., Khorramzadeh Y., Eubank S. Network reliability: The effect of local network structure on diffusive processes // Physical Review. 2013. E 88(5). Article 052810.</mixed-citation><mixed-citation xml:lang="en">Youssef M., Khorramzadeh Y., Eubank S. Network reliability: The effect of local network structure on diffusive processes // Physical Review. 2013. E 88(5). Article 052810.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Won J.-M., Karray F. Cumulative update of all-terminal reliability for faster feasibility decision // IEEE transactions on reliability. 2010. V. 59, № 3. P. 551-562.</mixed-citation><mixed-citation xml:lang="en">Won J.-M., Karray F. Cumulative update of all-terminal reliability for faster feasibility decision // IEEE transactions on reliability. 2010. V. 59, № 3. P. 551-562.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Цициашвили Г.Ш., Осипова М.А., Лосев А.С. Асимптотические формулы для вероятностей связности случайных графов // Автоматика и вычислительная техника. 2013. № 2. С. 22-28.</mixed-citation><mixed-citation xml:lang="en">Цициашвили Г.Ш., Осипова М.А., Лосев А.С. Асимптотические формулы для вероятностей связности случайных графов // Автоматика и вычислительная техника. 2013. № 2. С. 22-28.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Shooman A.M. Algorithms for network reliability and connection availability analysis // Electro/95 Int. Professional Program Proc. Boston, USA 1995. P. 309-333.</mixed-citation><mixed-citation xml:lang="en">Shooman A.M. Algorithms for network reliability and connection availability analysis // Electro/95 Int. Professional Program Proc. Boston, USA 1995. P. 309-333.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Liu Sh., Cheng K., Liu X. Network reliability with node failures // Networks. 2000. V. 35. P. 109-117.</mixed-citation><mixed-citation xml:lang="en">Liu Sh., Cheng K., Liu X. Network reliability with node failures // Networks. 2000. V. 35. P. 109-117.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Colbourn Ch.J., Satyanarayana A., Suffel C., Sutner K. Computing residual connectedness reliability for restricted networks // Discrete Applied Mathematics. 1993. V. 44. P. 221-232.</mixed-citation><mixed-citation xml:lang="en">Colbourn Ch.J., Satyanarayana A., Suffel C., Sutner K. Computing residual connectedness reliability for restricted networks // Discrete Applied Mathematics. 1993. V. 44. P. 221-232.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Cai W., Jin X., Zhang Y., Chen K., Tang J. Research on reliability model of large-scale wireless sensor networks // Proc. of IEEE Int. Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM’2006). Wuhan, China, 2006. P. 1-4.</mixed-citation><mixed-citation xml:lang="en">Cai W., Jin X., Zhang Y., Chen K., Tang J. Research on reliability model of large-scale wireless sensor networks // Proc. of IEEE Int. Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM’2006). Wuhan, China, 2006. P. 1-4.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Shazly M.H., Elmallah E.S., Harms J.J., AboElFotoh H.M.F. On area coverage reliability of wireless sensor networks // Proc. of IEEE Conf. on Local Computer Networks (LCN’2011). Bonn, Germany. P. 580-588.</mixed-citation><mixed-citation xml:lang="en">Shazly M.H., Elmallah E.S., Harms J.J., AboElFotoh H.M.F. On area coverage reliability of wireless sensor networks // Proc. of IEEE Conf. on Local Computer Networks (LCN’2011). Bonn, Germany. P. 580-588.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">AboElFotoh H.M.F., Iyengar S.S., Chakrabarty K. Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures // IEEE transactions on reliability. 2005. V. 54, №1. P. 145-155.</mixed-citation><mixed-citation xml:lang="en">AboElFotoh H.M.F., Iyengar S.S., Chakrabarty K. Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures // IEEE transactions on reliability. 2005. V. 54, №1. P. 145-155.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Shazly M.H., Elmallah E.S., AboElFotoh H.M.F. A three-state node reliability model for sensor networks // Proc. of IEEE Global Telecommunications Conf (GLOBECOM’2010). Miami, USA. P. 1-5.</mixed-citation><mixed-citation xml:lang="en">Shazly M.H., Elmallah E.S., AboElFotoh H.M.F. A three-state node reliability model for sensor networks // Proc. of IEEE Global Telecommunications Conf (GLOBECOM’2010). Miami, USA. P. 1-5.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
