Tight Trade-off in Contention Resolution without Collision Detection

02/19/2021
by   Haimin Chen, et al.
0

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 message or remain idle. If a single node broadcasts in a slot, the message is received by all nodes; otherwise, if multiple nodes broadcast simultaneously, a collision occurs and none succeeds. If collision detection is available, nodes can differentiate collision and silence (i.e., no nodes broadcast). Performance of contention resolution algorithms is often measured by throughput – the number of successful transmissions within a period of time; whereas robustness is often measured by jamming resistance – a jammed slot always generates a collision. Previous work has shown, with collision detection, optimal constant throughput can be attained, even if a constant fraction of all slots are jammed. The situation when collision detection is not available, however, remains unclear. In a recent breakthrough paper [Bender et al., STOC '20], a crucial case is resolved: constant throughput is possible without collision detection, but only if there is no jamming. Nonetheless, the exact trade-off between the best possible throughput and the severity of jamming remains unknown. In this paper, we address this open question. Specifically, for any level of jamming ranging from none to constant fraction, we prove an upper bound on the best possible throughput, along with an algorithm attaining that bound. An immediate and interesting implication of our result is, when a constant fraction of all slots are jammed, which is the worst-case scenario, there still exists an algorithm achieving a decent throughput: Θ(t/logt) messages could be successfully transmitted within t slots.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2021

Robust and Optimal Contention Resolution without Collision Detection

We consider the classical contention resolution problem where nodes arri...
research
04/17/2020

Contention Resolution Without Collision Detection

This paper focuses on the contention resolution problem on a shared comm...
research
02/15/2023

Robust and Listening-Efficient Contention Resolution

This paper shows how to achieve contention resolution on a shared commun...
research
09/28/2022

Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels

A number of stations, independently activated over time, is able to comm...
research
08/09/2021

A Self-Configurable Grouping Method for Integrated Wi-SUN FAN and TSCH-based Networks

Recent applications in large-scale wireless mesh networks (WSN), e.g., A...
research
09/19/2020

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

We consider a single-hop ad hoc network in which each node aims to broad...
research
10/18/2021

Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access

This paper revisits a classical problem of slotted multiple access with ...

Please sign up or login with your details

Forgot password? Click here to reset