信息论环境下的不规则重复开槽ALOHA

E. Paolini, Lorenzo Valentini, V. Tralli, M. Chiani
{"title":"信息论环境下的不规则重复开槽ALOHA","authors":"E. Paolini, Lorenzo Valentini, V. Tralli, M. Chiani","doi":"10.48550/arXiv.2207.06495","DOIUrl":null,"url":null,"abstract":"An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the traffic, the new approach also captures more fundamental quantities. Specifically, a suitable codebook construction for the adder channel model is adopted to establish a link with successive interference cancellation over the multi-packet reception channel. This perspective allows proving achievability and converse results for the average sum rate of IRSA multiple access schemes.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting\",\"authors\":\"E. Paolini, Lorenzo Valentini, V. Tralli, M. Chiani\",\"doi\":\"10.48550/arXiv.2207.06495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the traffic, the new approach also captures more fundamental quantities. Specifically, a suitable codebook construction for the adder channel model is adopted to establish a link with successive interference cancellation over the multi-packet reception channel. This perspective allows proving achievability and converse results for the average sum rate of IRSA multiple access schemes.\",\"PeriodicalId\":348168,\"journal\":{\"name\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2207.06495\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2207.06495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种不规则重复开槽ALOHA (IRSA)的信息论方法。与之前的研究相比,IRSA分析仅基于交通等典型碰撞模型的数量进行,新方法还捕获了更基本的数量。具体而言,针对加法器信道模型,采用合适的码本结构,在多包接收信道上建立具有逐次干扰消除的链路。从这个角度可以证明IRSA多址方案的平均和速率的可实现性和相反的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting
An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the traffic, the new approach also captures more fundamental quantities. Specifically, a suitable codebook construction for the adder channel model is adopted to establish a link with successive interference cancellation over the multi-packet reception channel. This perspective allows proving achievability and converse results for the average sum rate of IRSA multiple access schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信