Fernández Anta, Antonio and Mosteiro, Miguel A. and Ramón Muñoz, Jorge (2011) Brief Announcement: Unbounded Contention Resolution in Multiple-Access Channels. In: The 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (ACM / SIGACT-SIGOPS PODC 2011), 6-8 June, 2011, San Jose, California, USA.
- Published Version
Download (223Kb) | Preview
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 eﬃcient 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, recent work has yielded fruitful results for local area networks and radio networks, although either a (possibly loose) upper bound on the number of users needs to be known , or the solution is suboptimal , or it is only implicit  or embedded  in other problems, with bounds proved only asymptotically. In this paper, under the assumption that collision detection or information on the number of contenders is not available, we present a novel protocol for contention resolution in radio networks, and we recreate a protocol previously used for other problems [11, 6], tailoring the constants for our needs. In contrast with previous work, both protocols are proved to be optimal up to a small constant factor and with high probability for big enough number of contenders. Additionally, the protocols are evaluated and contrasted with the previous work by extensive simulations. The evaluation shows that the complexity bounds obtained by the analysis are rather tight, and that both protocols proposed have small and predictable complexity for many system sizes (unlike previous proposals).
|Item Type:||Conference or Workshop Papers (Paper)|
|Subjects:||Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Divisions:||Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science|
|Depositing User:||Acosta Angel|
|Date Deposited:||08 Mar 2012 10:04|
|Last Modified:||03 Dec 2014 10:34|
Actions (login required)