Nonadaptive Deterministic Asynchronous Conflict Resolution

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.