English
Related papers

Related papers: High Throughput Random Access via Codes on Graphs:…

200 papers

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of…

Information Theory · Computer Science 2019-02-28 Jinho Choi

Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear…

Information Theory · Computer Science 2015-02-16 Shenghao Yang , Yi Chen , Soung Chang Liew , Lizhao You

There is a paucity of random access protocols designed for alleviating collisions in visible light communication (VLC) systems, where carrier sensing is hard to be achieved due to the directionality of light. To resolve the problem of…

Information Theory · Computer Science 2017-08-15 Linlin Zhao , Xuefen Chi , Shaoshi Yang

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower…

Information Theory · Computer Science 2018-04-03 Chuan Zhang , Chao Yang , Wei Xu , Shunqing Zhang , Zaichen Zhang , Xiaohu You

Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connection between URA and compressed sensing, the massive multiple…

Information Theory · Computer Science 2022-06-28 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

In this work, we provide a simple yet tight analytical approximation of the packet loss rate in the error floor region for a non-orthogonal multiple access (NOMA)-based irregular repetition slotted ALOHA (IRSA) scheme. Considering an…

Emerging Technologies · Computer Science 2026-01-05 Estefanía Recayte

In this work, we propose a new learning framework for optimising transmission strategies when irregular repetition slotted ALOHA (IRSA) MAC protocol is considered. We cast the online optimisation of the MAC protocol design as a multi-arm…

Information Theory · Computer Science 2018-01-30 Laura Toni , Pascal Frossard

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

Cloud radio access networks (C-RAN) enable a network platform for beyond the fifth generation of communication networks (B5G), which incorporates the advances in cloud computing technologies to modern radio access networks. Recently, rate…

Information Theory · Computer Science 2020-11-03 Alaa Alameer Ahmad , Yijie Mao , Aydin Sezgin , Bruno Clerckx

Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it…

Disordered Systems and Neural Networks · Physics 2015-05-13 Jack Raymond , David Saad

This letter proposes a novel hybrid automatic repeat request with chase combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending on whether the same superimposed packet are retransmitted, synchronous and asynchronous…

Information Theory · Computer Science 2024-04-16 Man Wang , Zheng Shi , Yunfei Li , Xianda Wu , Weiqiang Tan , Xinrong Ye

Being able to accommodate multiple simultaneous transmissions on a single channel, non-orthogonal multiple access (NOMA) appears as an attractive solution to support massive machine type communication (mMTC) that faces a massive number of…

Signal Processing · Electrical Eng. & Systems 2020-02-11 Wenjuan Yu , Chuan Heng Foh , Atta ul Quddus , Yuanwei Liu , Rahim Tafazolli

Rate-splitting multiple access (RSMA) has been recognized as a promising physical layer strategy for 6G. Motivated by ever increasing popularity of cache-enabled content delivery in wireless communications, this paper proposes an innovative…

Information Theory · Computer Science 2022-04-26 Robert-Jeron Reifert , Alaa Alameer Ahmad , Yijie Mao , Aydin Sezgin , Bruno Clerckx

In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is…

Information Theory · Computer Science 2017-06-28 Jinho Choi

The problem of uplink transmissions in massive connectivity is commonly dealt with using schemes for grant-free random access. When a large number of devices transmit almost synchronously, the receiver may not be able to resolve the…

Signal Processing · Electrical Eng. & Systems 2024-12-09 Ao Chen , Wei Chen , Bo Ai , Petar Popovski

In this paper, we propose a Slotted ALOHA (SA)-inspired solution for an indoor optical wireless communication (OWC)-based Internet of Things (IoT) system. Assuming that the OWC receiver exploits the capture effect, we are interested in the…

Networking and Internet Architecture · Computer Science 2022-11-17 Tijana Devaja , Milica Petkovic , Francisco J. Escribano , Cedomir Stefanovic , Dejan Vukobratovic

Machine-to-Machine (M2M) communication is now playing a market-changing role in a wide range of business world. However, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn…

Information Theory · Computer Science 2016-11-18 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

Identification and authentication are two basic functionalities of traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is…

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot,…

Information Theory · Computer Science 2020-01-13 Sang-Woon Jeon , Hu Jin
‹ Prev 1 3 4 5 6 7 10 Next ›