English
Related papers

Related papers: On Throughput Maximization of Grant-Free Access wi…

200 papers

We consider ALOHA and slotted ALOHA protocols as medium access rules for a multi-channel message delivery system. Users decide randomly and independently with a minimal amount of knowledge about the system at random times to make a message…

Probability · Mathematics 2023-01-20 Wolfgang König , Charles Kwofie

Grant-Free (GF) access has been recognized as a promising candidate for Ultra-Reliable and Low-Latency Communications (URLLC). However, even with GF access, URLLC still may not effectively gain high reliability and millimeter-level latency,…

Information Theory · Computer Science 2022-08-30 Zixiao Zhao , Qinghe Du , George K. Karagiannidis

Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless…

Information Theory · Computer Science 2018-06-06 Derya Malak , Howard Huang , Jeffrey G. Andrews

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

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by…

Information Theory · Computer Science 2013-07-02 Cedomir Stefanovic , Petar Popovski

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and…

Information Theory · Computer Science 2015-09-15 Mustafa Ozmen , M. Cenk Gursoy

Enabling closed control loops via wireless communication has attracted a lot of interest recently and is investigated under the name cyber-physical systems. Under cyber-physical systems one challenging scenario is multiple loops sharing a…

Information Theory · Computer Science 2019-02-22 H. Murat Gürsu , Fuqi Guan , Wolfgang Kellerer

In this paper, we study the throughput and delay performances of the slotted Aloha with batch service, which has wide applications in random access networks. Different from the classical slotted Aloha, each node in the slotted Aloha with…

Performance · Computer Science 2019-10-17 Huanhuan Huang , Tong Ye , Tony T. Lee

With the ever-growing demand for low-latency services in machine-to-machine (M2M) communications, the delay performance of random access networks has become a primary concern, which critically depends on the sensing capability of nodes. To…

Networking and Internet Architecture · Computer Science 2024-06-06 Xinran Zhao , Lin Dai

Since the advent of ultra-reliable and low-latency communications (URLLC), the requirements of low-latency applications tend to be completely characterized by a single pre-defined latency-reliability target. That is, operation is optimal…

Information Theory · Computer Science 2023-12-07 Israel Leyva-Mayorga , Jose Manuel Gimenez-Guzman , Lorenzo Valentini , Petar Popovski

Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned…

Information Theory · Computer Science 2018-08-21 Shun Ogata , Koji Ishibashi , Giuseppe Abreu

A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important…

Networking and Internet Architecture · Computer Science 2015-05-14 Xin Liu , John Kountouriotis , Athina P. Petropulu , Kapil R. Dandekar

To support machine-type communication (MTC), massive multiple-input multiple-output (MIMO) has been considered for grant-free random access. In general, the performance of grant-free random access with massive MIMO is limited by the number…

Information Theory · Computer Science 2020-09-03 Jinho Choi

Modern applications are highly sensitive to communication delays and throughput. This paper surveys major attempts on reducing latency and increasing the throughput. These methods are surveyed on different networks and surroundings such as…

Networking and Internet Architecture · Computer Science 2020-09-09 Amir Mirzaeinnia , Mehdi Mirzaeinia , Abdelmounaam Rezgui

In this paper, we study the coexistence of critical and non-critical Internet of Things (IoT) services on a grant-free channel consisting of radio access and backhaul segments. On the radio access segment, IoT devices send packets to access…

Networking and Internet Architecture · Computer Science 2019-09-25 Rahif Kassab , Osvaldo Simeone , Andrea Munari , Federico Clazzer

The capacity of wireless networks is fundamentally limited by interference. However, little research has focused on the interference correlation, which may greatly increase the local delay (namely the number of time slots required for a…

Networking and Internet Architecture · Computer Science 2016-11-15 Yi Zhong , Wenyi Zhang , Martin Haenggi

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski

In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in…

Information Theory · Computer Science 2017-09-04 Nikolaos Pappas , Zheng Chen , Ioannis Dimitriou