Results 11 to 20 of about 362,112 (139)
Towards an Optimal Contention Resolution Scheme for Matchings [PDF]
arXiv, 2022 In this paper, we study contention resolution schemes for matchings. Given a fractional matching $x$ and a random set $R(x)$ where each edge $e$ appears independently with probability $x_e$, we want to select a matching $M \subseteq R(x)$ such that $\Pr[e \in M \mid e \in R(x)] \geq c$, for $c$ as large as possible. We call such a selection method a $c$
Nuti, Pranav, Vondrák, Jan
arxiv +2 more sources
Self-Organizing TDMA: A Distributed Contention-Resolution MAC Protocol [PDF]
IEEE Access, 2019 This paper presents a self-organizing time division multiple access (SO-TDMA) protocol for contention resolution aiming to support delay-sensitive applications.
Mahsa Derakhshani +5 more
doaj +3 more sources
Is Our Model for Contention Resolution Wrong? [PDF]
, 2017 Randomized binary exponential backoff (BEB) is a popular algorithm for coordinating access to a shared channel. With an operational history exceeding four decades, BEB is currently an important component of several wireless standards.
William C. Anderton, Maxwell Young
core +5 more sources
Robust and Optimal Contention Resolution without Collision Detection [PDF]
arXiv, 2021 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 multiple nodes send simultaneously, messages collide and none succeeds.
Yonggang Jiang, Chaodong Zheng
arxiv +4 more sources
On the Stability of Contention Resolution Diversity Slotted ALOHA (CRDSA) [PDF]
, 2011 In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of Contention Resolution ...
Christian Kißling
openalex +4 more sources
A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels [PDF]
, 1985 Bibliography: p. [32]"March 1982."Defense Advanced Research Projects Agency Contract No. ARPA ONR/N00014-75-1183 National Science Foundation Grant No.
Jeannine Mosely, P.A. Humblet
openalex +4 more sources
Matroid Secretary Is Equivalent to Contention Resolution [PDF]
, 2022 We show that the matroid secretary problem is equivalent to correlated contention resolution in the online random-order model. Specifically, the matroid secretary conjecture is true if and only if every matroid admits an online random-order contention ...
Dughmi, Shaddin
core +2 more sources
Joint Estimation and Contention-Resolution Protocol for Wireless Random Access [PDF]
arXiv, 2012 We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions.
Čedomir Stefanović +3 more
openalex +3 more sources
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem [PDF]
, 2020 Contention resolution schemes have proven to be a useful and unifying abstraction for a variety of constrained optimization problems, in both offline and online arrival models. Much of prior work restricts attention to product distributions for the input
Dughmi, Shaddin
core +2 more sources
Submodular Optimization with Contention Resolution Extensions [PDF]
, 2019 This paper considers optimizing a submodular function subject to a set of downward closed constraints. Previous literature on this problem has often constructed solutions by (1) discovering a fractional solution to the multi-linear extension and (2 ...
Moseley, Benjamin, Sviridenko, Maxim
core +1 more source