Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/F7B10689-D1DD-4AB9-8BBE-870BBAC1C821 | - |
| Αναγνωριστικό | https://doi.org/10.1109/26.24605 | - |
| Γλώσσα | en | - |
| Τίτλος | A limited sensing random-access algorithm with binary success-failure feedback | en |
| Δημιουργός | Paterakis Michalis | en |
| Δημιουργός | Πατερακης Μιχαλης | el |
| Δημιουργός | Papantoni-Kazakos, P. | en |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | The 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 rates | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-11-19 | - |
| Ημερομηνία Δημοσίευσης | 1989 | - |
| Βιβλιογραφική Αναφορά | M. Paterakis, P. Papantoni-Kazakos,"A limited sensing random-access algorithm with binary success-failure feedback," Communications, IEEE Transactions on, vol.37, no.5, pp. 526 - 530, 1989, doi: 10.1109/26.24605 | en |
Copyright © DIAS 2013
