Random access with limited carrier sensing

In this paper, we consider the random-accessing of a single slotted channel by a finite number of independent, data transmitting users. We adopt the realistic assumption that each user monitors the channel or carrier only when he is blocked. We also assume that the channel outcomes visible to each user are trinary. That is, each channel slot is perceived as either empty or successfully busy, or as a collision slot. We disregard propagation delays. For the above model and identical binomial users, we propose and analyze a collision resolution protocol (CRLS) with tree search characteristics. We include some numerical results for different numbers of users.