A bound and algorithm for four sender contention resolution

M.S Andersland; J.E Jantzen

doi:10.1109/ICC.1992.268122

Back

Conference proceeding

A bound and algorithm for four sender contention resolution

M.S Andersland and J.E Jantzen

SUPERCOMM/ICC '92 Discovering a New World of Communications, Vol.3, pp.1344-1349

1992

DOI: 10.1109/ICC.1992.268122

View Online

Abstract

A number of important contention resolution and distributed ordering problems arising in time-slotted multiuser broadcast communication systems can be viewed as generic search problems in which M independent random variables, uniformly distributed in (0, 1), are to be located by testing a sequence of subsets of (0, 1). The authors discuss a search problem in which M=4 and each test returns a 0, a 1, or an e, depending on whether the tested subset contained 0, 1, or >1 random variables. The average number of tests required to locate the four random variables is shown to be lower bounded by 6.495, and a testing algorithm that requires, on average, 6.782 tests is constructed.< >

Telemetry

Actuators

Bandwidth

Broadcasting

Cities and towns

Feedback

Random variables

Search problems

System testing

Throughput

Details

Title: Subtitle: A bound and algorithm for four sender contention resolution
Creators: M.S Andersland - University of Iowa
J.E Jantzen
Resource Type: Conference proceeding
Publication Details: SUPERCOMM/ICC '92 Discovering a New World of Communications, Vol.3, pp.1344-1349
DOI: 10.1109/ICC.1992.268122
ISSN: 1550-3607
eISSN: 1938-1883
Publisher: IEEE
Language: English
Date published: 1992
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984197277602771

Metrics

31 Record Views