Random multiple access with successive interference cancellation for centralized networks

Author

Vinel, Alexey V. ; Fedorov, Konstantin A.

Author_Institution

St.-Petersburg Inst. for Inf. & Autom., Russian Acad. of Sci., St. Petersburg, Russia

fYear

2009

fDate

18-23 May 2009

Firstpage

1930

Lastpage

1934

Abstract

The development of random multiple access (RMA) algorithms, which are based on the successive interference cancellation (SIC) has attracted attention of scientists in the last years. In this paper a new RMA algorithm for centralized networks, which we refer to as Multi-FS-TREE/SIC is introduced and analyzed. The algorithm is a combination of Multi-FS-ALOHA and SICTA and provides transmission rate more than 0.6.

Keywords

access protocols; interference suppression; multi-access systems; trees (mathematics); SICTA; centralized networks; multi FS-ALOHA; multi FS-TREE-SIC; random multiple access algorithm; successive interference cancellation; Algorithm design and analysis; Base stations; Computer networks; Delay; Interference cancellation; Media Access Protocol; Physical layer; Signal resolution; Signal restoration; Silicon carbide; FS-ALOHA; Multi-FSALOHA; SICTA; collision resolution; random access; successive interference cancellation; transmission rate; tree-algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

EUROCON 2009, EUROCON '09. IEEE

Conference_Location

St.-Petersburg

Print_ISBN

978-1-4244-3860-0

Electronic_ISBN

978-1-4244-3861-7

Type

conf

DOI

10.1109/EURCON.2009.5167911

Filename

5167911