TRAFFIC ROUTING IN DISTRIBUTED WIRELESS COMPUTER NETWORKS

Authors

  • V.  Khandetskyi
  • D.  Sivtsov

Keywords:

wireless network, routing, load balancing

Abstract

Using the Lee wave algorithm, the intensity of traffic in the nodes of the central cluster of a distributed wireless network with the "star" topology is calculated. The modification of the algorithm is proposed, taking into account the speed properties of the channels. We determined analytically the average delay in data communication along the route depending on the intensity of traffic. The corresponding modification of the wave algorithm allowed us to obtain a more even distribution of the load across the nodes of the cluster

References

1. Azzedine Boukerche. Algorithms and protocols for wireless, mobile ad hoc networks. – New Jersey : John Wiley & Sons, Inc., 2009. – 495 p.
2. Гайнулин А.Г. Моделирование алгоритма маршрутизации передаваемых данных в беспроводных сетях со смешанными типами коммутации. – Вестник Нижегородского университета им. Н.И. Лобачевского. Мат. моделирование и оптимальное управление, 2008, №1, с.93-99.
3. Khandetskyi V.S., Khandetskyi P.V. Load balancing in autonomous systems of computer networks that use the internal gateway routing protocols. – System technologies, 1(96), 2015. –P.27-34.
4. Хандецький В.С. Оптимізація топології ядра комп’ютерної мережі OSPF на основі неявного балансування навантаження. – Системні технології, 1(108), 2017. – С. 135-141.
5. Tanenbaum A.S., Wetherall D.J. Computer Networks, 5-th ed.- Boston: Prentice Hall, 2011. – 905 P.

Downloads

Published

2020-05-04