论文标题
HASHBEAM:通过未包含的随机访问中的下行链路启用反馈
HashBeam: Enabling Feedback Through Downlink Beamforming in Unsourced Random Access
论文作者
论文摘要
未包含的随机访问(URA)已成为下一代无线网络中大规模机器类型通信(MTC)的候选范式。尽管已为URA开发了许多出色的上行链路方案,但这些方案并未指定提供有关用户信息是否成功解码的反馈的机制。尽管这在某些MTC方案中可能是可以接受的,但缺乏反馈并不足够的应用程序需要高度可靠性。但是,向主动用户提供反馈的问题使基站不知道活跃用户的身份的事实变得复杂。在本文中,提出了一种名为“ Hashbeam”的新型下行链接方案,该方案使基站能够向URA中的活跃用户提供反馈,尽管他们不知道其身份。该方案的关键思想是,用户的渠道和消息的哈希可以用作其真实身份的代理。所提出的方案可以适用于基站的任何数量的天线,并且表明所需的频道使用数是要确认的用户数量的线性。将通道增益与用户哈希一起作为区分活性用户属性的想法是新颖的,并扩展了URA方案的设计空间。
Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not specify a mechanism for providing feedback regarding whether a user's message was successfully decoded. While this may be acceptable in some MTC scenarios, the lack of feedback is inadequate for applications that demand a high level of reliability. However, the problem of providing feedback to active users is complicated by the fact that the base station does not know the identities of the active users. In this paper, a novel downlink beamforming scheme called HashBeam is presented that enables the base station to provide feedback to the active users within URA, despite not knowing their identities. The key idea of this scheme is that the users' channels and hashes of their messages may be used as proxies for their true identities. The proposed scheme may be adapted to any number of antennas at the base station and it is shown that the required number of channel uses is linear in the number of users to acknowledge. The idea of using channel gains in conjunction with user hashes as discriminating attributes of active users is novel and expands the design space of URA schemes.