This paper presents a contention resolution scheme for multiple random access based on tree algorithms. The proposed scheme, called Dynamic Collision Resolution (DCR), is a variation of the tree algorithm. Given that plural users are transmitting packets to a shared communication medium, the tree algorithm will divide the transmitting users into n parts upon detecting a collision condition and, in the later retransmission, collisions will only occur in between the users that fall into the same part. It was well known that the optimal value of n is 3 under the condition that n is fixed and the number of users is infinite. The proposed DCR scheme adopts a dynamically change on the value of n for a better contention resolution. The performance is evaluated through the simulation over a finite number of users and the result shows that the DCR scheme gives a non-trivial improvement on the tree algorithms under a moderate number of users.
|頁（從 - 到）
|IEEE Vehicular Technology Conference
|Published - 1 12月 1998
|Proceedings of the 1998 48th IEEE Vehicular Technology Conference, VTC'98. Part 2 (of 3) - Ottawa, Can
持續時間: 18 5月 1998 → 21 5月 1998