A limited sensing random-access algorithm with binary success-failure feedbackA limited sensing random-access algorithm with binary success-failure feedback Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-11-191989enThe authors consider the problem of random access communication over a time-slotted channel, with binary success/failure feedback. The feedback informs the users only whether or not there was a success (single transmission) in the previous slot. They propose and analyze a limited feedback-sensing algorithm (each user is required to observe the channel feedback, from the time he generates a packet to the time that this packet is successfully transmitted). The algorithm requires central control implemented by a central receiver. The limit Poisson user model is adopted. The algorithm achieves a throughput of 0.322 and induces low delays for relatively low input rateshttp://creativecommons.org/licenses/by/4.0/Communications537526 - 530 Paterakis Michalis Πατερακης Μιχαλης Papantoni-Kazakos, P. Institute of Electrical and Electronics Engineers