Cart (Loading....) | Create Account
Close category search window

Random multiple access with successive interference cancellation for centralized networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vinel, A.V. ; St.-Petersburg Inst. for Inf. & Autom., Russian Acad. of Sci., St. Petersburg, Russia ; Fedorov, K.A.

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.

Published in:


Date of Conference:

18-23 May 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.