ANALYSIS OF DELAY BOUNDS OF A TREE PROTOCOL WITH COLLISION DETECTION

A collision resolution problem in a discrete time multiaccess channel is considered, where the stations are independent and the channel feed back is ternary (i.e. idle, success or collision). The tree protocol w ith collision detection (Tree/CD) is a collision resolution protocol t hat performs better than Ethernet. In this paper, we evaluate precisel y the upper and lower bounds of the Tree/CD delay using a recursive me thod, consider the limited sensing algorithm, and examine the throughp ut performance. Compared with the results of Huang and Wu1, the analys is is exact over a wide range of a slot lengths and traffic intensitie s.