基于争用的时分冲突解决协议

A. Burkov, A. Frolov, A. Turlikov
{"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}
引用次数: 2

摘要

本文研究了基于正交序的随机多址算法。该算法利用多用户在同一时频资源中传输时频切换到时分模式的机制。这种方法允许在不使用随机访问过程的情况下解决“冲突”。最后给出了该算法的仿真结果和数值分析。结果表明,该算法可以提高随机多址模式下的最大吞吐量。我们展示了正交序文的数量和向信道发送消息的概率对算法效率的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信