ANALYSIS OF DELAY BOUNDS OF A TREE PROTOCOL WITH COLLISION DETECTION

Abstract

A collision resolution problem in a discrete time multiaccess channel is considered, where the stations are independent and the channel feedback is ternary (i.e. idle, success or collision). The tree protocol with collision detection (Tree/CD) is a collision resolution protocol that performs better than Ethernet. In this paper, we evaluate precisely the upper and lower bounds of the Tree/CD delay using a recursive method, consider the limited sensing algorithm, and examine the throughput performance. Compared with the results of Huang and Wu1, the analysis is exact over a wide range of a slot lengths and traffic intensities.