English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Consider a massive random access scenario in which a small set of $k$ activeusers 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 toensure that scheduling is collision-free? Instead of a naive scheme of listingthe 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$, therate of the minimum fixed-length common feedback code scales only as $k\log(e)$ bits, plus an additive term that scales in $n$ as $\Theta \left(\log\log(n) \right)$ for fixed $k$. If a variable-length code can be used, assuminguniform activity among the users, the minimum average common feedback ratestill 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-freescheduling can be significantly further reduced. Moreover, a similar scaling onthe minimum feedback rate is derived for the case of scheduling $m$ users perslot, when $k \le mb$. The problem of constructing a minimum collision-freefeedback scheduling code is connected to that of constructing a perfect hashingfamily, which allows practical feedback scheduling codes to be constructed fromperfect hashing algorithms.

Minimum Feedback for Collision-Free Scheduling in Massive Random Access