A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown but fixed, recent work has yielded fruitful results for local area networks and radio networks, although either the solution is suboptimal or a (possibly loose) upper bound on the number of users must be known. In this work, we present protocols for contention resolution in radio networks that are asymptotically optimal (with high probability), work without collision detection, and do not require information about the number of contenders. In addition to theoretical analysis, the protocols are evaluated and contrasted with previous work by extensive simulations. These show that the complexity bounds obtained by the analysis are rather tight, and that the protocols proposed have small and predictable complexity for a wide range of system sizes (unlike previous proposals).

Who is Miguel A. Mosteiro?

Miguel A. Mosteiro is currently a Research Professor in the Computer Science Department at Rutgers University. He is also affiliated with the Department of Telematic Systems and Computer Science at Universidad Rey Juan Carlos. Before, he was a Post-doctoral Researcher jointly at both institutions. He received his PhD degree in Computer Science from Rutgers University. His current research interests lie in the analysis of algorithmic problems in Radio and Optical Networks, Distributed Computing and Algorithmic Game Theory, Computational Geometry, and Discrete Mathematics.

The conference will be conducted in English