Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/A9CC383B-3CDA-42DC-BC37-0F3935369943 | - |
| Identifier | https://doi.org/10.1109/ITNW.1999.814375 | - |
| Language | en | - |
| Title | Stack algorithms for random multiple access in the presence of asymmetric channel feedback erasures | en |
| Creator | Paterakis Michalis | en |
| Creator | Πατερακης Μιχαλης | el |
| Creator | Harizakis, C. | en |
| Publisher | Institute of Electrical and Electronics Engineers | en |
| Content Summary | We propose modifications to the basic free access, limited feedback sensing stack collision resolution algorithm for operation over multiple access networks with ternary empty versus success versus collision (E/S/C) feedback that can improve throughput performance by more than 10%. We also examine via simulation the performance of the proposed stack algorithms in multi-access networks in which each user independently with probability 1-p sees the correct channel feedback, and with probability p can make no decision as to the transmission outcome on the channel (erasure feedback). In the latter case, it is shown that the modified stack algorithms achieve higher throughput than the basic stack algorithm when the erased feedback is treated by the corresponding users as a collision | en |
| Type of Item | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Full Paper | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-11-20 | - |
| Date of Publication | 1999 | - |
| Bibliographic Citation | M. Paterakis, C. Harizakis, "Stack algorithms for random multiple access in the presence of asymmetric channel feedback erasures," in 1999 Information Theory and Networking Workshop, doi: 10.1109/ITNW.1999.814375 | en |
Copyright © DIAS 2013
