Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Stack algorithms for random multiple access in the presence of asymmetric channel feedback erasures

Paterakis Michalis, Harizakis, C.

Full record


URI: http://purl.tuc.gr/dl/dias/A9CC383B-3CDA-42DC-BC37-0F3935369943
Year 1999
Type of Item Conference Full Paper
License
Details
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 https://doi.org/10.1109/ITNW.1999.814375
Appears in Collections

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

Services

Statistics