Skip navigation
BelSU DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bsu.edu.ru/handle/123456789/41843
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPolshchykov, K.-
dc.contributor.authorShabeeb, A. N.-
dc.contributor.authorLazarev, S.-
dc.date.accessioned2021-06-14T18:41:36Z-
dc.date.available2021-06-14T18:41:36Z-
dc.date.issued2020-
dc.identifier.citationPolshchykov, K. Algorithm for receiving the recommended bandwidth of a wireless self-organizing network channel / K. Polshchykov, A.N. Shabeeb, S. Lazarev // Periodicals of Engineering and Natural Sciences. - 2020. - Vol.8, №3.-P. 1873-1879. - Refer.: p. 1878-1879.ru
dc.identifier.urihttp://dspace.bsu.edu.ru/handle/123456789/41843-
dc.description.abstractThe article presents the development and research results of a support decision-making algorithm forobtaining the recommended channel bandwidth to achieve the required probability values of satisfactory requests service for audio communication sessions inamobilead - hocnetwork. Therecommended channel bandwidth calculation is based on theservicemodelforrequestingaudio communication sessions in amobileadhoc network.The analytical dependenciesof the satisfactory service are probability values of voice streaming requests on channel characteristics anddynamism of the network topology which have taken into account when executing the algorithmru
dc.language.isoenru
dc.subjecttechniqueru
dc.subjectradio electronicsru
dc.subjectmobile ad hoc networkru
dc.subjectchannel bandwidthru
dc.subjectaudio communication sessionsru
dc.titleAlgorithm for receiving the recommended bandwidth of a wireless self-organizing network channelru
dc.typeArticleru
Appears in Collections:Статьи из периодических изданий и сборников (на иностранных языках) = Articles from periodicals and collections (in foreign languages)

Files in This Item:
File Description SizeFormat 
Polshchykov_Algorithm.pdf549.47 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.