Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound
Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound
复制标题
无反馈的基于图的冲突信道随机接入：容量限制
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Chiani
中科院分区：
文献类型：
--
作者：
E. Paolini;G. Liva;M. Chiani
提出了一种无反馈碰撞信道下的随机接入方案。该方案是基于纠删码的恢复数据包段丢失的冲突，并在连续干扰消除解决冲突。该协议实现了可靠的通信在渐近设置，并达到接近1 [包/时隙]的容量。作为该计划的整体速率的函数的容量界推导出，和代码分布紧密接近的界限开发。
A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 [packets/slot]. A capacity bound as a function of the overall rate of the scheme is derived, and code distributions tightly approaching the bound developed.