Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/1271A99D-EF25-4E3D-97A0-3A3CEFB214F2 | - |
| Identifier | https://doi.org/10.1109/26.317403 | - |
| Language | en | - |
| Title | A robust random multiple-access algorithm for packet transmissions over noisy channels with error memory | en |
| Creator | Gong, Y | en |
| Creator | Paterakis Michalis | en |
| Creator | Πατερακης Μιχαλης | el |
| Publisher | Institute of Electrical and Electronics Engineers | en |
| Content Summary | In this paper, a noisy slotted channel is considered. It is assumed that channel feedback might be misinterpreted due to the existence of noise on the channel. Furthermore, this disturbance is dependent on the channel state (either good or bad) which varies from slot to slot according to a Markov chain. Consequently, the occurrence of the a channel feedback error is dependent on previous occurrences of errors (i.e., with error memory). Under this assumption, the throughput performance of a random multiple-access algorithm, called the Two-Cell algorithm, is analyzed and the results are compared with the throughputs of the Capetanakis (1979) tree-splitting algorithm operating over the same channels. It is shown that the Two-Cell algorithm retains positive throughputs for all possible values of channel state parameters, and for all practical purposes, it outperforms the Capetanakis algorithm in terms of insensitivity to channel feedback errors | en |
| Type of Item | Peer-Reviewed Journal Publication | en |
| Type of Item | Δημοσίευση σε Περιοδικό με Κριτές | el |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-11-19 | - |
| Date of Publication | 1994 | - |
| Bibliographic Citation | Y. Gong, M. Paterakis, "A robust random multiple-access algorithm for packet transmissions over noisy channels with error memory," Communications, IEEE Transactions on, vol. 42, no. 9, pp. 2664 - 2669, 1994, doi: 10.1109/26.317403 | en |
Copyright © DIAS 2013
