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 +1 more source
Generalized Encoding CRDSA: Maximizing Throughput in Enhanced Random Access Schemes for Satellite
EAI Endorsed Transactions on Mobile Communications and Applications, 2014 This work starts from the analysis of the literature about the Random Access protocols with contention resolution, such as Contention Resolution Diversity Slotted Aloha (CRDSA), and introduces a possible enhancement, named Generalized Encoding Contention
Manlio Bacco +2 more
doaj +1 more source
On Adaptive Contention Resolution Schemes for IEEE 802.16 BWA Systems
EURASIP Journal on Wireless Communications and Networking, 2009 According to the latest version of the IEEE 802.16 standard, the mandatory contention resolution method is the truncated binary exponential backoff, with the initial window size and the maximum window size controlled by the base station.
Chih-Heng Ke, Der-Jiunn Deng
doaj +2 more sources
Statistical Analysis of a Distributed Queuing Random Access Protocol in a Massive Communication Environment [PDF]
EAI Endorsed Transactions on Internet of Things, 2020 Most of the networks deployed for massive IoT communications use Aloha-based algorithms for channel access. However, those algorithms are known to be unstable and inefficient when the network size is high. Since recently, a Distributed
Romeo Nibitanga +2 more
doaj +1 more source
Multi-Hop-Enabled Energy-Efficient MAC Protocol for Underwater Acoustic Sensor Networks
Journal of Sensor and Actuator Networks, 2015 In multi-hop underwater acoustic sensor networks (UWASNs), packet collisions due to hidden and local nodes adversely affect throughput, energy efficiency and end-to-end delay.
Khaja Shazzad +2 more
doaj +1 more source
An Efficient Contention Resolution Scheme for Massive IoT Devices in Random Access to LTE-A Networks
IEEE Access, 2018 Long-Term Evolution-Advanced (LTE-A) networks have been regarded as having great potential to support the Internet of Things (IoT). However, the high probability of preamble collisions when massive numbers of IoT devices try to access the network within ...
Kyungjun Lee, Ju Wook Jang
doaj +1 more source
Matroid Secretary Is Equivalent to Contention Resolution
CoRR, 2021 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 resolution scheme which, given an arbitrary (possibly correlated) prior distribution over subsets of ...
openaire +4 more sources
Performance Enhancements for Asynchronous Random Access Protocols over Satellite [PDF]
, 2011 In this paper, a novel enhancement of the well known ALOHA random access mechanism is presented which largely extends the achievable throughput compared to traditional ALOHA and provides significantly lower packet loss rates. The novel mechanism, called
Kissling, Christian, Christian Kissling
core +1 more source
Contention Resolution for Coded Radio Networks
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022 12 ...
Michael A. Bender +4 more
openaire +5 more sources
Self-Organizing TDMA: A Distributed Contention-Resolution MAC Protocol
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 +1 more source