New network reliability model for wirelles ad hoc networks
Abstract
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.
About the Author
D. .. Migov
Институт вычислительной математики и математической геофизики СО РАН
Russian Federation
Russian Federation
References
1. Colbourn Ch.J. The combinatorics of network reliability. N.Y.: Oxford Univ. press, 1987. 160 p.
2. Райгородский А.М. Модели случайных графов и их применение // Труды МФТИ. 2010. Т.2, №4. С. 130-140.
3. Мелентьев В.А. Функция структурной отказоустойчивости и d-ограниченная компонента связности графа вычислительной системы // Прикладная дискретная математика. 2008. № 2(2). С. 102-106.
4. Мигов Д.А. Расчёт надёжности двухполюсной сети с ограничением на диаметр с использованием сечений // Проблемы информатики. 2011. № 11. C. 4-9.
5. 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.
6. Родионов А.С., Родионова О.К. Кумулятивные оценки средней вероятности связности пары вершин случайного графа // Проблемы информатики. 2013. № 19. C. 3-12.
7. 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.
8. 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.
9. Цициашвили Г.Ш., Осипова М.А., Лосев А.С. Асимптотические формулы для вероятностей связности случайных графов // Автоматика и вычислительная техника. 2013. № 2. С. 22-28.
10. Shooman A.M. Algorithms for network reliability and connection availability analysis // Electro/95 Int. Professional Program Proc. Boston, USA 1995. P. 309-333.
11. Liu Sh., Cheng K., Liu X. Network reliability with node failures // Networks. 2000. V. 35. P. 109-117.
12. 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.
13. 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.
14. 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.
15. 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.
16. 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.
Review
For citations:
Migov D... New network reliability model for wirelles ad hoc networks. The Herald of the Siberian State University of Telecommunications and Information Science. 2014;(3):3-12. (In Russ.)
Views:
198
Email this article 