English
Related papers

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

200 papers

The key idea of non-orthogonal multiple access (NOMA) is to serve multiple users simultaneously at the same time and frequency, which can result in excessive multiple-access interference. As a crucial component of NOMA systems, successive…

Information Theory · Computer Science 2020-05-21 Z. Ding , R. Schober , H. V. Poor

The massiveness of devices in crowded Machine-to-Machine (M2M) communications brings new challenges to existing random-access (RA) schemes, such as heavy signaling overhead and severe access collisions. In order to reduce the signaling…

Information Theory · Computer Science 2019-10-09 Zhaoji Zhang , Ying Li , Lei Liu , Wei Hou

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an…

Networking and Internet Architecture · Computer Science 2021-07-16 Danzhou Wu , Lei Deng , Zilong Liu , Yijin Zhang , Yunghsiang S. Han

In this paper, we propose a distributed multi-hop interference avoidance algorithm, namely, IAA to avoid co-channel interference inside a wireless body area network (WBAN). Our proposal adopts carrier sense multiple access with collision…

Networking and Internet Architecture · Computer Science 2016-11-03 Mohamad Jaafar Ali , Hassine Moungla , Ahmed Mehaoua

A key feature in the design of any MAC protocol is the throughput it can provide. In wireless networks, the channel of a user is not fixed but varies randomly. Thus, in order to maximize the throughput of the MAC protocol at any given time,…

Information Theory · Computer Science 2009-09-17 Syed T. Qaseem , Tareq Y. Al-Naffouri

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Information Theory · Computer Science 2021-05-06 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

Optical wireless communication (OWC) has the potential to provide high communication speeds that support the massive use of the Internet that is expected in the near future. In OWC, optical access points (APs) are deployed on the celling to…

The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a…

Information Theory · Computer Science 2018-12-19 Mikhail Vilgelm , Sergio Rueda Linares , Wolfgang Kellerer

Asynchronous random access (RA) protocols are particularly attractive for their simplicity and avoidance of tight synchronization requirements. Recent enhancements have shown that the use of successive interference cancellation (SIC) can…

Information Theory · Computer Science 2016-07-22 Federico Clazzer , Francisco Lazaro , Gianluigi Liva , Mario Marchese

LoRaWAN is one of the most promising standards for long-range sensing applications. However, the high number of end devices expected in at-scale deployment, combined with the absence of an effective synchronization scheme, challenge the…

Networking and Internet Architecture · Computer Science 2019-02-26 Tommaso Polonelli , Davide Brunelli , Achille Marzocchi , Luca Benini

We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…

Information Theory · Computer Science 2025-06-04 Xiaoqi Liu , Kuan Hsieh , Ramji Venkataramanan

Reliable communication is a challenge in a very noisy RF channel further corrupted by severe, multiple narrowband interference. Code Division Multiple Access (CDMA) is a widely used method to both mitigate such interference and support…

Information Theory · Computer Science 2014-10-20 Dave Clites , Richard Orr , Jack Rieser , Michael Dellomo

Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are…

Information Theory · Computer Science 2025-09-30 Kirill Andreev , Pavel Rybin , Alexey Frolov

Massive machine-type communications (mMTC) or massive access is a critical scenario in the fifth generation (5G) and the future cellular network. With the surging density of devices from millions to billions, unique pilot allocation becomes…

Information Theory · Computer Science 2025-04-03 Zhentian Zhang , Jian Dang , Zaichen Zhang , Liang Wu , Bingcheng Zhu , Lei Wang

Coded caching is an effective technique to decongest the amount of traffic in the backhaul link. In such a scheme, each file hosted in the server is divided into a number of packets to pursue a low transmission rate based on the delicate…

Information Theory · Computer Science 2022-07-21 Xianzhang Wu , Minquan Cheng , Li Chen , Congduan Li , Zifan Shi

Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can…

Information Theory · Computer Science 2016-11-17 Jingge Zhu , Michael Gastpar

Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requirement severely limits its application to future wireless…

Information Theory · Computer Science 2020-03-13 Zhaoji Zhang , Ying Li , Guanghui Song , Chau Yuen , Yong Liang Guan

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the…

Information Theory · Computer Science 2012-07-03 Nuno K. Pratas , Henning Thomsen , Cedomir Stefanovic , Petar Popovski

Rate Splitting Multiple Access (RSMA) is a code division multi-access technique which can achieve any base in the multi-access capacity polymatroid without high coding complexity or synchronization among the transmitting users. In this…

Information Theory · Computer Science 2016-08-15 Xiaomao Mao , Huifang Chen , Peiliang Qiu