English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In a multiple access channel, autonomous stations are able to transmit andlisten to a shared device. A fundamental problem, called \textit{contentionresolution}, is to allow any station to successfully deliver its message byresolving the conflicts that arise when several stations transmitsimultaneously. Despite a long history on such a problem, most of the resultsdeal with the static setting when all stations start simultaneously, while manyfundamental questions remain open in the realistic scenario when stations canjoin the channel at arbitrary times.  In this paper, we explore the impact that three major channel features(asynchrony among stations, knowledge of the number of contenders andpossibility of switching off stations after a successful transmission) can haveon the time complexity of non-adaptive deterministic algorithms. We establishupper and lower bounds allowing to understand which parameters permittime-efficient contention resolution and which do not.

Deterministic non-adaptive contention resolution on a shared channel