{"title":"基于争用的时分冲突解决协议","authors":"A. Burkov, A. Frolov, A. Turlikov","doi":"10.1109/ICUMT.2018.8631217","DOIUrl":null,"url":null,"abstract":"The article deals with the random multiple access algorithm using orthogonal preambles. This algorithm utilizes mechanism of temporal switching to time division mode in the case when several users transmit in one time-frequency resource. This approach allows to resolve the “conflict” without using the random-access procedure. The simulation results for the proposed algorithm, as well as its numerical analysis, are presented. We show, that this algorithm allows increasing the maximum throughput in the random multiple access mode. We showed the effect of the number of orthogonal preambles and the probability of sending a message to the channel for the efficiency of the algorithm.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"225 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Contention-Based Protocol with Time Division Collision Resolution\",\"authors\":\"A. Burkov, A. Frolov, A. Turlikov\",\"doi\":\"10.1109/ICUMT.2018.8631217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article deals with the random multiple access algorithm using orthogonal preambles. This algorithm utilizes mechanism of temporal switching to time division mode in the case when several users transmit in one time-frequency resource. This approach allows to resolve the “conflict” without using the random-access procedure. The simulation results for the proposed algorithm, as well as its numerical analysis, are presented. We show, that this algorithm allows increasing the maximum throughput in the random multiple access mode. We showed the effect of the number of orthogonal preambles and the probability of sending a message to the channel for the efficiency of the algorithm.\",\"PeriodicalId\":211042,\"journal\":{\"name\":\"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)\",\"volume\":\"225 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUMT.2018.8631217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUMT.2018.8631217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Contention-Based Protocol with Time Division Collision Resolution
The article deals with the random multiple access algorithm using orthogonal preambles. This algorithm utilizes mechanism of temporal switching to time division mode in the case when several users transmit in one time-frequency resource. This approach allows to resolve the “conflict” without using the random-access procedure. The simulation results for the proposed algorithm, as well as its numerical analysis, are presented. We show, that this algorithm allows increasing the maximum throughput in the random multiple access mode. We showed the effect of the number of orthogonal preambles and the probability of sending a message to the channel for the efficiency of the algorithm.