research-article

Rateless multiple access over noisy channel

Authors:

Kedi Wu,

Zhaoyang Zhang,

Shaolei ChenAuthors Info & Claims

IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

Pages 271 - 275

https://doi.org/10.1145/1815396.1815459

Published: 28 June 2010 Publication History

Get Access

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.

References

[1]

N. Abramson. The aloha system-another alternative for computer communications. Proc. Fall Joint Computer Conference, 1970.

Digital Library

Google Scholar

[2]

X.-Y. Hu and E. Eleftheriou. Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), Jan. 2005.

Digital Library

Google Scholar

[3]

P. Li, L. Liu, and W. Leung. A simple approach to near-optimal multiuser detection: interleave-division multiple-access. Wireless Communications and Networking 2003, 1:391--396, Mar. 2003.

Google Scholar

[4]

P. Li, L. Liu, and K. Wu. Interleave division multiple-access. IEEE Transactions on Wireless Communications, 5:938--947, Apr. 2006.

Digital Library

Google Scholar

[5]

H.-A. Loeliger. An introduction to factor graphs. IEEE Signal Processing Mag, Jan. 2004.

Crossref

Google Scholar

[6]

M. Luby. Lt codes. Proceedings of the 43rd Annual IEEE Symposium on the Foundations of Computer Science, pages 271--280, 2002.

Digital Library

Google Scholar

[7]

J. Luo and A. Ephremides. On the throughput, capacity, and stability regions of random multiple access. IEEE Transactions on Information Theory, 52(6), Jun. 2006.

Google Scholar

[8]

D. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press.

Digital Library

Google Scholar

[9]

D. MacKay. Fountain codes. IEE Proc.-Commun., 152(6), Dec. 2005.

Crossref

Google Scholar

[10]

R. Palanki and J. S. Yedidia. Rateless codes on noisy channels. ISIT 2004, page 37, Jun. 27-Jul. 2, 2004.

Crossref

Google Scholar

[11]

A. Shokrollahi. Raptor codes. IEEE Transactions on Information Theory, 52(6), Jun. 2006.

Digital Library

Google Scholar

[12]

K. Wu, Z. Zhang, and S. Chen. Rateless multiple access over erasure channel. accepted by IEEE VTC2010-Spring.

Google Scholar

Cited By

View all

Wang PLi YLin ZShirvanimoghaddam MPark OPark GVucetic B(2023)Analysis of Rateless Multiple Access Scheme With Maximum Likelihood Decoding in an AWGN ChannelIEEE Transactions on Wireless Communications10.1109/TWC.2022.323278122:8(5240-5252)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TWC.2022.3232781
Lim WAbbas RLi YVucetic BShirvanimoghaddam M(2022)Analysis and Design of Short Analog Fountain Codes for the Multiple Access ChannelIEEE Communications Letters10.1109/LCOMM.2022.317285526:7(1454-1458)Online publication date: Jul-2022
https://doi.org/10.1109/LCOMM.2022.3172855
Zhang ZWang XZhang YChen Y(2018)Rateless Multiple Access: Asymptotic Throughput Analysis and Improvement With Spatial CouplingIEEE Access10.1109/ACCESS.2018.28754986(63200-63213)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2875498
Show More Cited By

Index Terms

Rateless multiple access over noisy channel
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Distributed SR-LDPC codes over multiple-access relay channel and its applications in cloud storage

Digital fountain techniques have received significant academics and industry attention in the past years because of their rateless, robust, and real-time characteristics used in networks and storage systems such as cloud data storage. Semi-Random low-...
Trapping sets of fountain codes

The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical implementation over noisy channels. Trapping sets are a phenomenon of great practical importance for certain graph codes on noisy ...
Simple capacity-achieving ensembles of rateless erasure-correcting codes

This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of so-called semi-random low-density-parity-check (SR-LDPC) codes. Based on a constrained random-scrambling technique, the proposed coding scheme is ...

Comments

Information & Contributors

Information

Published In

IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

June 2010

1371 pages

ISBN:9781450300629

DOI:10.1145/1815396

General Chairs:
Ahmed Helmy
University of Florida
,
Peter Mueller
IBM, Switzerland
,
Program Chair:
Yan Zhang
Simula Research Laboratory and University of Oslo, Norway

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 June 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Natural Science Foundation of China
Ministry of Science and Technology of the People's Republic of China
National Science and Technology Major Project

Conference

IWCMC '10

Sponsor:

IWCMC '10: 2010 International Wireless Communications and Mobile Computing Conference

June 28 - July 2, 2010

Caen, France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
184
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang PLi YLin ZShirvanimoghaddam MPark OPark GVucetic B(2023)Analysis of Rateless Multiple Access Scheme With Maximum Likelihood Decoding in an AWGN ChannelIEEE Transactions on Wireless Communications10.1109/TWC.2022.323278122:8(5240-5252)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TWC.2022.3232781
Lim WAbbas RLi YVucetic BShirvanimoghaddam M(2022)Analysis and Design of Short Analog Fountain Codes for the Multiple Access ChannelIEEE Communications Letters10.1109/LCOMM.2022.317285526:7(1454-1458)Online publication date: Jul-2022
https://doi.org/10.1109/LCOMM.2022.3172855
Zhang ZWang XZhang YChen Y(2018)Rateless Multiple Access: Asymptotic Throughput Analysis and Improvement With Spatial CouplingIEEE Access10.1109/ACCESS.2018.28754986(63200-63213)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2875498
Deng DXu DXu S(2018)Optimisation design of systematic LT codes over AWGN multiple access channelIET Communications10.1049/iet-com.2017.106312:11(1351-1358)Online publication date: 17-Jul-2018
https://doi.org/10.1049/iet-com.2017.1063
Wang XZhang ZZhang YZhang LChen Y(2015)Multi-Carrier Rateless Multiple Access: A Novel Protocol for Dynamic Massive Access2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2015.7417547(1-6)Online publication date: Dec-2015
https://doi.org/10.1109/GLOCOM.2015.7417547
Shirvanimoghaddam MLi YVucetic B(2014)Multiple access analog fountain codes2014 IEEE International Symposium on Information Theory10.1109/ISIT.2014.6875217(2167-2171)Online publication date: Jun-2014
https://doi.org/10.1109/ISIT.2014.6875217
Wang HGuo YTang ZBai GChen X(2014)Reevaluating Android Permission Gaps with Static and Dynamic Analysis2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2014.7417621(1-6)Online publication date: Dec-2014
https://doi.org/10.1109/GLOCOM.2014.7417621
Wang XZhang ZZhang YZhang LChen Y(2014)Multi-Carrier Rateless Multiple Access: A Novel Protocol for Dynamic Massive Access2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2014.7417547(1-6)Online publication date: Dec-2014
https://doi.org/10.1109/GLOCOM.2014.7417547
Wang THamdi M(2014)JieLin: A Scalable and Fault Tolerant Server-Centric Data Center Network Architecture2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2014.7417179(1-6)Online publication date: Dec-2014
https://doi.org/10.1109/GLOCOM.2014.7417179
Zhang ZChen SWu K(2012)Non-coded rateless multiple access2012 International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2012.6542951(1-6)Online publication date: Oct-2012
https://doi.org/10.1109/WCSP.2012.6542951
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Distributed SR-LDPC codes over multiple-access relay channel and its applications in cloud storage

Trapping sets of fountain codes

Simple capacity-achieving ensembles of rateless erasure-correcting codes