In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation (IC) can be performed both by the access point (AP), as in SICTA, but also by the users. Specifically, after every collision slot, the AP broadcasts the observed collision as feedback. Users who participated in the collision then attempt to perform IC by subtracting their transmissions from the collision signal. This way, the users can resolve collisions of degree 2 and, using a simple distributed arbitration algorithm based on user IDs, ensure that the next slot will contain just a single transmission. We show that ATIC reaches the asymptotic throughput of 0.924 as the number of initially collided users tends to infinity and reduces the number of collisions and packet delay. We also compare ATIC with other tree algorithms and indicate the extra feedback resources it requires.

翻译：本文提出了一种带有干扰消除的先进树算法（ATIC），它是Yu和Giannakis提出的带有连续干扰消除的二叉树算法（SICTA）的变体。ATIC假设干扰消除（IC）既可以像SICTA中那样由接入点（AP）执行，也可以由用户执行。具体而言，在每个冲突时隙之后，AP将观察到的冲突作为反馈进行广播。参与冲突的用户随后尝试通过从冲突信号中减去自己的传输信号来执行干扰消除。通过这种方式，用户可以解决度为2的冲突，并通过一种基于用户ID的简单分布式仲裁算法确保下一个时隙只包含一次传输。我们证明，当初始冲突用户数趋于无穷大时，ATIC的渐近吞吐量达到0.924，并且减少了冲突次数和数据包延迟。我们还将ATIC与其他树算法进行了比较，并指出了其所需的额外反馈资源。