arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.15497cs.ITmath.IT
收藏

大规模随机接入中无冲突调度的最小反馈

Minimum Feedback for Collision-Free Scheduling in Massive Random Access

Justin Singh Kang, Wei Yu

摘要:

考虑大规模随机接入场景,其中需要在$b\ge k$时隙中调度大量$n$潜在用户中的一小组$k$活动用户。为确保调度无冲突,用户需要的最低公共反馈是什么?而不是一个天真的计划,列出的$k$活跃用户的索引的顺序,他们应该发送,在$k\log(n)$位的成本,本文表明,对于$b=k$的情况下,最小的固定长度的共同反馈码的比例仅为$k \log(e)$位,加上一个附加项,在$n$的规模为$Θ\left(\log \log(n) \right)$固定$k$。如果可以使用可变长度码,假设用户之间的活动一致,则最小平均公共反馈速率仍然需要$k \log(e)$比特,但是对$n$的依赖性可以减少到$O(1)$。当$b>k$时,可以显著地进一步减少无冲突调度所需的反馈比特的数量。此外,对于每个时隙调度$m$用户的情况,当$k \le mb$。构造最小无冲突反馈调度码的问题与构造完美散列族的问题相关联,该问题允许从完美散列算法构造实用的反馈调度码。

英文摘要:

Consider a massive random access scenario in which a small set of $k$ active users out of a large number of $n$ potential users need to be scheduled in $b\ge k$ slots. What is the minimum common feedback to the users needed to ensure that scheduling is collision-free? Instead of a naive scheme of listing the indices of the $k$ active users in the order in which they should transmit, at a cost of $k\log(n)$ bits, this paper shows that for the case of $b=k$, the rate of the minimum fixed-length common feedback code scales only as $k \log(e)$ bits, plus an additive term that scales in $n$ as $Θ\left(\log \log(n) \right)$ for fixed $k$. If a variable-length code can be used, assuming uniform activity among the users, the minimum average common feedback rate still requires $k \log(e)$ bits, but the dependence on $n$ can be reduced to $O(1)$. When $b>k$, the number of feedback bits needed for collision-free scheduling can be significantly further reduced. Moreover, a similar scaling on the minimum feedback rate is derived for the case of scheduling $m$ users per slot, when $k \le mb$. The problem of constructing a minimum collision-free feedback scheduling code is connected to that of constructing a perfect hashing family, which allows practical feedback scheduling codes to be constructed from perfect hashing algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑