完全节能的随机退避：慢反馈回路实现快速争用解决
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
AI总结：
针对共享信道争用解决中节能与短反馈依赖问题，提出一种抗自适应对手和干扰的随机退避算法，在 N 个数据包、J 个干扰时隙下以高概率实现恒定吞吐量及每包 polylog(N+J) 次信道接入。
摘要：
争用解决处理的是协调共享信道接入的问题。时间按时隙推进，数据包传输可在任一时隙进行。如果在该时隙内没有其他数据包也被传输，则该数据包被成功发送。如果两个或更多数据包在同一时隙发送，则这些传输都不会成功。在一个时隙内监听会得到三值反馈，指示该时隙是 (0) 静默、(1) 成功传输，还是 (2+) 噪声。不存在其他反馈。数据包随时间被（对抗性地）注入系统。数据包一旦成功发送便离开系统。目标是发送所有数据包，同时优化吞吐量，该指标大致为成功时隙所占的比例。\n 以往大多数具有恒定吞吐量的算法都需要短反馈回路，即数据包在时隙 t+1 的发送概率完全由其在时隙 t 的内部状态和时隙 t 的信道反馈决定。一个悬而未决的问题是，这些短反馈回路是否必要；也就是说，为了实现恒定吞吐量，监听和更新必须多久发生一次？这个问题涉及能源效率，因为监听和发送都会消耗大量能量。信道还可能遭受对抗性噪声（“干扰”），这会使任何监听者听到噪声，即使没有数据包被发送。干扰如何影响我们实现长反馈回路/能源效率的目标？\n 将这些问题联系起来，我们追问：争用解决算法要减少信道接入，必须牺牲什么？我们是否必须放弃恒定吞吐量或对噪声的鲁棒性？在此，我们证明无需做出任何让步。假设存在 N 个数据包和 J 个被干扰时隙，其中输入由自适应对手决定。我们给出一种算法，以关于 N+J 的高概率实现恒定吞吐量，并且每个数据包仅有 polylog(N+J) 次信道接入。
英文摘要：
Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is successfully sent if no other packet is also transmitted during that slot. If two or more packets are sent in the same slot, then none of these transmissions succeed. Listening during a slot gives ternary feedback, indicating if that slot had (0) silence, (1) a successful transmission, or (2+) noise. No other feedback is available. Packets are (adversarially) injected into the system over time. A packet departs the system once it is successful. The goal is to send all packets while optimizing throughput, which is roughly the fraction of successful slots. Most prior algorithms with constant throughput require a short feedback loop, in the sense that a packet's sending probability in slot t+1 is fully determined by its internal state at slot t and the channel feedback at slot t. An open question is whether these short feedback loops are necessary; that is, how often must listening and updating occur in order to achieve constant throughput? This question addresses energy efficiency, since both listening and sending consume significant energy. The channel can also suffer adversarial noise ("jamming"), which causes any listener to hear noise, even when no packets are sent. How does jamming affect our goal of long feedback loops/energy efficiency? Connecting these questions, we ask: what does a contention-resolution algorithm have to sacrifice to reduce channel accesses? Must we give up on constant throughput or robustness to noise? Here, we show that we need not concede anything. Suppose there are N packets and J jammed slots, where the input is determined by an adaptive adversary. We give an algorithm that, with high probability in N+J, has constant throughput and polylog(N+J) channel accesses per packet.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
