|
Title
|
|
|
|
FCFS tree algorithms with interference cancellation and single signal memory requirements
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Tree algorithms are a well studied class of collision resolution algorithms for solving multiple access control problems. Signal interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms, providing substantially higher maximum stable throughputs (MST). We propose two novel First-Come-First-Served tree algorithms, the operation of which is similar to the well-known 0.4871 FCFS tree algorithm, that exploit interference cancellation and derive their MST. Both these algorithms are also designed such that, at all times, at most one signal must be stored. |
| |
|
Language
|
|
|
|
English
| |
|
Source (book)
|
|
|
|
International Workshop on Multiple Access Communications (MACOM), Saint-Petersburg, Russia
| |
|
Publication
|
|
|
|
2008
| |
|
Volume/pages
|
|
|
|
p. 468-473
| |
|
ISI
|
|
|
|
000262437800081
| |
|
Full text (open access)
|
|
|
|
| |
|