Rateless Multiple Access over Erasure Channel

We present a novel multiple access scheme denominated as Rateless Multiple Access (RMA) scheme. As a kind of decentralized technology, RMA protocol implements a random multiple access scheme as simply as traditional ALOHA protocol does and can achieve nearly optimal performance of throughput. We investigate an ideal scenario where the length of delivered messages of each user is the same and analyze the maximum throughput of the system. Also, we present the scheduling scheme by design the optimal access probability of each user. The design is only according to the maximum number of active users in the system, so that each transmitter does not need to "listen before talk". Simulation results finally demonstrate the efficiency of the proposed scheme.