Rateless multiple access over noisy channel

Authors:
Kedi Wu;Zhaoyang Zhang;Shaolei Chen
Affiliations:
Zhejiang University, Hangzhou, Zhejiang, China;Zhejiang University, Hangzhou, Zhejiang, China;Zhejiang University, Hangzhou, Zhejiang, China
Venue:
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Year:
2010

Citing 7
Cited 0

LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Information Theory, Inference & Learning Algorithms

Information Theory, Inference & Learning Algorithms
THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Interleave division multiple-access

IEEE Transactions on Wireless Communications
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Raptor codes

IEEE Transactions on Information Theory
On the throughput, capacity, and stability regions of random multiple access

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiple access technology is a key issue to efficiently share the available scarce sources among a large number of users. We present a novel multiple access scheme denominated as rateless multiple access (RMA) scheme, in which users do not coordinate their transmissions but implement a random multiple access scheme as simply as time-slotted ALOHA system does. Each user utilizes Rateless codes with its own seed to protect its message, conquer the problem of collisions to packets and distinguish from each other. In this paper, we investigate the scenario where the transmission is over the noisy channel and present the schemes of both the transmitters and the receiver. Simulation results finally demonstrate the efficiency of the proposed RMA scheme.