English
Related papers

Related papers: Joint Estimation and Contention-Resolution Protoco…

200 papers

Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is…

Networking and Internet Architecture · Computer Science 2019-02-22 H. Murat Gürsu , Wolfgang Kellerer , Cedomir Stefanović

We consider the problem of resolving contention in communication networks with selfish users. In a \textit{contention game} each of $n \geq 2$ identical players has a single information packet that she wants to transmit using one of $k \geq…

Computer Science and Game Theory · Computer Science 2020-03-24 George Christodoulou , Themistoklis Melissourgos , Paul G. Spirakis

The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model,…

Networking and Internet Architecture · Computer Science 2017-07-04 Enrico Paolini , Cedomir Stefanovic , Gianluigi Liva , Petar Popovski

This paper studies combined relay selection and opportunistic geographic routing strategies for autonomous wireless sensor networks where transmissions occur over multiple hops. The proposed solution is built upon three constituent parts:…

Information Theory · Computer Science 2015-07-15 Carlos H. M. de Lima , Pedro H. J. Nardelli , Hirley Alves , Matti Latva-aho

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

In the Contention Resolution problem $n$ parties each wish to have exclusive use of a shared resource for one unit of time. The problem has been studied since the early 1970s, under a variety of assumptions on feedback given to the parties,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-13 Zixi Cai , Kuowen Chen , Shengquan Du , Tsvi Kopelowitz , Seth Pettie , Ben Plosk

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

Non-orthogonal multiple access (NOMA) has been considered as a promising solution for improving the spectrum efficiency of next-generation wireless networks. In this paper, the performance of a p-persistent slotted ALOHA system in support…

Networking and Internet Architecture · Computer Science 2020-02-25 Ziru Chen , Yong Liu , Sami Khairy , Lin X. Cai , Yu Cheng , Ran Zhang

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

In this paper we treat the problem of identification of a subset of active users in a set of a large number of potentially active users. The users from the subset are activated randomly, such that the access point (AP) does not know the…

Information Theory · Computer Science 2016-11-18 Cedomir Stefanovic , Dejan Vukobratovic , Jasper Goseling , Petar Popovski

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic…

Multiagent Systems · Computer Science 2023-01-30 Daniel Pérez Herrera , Zheng Chen , Erik G. Larsson

In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-22 Haimin Chen , Yonggang Jiang , Chaodong Zheng

Contention-based wireless channel access methods like CSMA and ALOHA paved the way for the rise of the Internet of Things in industrial applications (IIoT). However, to cope with increasing demands for reliability and throughput, several…

Networking and Internet Architecture · Computer Science 2021-10-29 Florian Meyer , Volker Turau

We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If in a slot one node sends alone, it succeeds; otherwise, if…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-11-15 Yonggang Jiang , Chaodong Zheng

Residual radio resources are abundant in wireless networks due to dynamic traffic load, which can be exploited to support high throughput for serving non-real-time (NRT) traffic. In this paper, we investigate how to achieve this by resource…

Information Theory · Computer Science 2018-03-29 Jia Guo , Chuting Yao , Chenyang Yang , Zixiang Xiong

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

In this work we consider a two-user and a three-user slotted ALOHA network with multi-packet reception (MPR) capabilities. The nodes can adapt their transmission probabilities and their transmission parameters based on the status of the…

Information Theory · Computer Science 2017-04-11 Ioannis Dimitriou , Nikolaos Pappas