一种确定在无线自组织网络的信道上传输数据的请求队列的最佳长度的算法

{"title":"一种确定在无线自组织网络的信道上传输数据的请求队列的最佳长度的算法","authors":"Polshchykov K. A., Lazarev S. A., K. O. R., V. G. S.","doi":"10.37622/adsa/16.1.2021.201-215","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":36469,"journal":{"name":"Advances in Dynamical Systems and Applications","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An algorithm determining the optimal length of the queue of requests for data transmission over the channels of a wireless ad-hoc network\",\"authors\":\"Polshchykov K. A., Lazarev S. A., K. O. R., V. G. S.\",\"doi\":\"10.37622/adsa/16.1.2021.201-215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":36469,\"journal\":{\"name\":\"Advances in Dynamical Systems and Applications\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Dynamical Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37622/adsa/16.1.2021.201-215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Dynamical Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37622/adsa/16.1.2021.201-215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}