Parallel and Distributed Processing Symposium, International (2013)
Cambridge, MA, USA USA
May 20, 2013 to May 24, 2013
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2013.68
Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to $k$ stations out of $n$ join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity $\Theta(k\log(n/k))$, while the third general algorithm accomplishes the goal in time $O(k\log n \log\log n)$.
Protocols, Time complexity, Synchronization, Schedules, Algorithm design and analysis, Upper bound, Computational modeling, Distributed algorithms, Multiple access channel, Contention resolution, Deterministic algorithms
G. De Marco and D. R. Kowalski, "Contention Resolution in a Non-synchronized Multiple Access Channel," 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (IPDPS 2013)(IPDPS), Boston, MA, 2013, pp. 525-533.