用户优先级的最大距离可分离码度分布设计

Solichah Larasati, Khoirun Ni’amah, Reni Dyah Wahyuningrum, A. Hikmaturokhman
{"title":"用户优先级的最大距离可分离码度分布设计","authors":"Solichah Larasati, Khoirun Ni’amah, Reni Dyah Wahyuningrum, A. Hikmaturokhman","doi":"10.12720/jcm.18.8.481-488","DOIUrl":null,"url":null,"abstract":"—In the super-dense future network communication, human and machine communications are mixed in a single network. They will trespass each other and could lead to an intersection. This paper develops Coded Random Access (CRA) using Maximum Distance Sparable (MDS) codes as a multiple access scheme to serve millions of users, covering human and machines. This research aims to maximum number of user human and machines, where the priority access is given to the human. Two keywords of CRA, i.e., coding (solved by optimal degree distributions) and random. To analyze design degree distribution using Extrinsic Information Transfer (EXIT) Chart projection under binary erasure channels (BEC). The priority scheme for human communications is determined based on utility functions. The parameters used to see the performance of the EXIT chart are packet-loss-rate (PLR) and throughput. Based on the results, the degree design has succeeded in prioritizing humans, which is indicated by the small PLR value but large throughput, as well as the EXIT curve with its very small gap.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"41 1","pages":"481-488"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of Degree Distribution with Maximum Distance Separable Codes for User Priority\",\"authors\":\"Solichah Larasati, Khoirun Ni’amah, Reni Dyah Wahyuningrum, A. Hikmaturokhman\",\"doi\":\"10.12720/jcm.18.8.481-488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"—In the super-dense future network communication, human and machine communications are mixed in a single network. They will trespass each other and could lead to an intersection. This paper develops Coded Random Access (CRA) using Maximum Distance Sparable (MDS) codes as a multiple access scheme to serve millions of users, covering human and machines. This research aims to maximum number of user human and machines, where the priority access is given to the human. Two keywords of CRA, i.e., coding (solved by optimal degree distributions) and random. To analyze design degree distribution using Extrinsic Information Transfer (EXIT) Chart projection under binary erasure channels (BEC). The priority scheme for human communications is determined based on utility functions. The parameters used to see the performance of the EXIT chart are packet-loss-rate (PLR) and throughput. Based on the results, the degree design has succeeded in prioritizing humans, which is indicated by the small PLR value but large throughput, as well as the EXIT curve with its very small gap.\",\"PeriodicalId\":14832,\"journal\":{\"name\":\"J. Comput. Mediat. Commun.\",\"volume\":\"41 1\",\"pages\":\"481-488\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Comput. Mediat. Commun.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12720/jcm.18.8.481-488\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Comput. Mediat. Commun.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12720/jcm.18.8.481-488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在超密集的未来网络通信中,人和机器通信混合在一个单一的网络中。他们会互相侵犯,并可能导致一个十字路口。本文提出了采用最大距离可分割码(MDS)作为多址接入方案的编码随机接入(CRA),以服务数百万用户,包括人和机器。本研究的目的是最大数量的用户人和机器,其中优先访问是给人。CRA的两个关键词,即编码(通过最优度分布求解)和随机。利用二进制擦除通道(BEC)下的外在信息传递(EXIT)图投影分析设计度分布。人类通信的优先级方案是基于效用函数确定的。用于查看EXIT图性能的参数是丢包率(PLR)和吞吐量。结果表明,该度设计成功地实现了人的优先级,其PLR值小但吞吐量大,EXIT曲线间隙很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of Degree Distribution with Maximum Distance Separable Codes for User Priority
—In the super-dense future network communication, human and machine communications are mixed in a single network. They will trespass each other and could lead to an intersection. This paper develops Coded Random Access (CRA) using Maximum Distance Sparable (MDS) codes as a multiple access scheme to serve millions of users, covering human and machines. This research aims to maximum number of user human and machines, where the priority access is given to the human. Two keywords of CRA, i.e., coding (solved by optimal degree distributions) and random. To analyze design degree distribution using Extrinsic Information Transfer (EXIT) Chart projection under binary erasure channels (BEC). The priority scheme for human communications is determined based on utility functions. The parameters used to see the performance of the EXIT chart are packet-loss-rate (PLR) and throughput. Based on the results, the degree design has succeeded in prioritizing humans, which is indicated by the small PLR value but large throughput, as well as the EXIT curve with its very small gap.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信