Joint Random Pilot and Multi-Slot Access in Massive MIMO for Space Information Networks

Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang
{"title":"Joint Random Pilot and Multi-Slot Access in Massive MIMO for Space Information Networks","authors":"Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641231","DOIUrl":null,"url":null,"abstract":"Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.
空间信息网络大规模MIMO中的联合随机导频和多时隙接入
空间信息网被视为一种有效的解决办法,可以以无缝和具有成本效益的方式为未来的机器对机器通信提供宽带接入。此外,卫星上的大规模多输入多输出(MIMO)技术也受到了极大的关注。为解决sino拥挤海量MIMO系统中导频碰撞问题,提出了一种联合随机导频多时隙接入(JRPMSA)协议。我们的JRPMSA协议允许故障用户设备(UE)从多插槽中剩余的导频中重新选择一个导频,即未被任何UE选择或在初始步骤中被多个UE选择的导频。随机接入卫星对多时隙中每个终端的每个导频上的信道响应进行估计和缓冲。利用and-or树理论分析了JRPMSA协议的性能,重点分析了协议的访问失败概率和上行链路吞吐量。仿真结果表明,提出的JRPMSA协议可以明显降低访问失败概率,提高峰值吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信