Title
FCFS tree algorithms with interference cancellation and single signal memory requirements
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Publication type
conferenceObject
Publication
[*]
Subject
Computer. Automation
Source (book)
International Workshop on Multiple Access Communications (MACOM), Saint-Petersburg, Russia
ISI
000262437800081
Carrier
E
Target language
English (eng)
Affiliation
University of Antwerp
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.
Full text (open access)
https://repository.uantwerpen.be/docman/irua/e58b4f/4683.pdf
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000262437800081&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000262437800081&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle