DOI: 10.14489/vkit.2018.07.pp.039-043

Бочаров П. М., Филипченко А. Н.
ПРОАКТИВНЫЙ АЛГОРИТМ ЗОНДИРОВАНИЯ СОСТОЯНИЯ КАНАЛА ДЛЯ БЕСПРОВОДНЫХ MESH-СЕТЕЙ С ВРЕМЕННЫ́М МУЛЬТИПЛЕКСИРОВАНИЕМ
(c. 39-43)

Аннотация. Разработан проактивный алгоритм безадресного сбора информации о состоянии канала в Mesh-сетях с временны́м мультиплексированием. Проведена оценка работоспособности алгоритма на примере одноранговой и иерархической радиосетей. Приведены примеры расчета времени обновления информации о состоянии каналов для всех радиоузлов сети. Рассмотренный в статье алгоритм хорошо зарекомендовал себя для иерархических сетей и позволяет получить полные матрицы смежности на каждом узле, а также благодаря массивам адресов сократить время зондирования и объем передаваемой служебной информации. Построенные матрицы смежности и массивы адресов обладают достаточной полнотой для создания адаптивной маршрутизации, их наличие на каждом узле управляющей подсети повышает надежность и живучесть радиосети.

Ключевые слова:  Mesh-сети; беспроводные радиосети; безадресное зондирование; иерархическая сеть.

Bocharov P. M., Filipchenko A. N.
A CHANNEL STATE PROACTIVE ALGORITHM OF SOUNDING FOR WIRELESS NETWORKS WITH TIME-DIVISION MULTIPLEXING
(pp. 39-43)

Abstract. A channel state proactive algorithm for Mesh-networks with the time division multiplexing has been developed. In every reviewed radio networks there is one service slot. This service slot is assigned to one of the radio-nodes service slot for each frame. Frames merge into one superframe. In duration of this superframe each radio node has a guaranteed access to a service slot for the transmission. Each network radio-node makes a probe broadcast transmission in the assigned service slot. A probe is data packet. This data packet is represented as a data array, which contains the information about the radio nodes connectivity and the information about probe sender. All radio nodes are in a receive mode, the exception is a time interval, when the node is scheduled for transmission. A large number of received probes are accumulated on the node by the time of the transmission. Receiving a probe, the radio node makes a selection by comparing a received matrix with its own; the node also sets connectivity flag. The flag means that there is a connection between a sender and a receiver. If the probe does not pass the selection (has no new information), the radio node will stop the probe transmission. Thus after certain time all nodes stop the probe transmission and the sounding is considered to be finished. As the sounding is finished adjacency matrixes are formed on each node. These adjacency matrixes are necessary for a routing table building. For hierarchical network, arrays of addresses of every managed node are formed additionally on each master subnetwork node. The subnetwork sounding is made inparallel. An algorithm efficiency has been assessed using an example of a peer-to-peer network and hierarchical one. The examples calculate of a channel state information update timing have been given for all network radiocenters. The reviewed algorithm has proved itself successfully in hierarchical networks; it allows to form a full adjacency matrix on each radio node. Using arrays of addresses we can reduce time required for network sounding and can reduce an amount of service data we send. The formed adjacency matrixes and address arrays are enough for building an adaptive routing; their availability on each node of the control subnetwork increases reliability and survivability of the radio network.

Keywords: Mesh-networks; Wireless network; Addressless sounding; Hierarchical network.