The analysis of algorithms of routing in a communication network groups of unmanned aerial vehicles

Systems, networks and telecommunication devices


Аuthors

Borodin V. V.*, Petrakov A. M.**, Shevtsov V. A.***

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

*e-mail: doc_bor1@mail.ru
**e-mail: nio4@mai.ru
***e-mail: vs@mai.ru

Abstract

For increase of efficiency of group of unmanned aerial vehicles (drones) [1, 2, 3] the adaptive radio network with switching of packages which knots are aircraft is used.

For providing requirements to an adaptive network it is necessary to solve a number of complex problems, in particular, to provide effective management of a strip of frequencies, to develop adaptive route protocols and to choose optimum route metrics [4, 5, 6].

Now the protocols of routing focused on search of the shortest route distance with a binding to network topology and location of hubs [5, 7, 8, 9, 10] are used.

Despite a great interest to the considered subject, in our opinion not enough attention is paid to questions of modeling of probabilistic and time characteristics of algorithms of routing. The offered work is devoted to research of efficiency of algorithms of routing in the conditions of not stationarity, in particular, at change of structure of a network.

In this work the adaptive radio network with switching of packages and casual access under the Aloha [11, 12, 13] protocol is investigated.

Influence on characteristics of algorithm of routing of qualitative characteristics and volume of route information which knots on the office channel, and also options of the organization of the office channel exchange is considered. It is shown that the problem of routing can be solved if to be limited to calculation of the metrics containing only data on a condition of knots (nodal metrics). The volume of information distributed by knots in this case is proportional to a square of quantity of knots. However in some cases it is necessary to transfer, along with a state as well data on characteristics of communication channels between knots (channel metrics). The volume of information distributed by knots in this case is proportional to a cube of quantity of knots that significantly exceeds information volume in case of transfer of nodal metrics. It is shown that generally transfer of channel metrics is actual for display of new network structure in local route matrixes of each knot at reorganization of a network.

The option of the organization of the office channel depends on the volume of the transferred route information. At the small volume, in particular, by transfer of nodal metrics, the allocated channel can be used, and mailing of route information is carried out along with an exchange of information packages. If the volume of data is big, in particular, by transfer of channel metrics, interruption of transfer of information packages for a while which is required for mailing of data on new structure of a network is necessary.

For the purpose of increase of efficiency of a network by transfer of channel metrics use of the combined mode at which transfer of metrics is carried out in information package in the mailing mode is offered. Results of imitating modeling have shown high efficiency of the combined method in the certain ranges of change of a traffic and power of the channel.

Keywords:

unmanned aerial vehicles, adaptive networks of data transmission, casual access, routing, network matrixes of contiguity, routing metrics, imitating modeling

References

  1. Swarm — sistema upravleniya «roem» boevykh robotov. Sovremennaya armiya: http://www.modernarmy.ru/article/228

  2. Popov V.A., Fedutinov D.V. Zarubezhnoe voennoe obozrenie, 2006, no.4. pp. 47-52.

  3. Kim N.V., Krylov I.G. Sbornik dokladov IX Vserossiiskoi nauchno-tekhnicheskoi konferentsii «Problemy sovershenstvovaniya robototekhnicheskikh i intellektual’nykh sistem letatel’nykh apparatov», Moscow, 2012, pp. 59-62.

  4. Shel’gov V.I. Seti i sistemy svyazi, 2007, no.3, pp. 3-4.

  5. Razgulyaev L.V. Zarubezhnoe voennoe obozrenie, 2008, no.1, pp. 35-39.

  6. Semenov A. Byte, 2004, no.6 (70): http://www.bytemag.ru/articles/detail.php?ID=8764

  7. Jacquet P., Clausen T. Optimized Link State Routing Protocol (OLSR). IETF, October 2003: http://www.ietf.org/rfc/rfc3626.txt

  8. Ogier R., Templin F., Lewis M. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF).IETF, February 2004: http://tools.ietf.org/html/rfc3684

  9. Perkins C., Belding-Royer E., Das S. Ad hoc On-Demand Distance Vector (AODV) Routing. IETF, July 2003: http://tools.ietf.org/html/rfc3561

  10. Nastasin K.S. Rodionov V.V. Trudy MAI, 2011, no.49: http://www.mai.ru/science/trudy/published.php?ID=28108&PAGEN_2=2

  11. Blek Yu. Seti EVM: protokoly, standarty, interfeisy (Computer Networks: protocols, standards, interfaces) Moscow, Mir, 1990, 506 p.

  12. Pestryakov V.B., Kuzenkov V.D. Radiotekhnicheskie sistemy (Radio engineering systems), Moscow, Radio i svyaz’, 1985, 376 p.

  13. Borodin V.V., Petrakov A.M., Shevtsov V.A. Trudy MAI, 2015, no. 81: http://www.mai.ru/science/trudy/published.php?ID=57894


Download

mai.ru — informational site MAI

Copyright © 2000-2024 by MAI

 Вход