Collision resolution in multiaccess-channel using dynamic multiplicities

Access a channel shared by multiple stations is very important for LANs and WLANs. The protocols to be used must support high channel utilization both at low and high loads. The deterministic binary tree splitting is one such approach that may provide the same. But the basic tree splitting technique has a limitation of creating (m-1) collisions out of m contending stations even if the stations could be arranged in the tree optimally. In this paper, a new tree splitting technique using dynamic collision multiplicities is proposed that avoids this limitation and minimizes overall slot wastage. A comparison between the conventional tree splitting and the proposed techniques shows that the latter is more efficient than the former.