.png){kind=icon}
.png){kind=icon}
Return
Nonadaptive Deterministic Asynchronous Conflict Resolution
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2822737.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we consider the conflict resolution problem in a discrete-time multiple access channel. Our focus is the duration of achieving the first successful transmission, called the conflict resolution time. Assume that each device has a unique ID. Our proposed nonadaptive deterministic algorithms can guarantee deterministic upper bounds on the conflict resolution time even when the clocks of the devices in the channel are not synchronized. Furthermore, on average, our proposed algorithms achieve short conflict resolution time on par with existing randomized algorithms (e.g., independent fair coin flipping) in the literature.
Keywords:
Multiple access
nonadaptive algorithms
worst case analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W