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

无线随机接入中的联合估计和竞争解决协议

Joint Estimation and Contention-Resolution Protocol for Wireless Random Access

Čedomir Stefanović, Kasper F. Trilingsgaard, Nuno K. Pratas, Petar Popovski

摘要:

我们提出了一个基于竞争的随机接入协议,设计用于无线网络中的用户数量是不是先验已知的。该协议在轮划分成相等的持续时间的时隙,在同一时间执行的用户数量和分辨率的传输估计。用户以预定义的概率在时隙的基础上独立地接入无线链路,导致用户传输在时隙上的分布,基于该分布执行估计和竞争解决。具体地,使用连续干扰消除来执行争用解决,该连续干扰消除与优化接入概率的使用相结合,使得吞吐量能够显著高于传统的时隙ALOHA类协议。所提出的协议的关键特征是,轮持续时间不是先验设置,当估计/竞争分辨率性能达到令人满意的水平时,它们被终止。

英文摘要:

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.

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

↑