Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel

Gianluca De Marco, Dariusz R. Kowalski

Research output: Contribution to journalArticle

Abstract

A classical problem in addressing a decentralized multiple-access channel is resolving conflicts when a set of stations attempt to transmit at the same time on a shared communication channel. In a static scenario, i.e., when all stations are activated simultaneously, Komlos and Greenberg [IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306] in their seminal work showed that it is possible to resolve the conflict among k stations from an ensemble of n, with a nonadaptive deterministic algorithm in time O(k +k log(n/k)) in the worst case. In this paper we show that in a dynamic scenario, when the stations can join the channel at arbitrary rounds, there is a nonadaptive deterministic algorithm guaranteeing a successful transmission for each station in only a slightly bigger time: O(k log n log log n) in the worst case. This almost matches the O(k log n/ log k) lower bound by Greenberg and Winograd [J. ACM, 32 (1985), pp. 589-596] that holds even in much stronger settings: for adaptive algorithms, in the static scenario, and with additional channel feedback-collision detection. In terms of channel utilization, our result implies throughput, understood as the average number of successful transmissions per time unit, O(1/(log n log log n)) on the dynamic deterministic channel.

Original languageEnglish (US)
Pages (from-to)868-888
Number of pages21
JournalSIAM Journal on Computing
Volume44
Issue number3
DOIs
StatePublished - Jan 1 2015
Externally publishedYes

Fingerprint

Multiple Access Channel
Conflict Resolution
Deterministic Algorithm
Fast Algorithm
Scenarios
Adaptive algorithms
Collision Detection
Throughput
Communication Channels
Adaptive Algorithm
Feedback
Decentralized
Join
Resolve
Ensemble
Lower bound
Imply
Unit
Arbitrary
Conflict

Keywords

  • Contention resolution
  • Deterministic algorithms
  • Distributed algorithms
  • Latency
  • Multiple-access channel
  • Throughput

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. / De Marco, Gianluca; Kowalski, Dariusz R.

In: SIAM Journal on Computing, Vol. 44, No. 3, 01.01.2015, p. 868-888.

Research output: Contribution to journalArticle

De Marco, Gianluca ; Kowalski, Dariusz R. / Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. In: SIAM Journal on Computing. 2015 ; Vol. 44, No. 3. pp. 868-888.
@article{28c4907e16314b69a68841d8fdbfb000,
title = "Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel",
abstract = "A classical problem in addressing a decentralized multiple-access channel is resolving conflicts when a set of stations attempt to transmit at the same time on a shared communication channel. In a static scenario, i.e., when all stations are activated simultaneously, Komlos and Greenberg [IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306] in their seminal work showed that it is possible to resolve the conflict among k stations from an ensemble of n, with a nonadaptive deterministic algorithm in time O(k +k log(n/k)) in the worst case. In this paper we show that in a dynamic scenario, when the stations can join the channel at arbitrary rounds, there is a nonadaptive deterministic algorithm guaranteeing a successful transmission for each station in only a slightly bigger time: O(k log n log log n) in the worst case. This almost matches the O(k log n/ log k) lower bound by Greenberg and Winograd [J. ACM, 32 (1985), pp. 589-596] that holds even in much stronger settings: for adaptive algorithms, in the static scenario, and with additional channel feedback-collision detection. In terms of channel utilization, our result implies throughput, understood as the average number of successful transmissions per time unit, O(1/(log n log log n)) on the dynamic deterministic channel.",
keywords = "Contention resolution, Deterministic algorithms, Distributed algorithms, Latency, Multiple-access channel, Throughput",
author = "{De Marco}, Gianluca and Kowalski, {Dariusz R.}",
year = "2015",
month = "1",
day = "1",
doi = "10.1137/140982763",
language = "English (US)",
volume = "44",
pages = "868--888",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

TY - JOUR

T1 - Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel

AU - De Marco, Gianluca

AU - Kowalski, Dariusz R.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - A classical problem in addressing a decentralized multiple-access channel is resolving conflicts when a set of stations attempt to transmit at the same time on a shared communication channel. In a static scenario, i.e., when all stations are activated simultaneously, Komlos and Greenberg [IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306] in their seminal work showed that it is possible to resolve the conflict among k stations from an ensemble of n, with a nonadaptive deterministic algorithm in time O(k +k log(n/k)) in the worst case. In this paper we show that in a dynamic scenario, when the stations can join the channel at arbitrary rounds, there is a nonadaptive deterministic algorithm guaranteeing a successful transmission for each station in only a slightly bigger time: O(k log n log log n) in the worst case. This almost matches the O(k log n/ log k) lower bound by Greenberg and Winograd [J. ACM, 32 (1985), pp. 589-596] that holds even in much stronger settings: for adaptive algorithms, in the static scenario, and with additional channel feedback-collision detection. In terms of channel utilization, our result implies throughput, understood as the average number of successful transmissions per time unit, O(1/(log n log log n)) on the dynamic deterministic channel.

AB - A classical problem in addressing a decentralized multiple-access channel is resolving conflicts when a set of stations attempt to transmit at the same time on a shared communication channel. In a static scenario, i.e., when all stations are activated simultaneously, Komlos and Greenberg [IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306] in their seminal work showed that it is possible to resolve the conflict among k stations from an ensemble of n, with a nonadaptive deterministic algorithm in time O(k +k log(n/k)) in the worst case. In this paper we show that in a dynamic scenario, when the stations can join the channel at arbitrary rounds, there is a nonadaptive deterministic algorithm guaranteeing a successful transmission for each station in only a slightly bigger time: O(k log n log log n) in the worst case. This almost matches the O(k log n/ log k) lower bound by Greenberg and Winograd [J. ACM, 32 (1985), pp. 589-596] that holds even in much stronger settings: for adaptive algorithms, in the static scenario, and with additional channel feedback-collision detection. In terms of channel utilization, our result implies throughput, understood as the average number of successful transmissions per time unit, O(1/(log n log log n)) on the dynamic deterministic channel.

KW - Contention resolution

KW - Deterministic algorithms

KW - Distributed algorithms

KW - Latency

KW - Multiple-access channel

KW - Throughput

UR - http://www.scopus.com/inward/record.url?scp=84938067713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938067713&partnerID=8YFLogxK

U2 - 10.1137/140982763

DO - 10.1137/140982763

M3 - Article

AN - SCOPUS:84938067713

VL - 44

SP - 868

EP - 888

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -