Contention resolution in a non-synchronized multiple access channel

Gianluca De Marco, Dariusz R. Kowalski

Research output: Contribution to conferencePaper

Abstract

Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to k stations out of n join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity Θ(k log(n/k)), while the third general algorithm accomplishes the goal in time O(k log n log log n).

Original languageEnglish (US)
Pages525-533
Number of pages9
DOIs
StatePublished - Jul 1 2013
Externally publishedYes
Event27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013 - Boston, MA, United States
Duration: May 20 2013May 24 2013

Conference

Conference27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013
CountryUnited States
CityBoston, MA
Period5/20/135/24/13

Fingerprint

Communication
Satellite communication systems
Ethernet

Keywords

  • Contention resolution
  • Deterministic algorithms
  • Distributed algorithms
  • Multiple access channel

ASJC Scopus subject areas

  • Software

Cite this

De Marco, G., & Kowalski, D. R. (2013). Contention resolution in a non-synchronized multiple access channel. 525-533. Paper presented at 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, Boston, MA, United States. https://doi.org/10.1109/IPDPS.2013.68

Contention resolution in a non-synchronized multiple access channel. / De Marco, Gianluca; Kowalski, Dariusz R.

2013. 525-533 Paper presented at 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, Boston, MA, United States.

Research output: Contribution to conferencePaper

De Marco, G & Kowalski, DR 2013, 'Contention resolution in a non-synchronized multiple access channel', Paper presented at 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, Boston, MA, United States, 5/20/13 - 5/24/13 pp. 525-533. https://doi.org/10.1109/IPDPS.2013.68
De Marco, Gianluca ; Kowalski, Dariusz R. / Contention resolution in a non-synchronized multiple access channel. Paper presented at 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, Boston, MA, United States.9 p.
@conference{3476f9c6000b4b41af540008b6d2d140,
title = "Contention resolution in a non-synchronized multiple access channel",
abstract = "Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to k stations out of n join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity Θ(k log(n/k)), while the third general algorithm accomplishes the goal in time O(k log n log log n).",
keywords = "Contention resolution, Deterministic algorithms, Distributed algorithms, Multiple access channel",
author = "{De Marco}, Gianluca and Kowalski, {Dariusz R.}",
year = "2013",
month = "7",
day = "1",
doi = "10.1109/IPDPS.2013.68",
language = "English (US)",
pages = "525--533",
note = "27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013 ; Conference date: 20-05-2013 Through 24-05-2013",

}

TY - CONF

T1 - Contention resolution in a non-synchronized multiple access channel

AU - De Marco, Gianluca

AU - Kowalski, Dariusz R.

PY - 2013/7/1

Y1 - 2013/7/1

N2 - Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to k stations out of n join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity Θ(k log(n/k)), while the third general algorithm accomplishes the goal in time O(k log n log log n).

AB - Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to k stations out of n join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity Θ(k log(n/k)), while the third general algorithm accomplishes the goal in time O(k log n log log n).

KW - Contention resolution

KW - Deterministic algorithms

KW - Distributed algorithms

KW - Multiple access channel

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

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

U2 - 10.1109/IPDPS.2013.68

DO - 10.1109/IPDPS.2013.68

M3 - Paper

AN - SCOPUS:84884831038

SP - 525

EP - 533

ER -