Abstract
Communication over a random multiple-access, time-slotted, packet-switched, collision-type, broadcast channel with feedback is considered under a Poisson infinite-user model. The feedback generated by the channel provides some information about the intensity of conflicts. Two conflict-resolution algorithms are discussed for the above channel; they achieve throughputs of 0.334 and 0.369, respectively. The modification technique used to arrive at the second algorithm is emphasized. It is pointed out that the modification technique could be helpful in improving the performance of the conflict-resolution algorithms operating under other types of feedback.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
