Preview

World of Transport and Transportation

Advanced search

PATH CHOICE IN STEP-BY-STEP ALTERNATIVE ROUTING IN WIRELESS TELECOMMUNICATION NETWORK

Abstract

In order to send the frame to the address the authors suggest selecting an adjacent node, taking into account the preferred predetermined weights of those nodes and their current load rates. The adaptive algorithm of alternate path choice is based on logical neural network. Simulation, made by the authors, has shown better values of mean time to execute applications and higher probability of their execution as compared to algorithm of non-alternative choice of neighboring routers. Thus a mean time of execution of application with alternative path choice algorithm DТalt exceeds minimum possible time for the range of change 12 ≤ s ≤ 16 (applications per step) in a changing range 0,3 ≤ DТальт ≤ 1 (steps). The mean time of execution of application with the method of alternative path choice has been reduced as compared to non-alternative path choice by 8% for s = 12, and by 23% – for s = 16.

About the Authors

A. B. Barsky
Moscow State University of Railway Engineering (MIIT), Moscow
Russian Federation
D.Sc. (Tech), professor of department of computer systems and networks


S. Nadji
Moscow State University of Railway Engineering (MIIT)
Yemen
Ph.D. student


References

1. Барский А.Б. Нейросетевые технологии на транспорте //Мир транспорта, 2011, № 2, с. 4–11, 2011, № 3. с. 14–19. Arkady B. Barsky. A Model of Station Layout in Radial Rail Center. Mir Transporta (World of Transport and Transportation) Journal, 2011, Vol.35, Iss. 2, pp.4–11, Vol.36, Iss.3, pp. 14–19.

2. Саид Мохаммед Мукред Наджи. Технология Wi-Fi и логика нейросети //Мир транспорта, 2011. – № 2. – с. 112–115. Said Mohammed Mukred Nadji. Wi-Fi Technology and Neural Network Logics. Mir Transporta (World of Transport and Transportation) Journal, 2011, Vol.35, Iss. 2, pp.112–115.

3. Соловьёв В.П., Иванов Д. В., Пуцко Н. Н. Защищённые беспроводные и мобильные коммуникации: Учеб. пособие. – М.: МИИТ, 2007. – 121 с. Soloviev V. P., Ivanov D. V., Putsko N. N. Protected Wi-Fi and mobile telecommunications. [Zaschischennye besprovodnye i mobilnye kommunikatsii]. Tutorial. Moscow, MIIT editions, 2007, 121 p.

4. Иванов Д. В. Применение аппарата нечёткой логики для маршрутизации в беспроводных ячеистых сетях //Телекоммуникации, 2009, № 5, с. 13–17. Ivanov D. V. Application of fuzzy logics apparatus for routing in Wi-Fi cluster networks [Primenenie apparata nechetkoy logiki dlia marshrutizatsii v besprovodnyh yacheistyh setiah]. Nauka I tehnologii [Science and technology], 2009, Iss.5. pp.13–17.

5. Барский А. Б. Параллельные информационные технологии: Учеб. пособие. – М.: ИНТУИТ; БИНОМ. Лаборатория знаний. 2009. – 503 с. Barsky A. B. Parallel information technologies [Parallelnye informatsionnye tehnologii]. Tutorial. Moscow, INTUIT, BINOM, Laboratoriya znaniy, 2009, 503 p.

6. Бусленко Н. П. Моделирование сложных систем. – М.: Наука, 1978. – 400 с. Buslenko N. P. Simulation of complex systems [Modelirovanie slozhnyh system]. Moscow, Nauka publ,, 1978, 400 p.

7. Смирнова Е.В., Пролетарский А. В., Баскаков И.В. , Федотов Р.А.. Построение коммутируемых компьютерных сетей: Учеб. пособие. – М.: «ИНТУИТ»: БИНОМ. Лаборатория знаний, 2012. – 367 с. Smirnova E. V., Proletrasky A. V., Baskskov I. V., Fedotov R. A. Engineering of commuted computer networks [Postroenie kommutiruemyh kompiuternyh setey]. Tutorial. Moscow, INTUIT, BINOM, Laboratoriya znaniy, 2012, 367 p.

8. Желенков Б. В., Сан Вин Аунг. Критерии выбора сетевого оборудования // Мир транспорта. – 2012. – № 1. – С. 128–131. Boris V. Zhelenkov, Sann Win Aung. Criteria for Selection of Network Devices. Mir Transporta (World of Transport and Transportation) Journal, 2012, Vol.39, Iss. 1, pp.128–131.


Review

For citations:


Barsky A.B., Nadji S. PATH CHOICE IN STEP-BY-STEP ALTERNATIVE ROUTING IN WIRELESS TELECOMMUNICATION NETWORK. World of Transport and Transportation. 2013;(2):30-37. (In Russ.)

Views: 231


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1992-3252 (Print)