A random access algorithm for capture environments

Abstract
The authors consider packet radio environments with capture, such that, given simultaneous transmission of k packets, a single packet is captured with probability pq/sup k-1/, where 1/3<p<or=1 and O<or=p<1. They assume ternary feedback broadcast per slot, and in the presence of capture, identification of the captured packet by all the users in the system. They also assume that a successfully received single transmission can not be distinguished from a capture in the presence of multiple transmissions. For the above environment, in conjunction with errorless feedback channel and absence of propagation delays in the feedback, the authors propose and analyze a simple full-feedback-sensing-window random-access algorithm. They compare the performance of their algorithm with an appropriate modification of the Capetanakis dynamic algorithm. The proposed algorithm demonstrates superior delay and throughput performance.

This publication has 9 references indexed in Scilit: