q元析取信道中的随机多址访问

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2012-10-25 DOI:10.1109/RED.2012.6338410

E. Pustovalov, A. Turlikov

{"title":"q元析取信道中的随机多址访问","authors":"E. Pustovalov, A. Turlikov","doi":"10.1109/RED.2012.6338410","DOIUrl":null,"url":null,"abstract":"Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Random multiple access in q-ary disjunctive channel\",\"authors\":\"E. Pustovalov, A. Turlikov\",\"doi\":\"10.1109/RED.2012.6338410\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.\",\"PeriodicalId\":403644,\"journal\":{\"name\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2012.6338410\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了q元析取信道中的随机多址(RMA)。提出了一种新的RMA算法。该算法属于分割算法的范畴。它利用了q元析取信道的特性，减少了重传次数。该算法的吞吐量为0.603，比传统的RMA算法的吞吐量大，而传统的RMA算法不利用所考虑的信道的特性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Random multiple access in q-ary disjunctive channel

Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems

自引率

0.00%

发文量