树分裂随机访问的符号计算解析
Sign-Compute-Resolve for Tree Splitting Random Access
摘要：
我们提出了一个随机接入的框架，是基于三个元素：物理层网络编码（PLNC），签名码和树分裂。在存在冲突的情况下，物理层网络编码使接收器能够解码，即计算由各个用户发送的分组的总和。对于每个用户，数据包包含用户的签名以及用户想要传输的数据。只要不超过K个用户发生冲突，就可以从他们的签名之和中恢复他们的身份。这个框架，用于创建和发送数据包可以被用作一个基本的构建块在随机接入算法，因为它有助于有效地处理的不确定性的竞争终端的集合。在本文中，我们将展示如何应用的框架结合树分裂算法，这是需要处理的情况下，超过K个用户碰撞。我们证明，我们的方法实现的吞吐量，倾向于1迅速K的增加。我们还提出了系统的净数据速率的结果，显示所提出的协议的组成元素的开销的影响。我们比较了我们的计划的性能与上界，得到的假设下，活跃用户是先验已知的。此外，我们认为任何PLNC为基础的战略，其中每个时隙的一个线性方程解码的净数据速率的上限。我们已经在适度的数据包长度，我们的计划的净数据速率变得接近第二个上限，即竞争解决算法和签名代码的开销消失。
英文摘要：
We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e. compute, the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user's signature, as well as the data that the user wants to communicate. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. This framework for creating and transmitting packets can be used as a fundamental building block in random access algorithms, since it helps to deal efficiently with the uncertainty of the set of contending terminals. In this paper we show how to apply the framework in conjunction with a tree-splitting algorithm, which is required to deal with the case that more than K users collide. We demonstrate that our approach achieves throughput that tends to 1 rapidly as K increases. We also present results on net data-rate of the system, showing the impact of the overheads of the constituent elements of the proposed protocol. We compare the performance of our scheme with an upper bound that is obtained under the assumption that the active users are a priori known. Also, we consider an upper bound on the net data-rate for any PLNC based strategy in which one linear equation per slot is decoded. We show that already at modest packet lengths, the net data-rate of our scheme becomes close to the second upper bound, i.e. the overhead of the contention resolution algorithm and the signature codes vanishes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
