Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
In this paper, contention resolution among k contenders on a multiple-access channel is explored. The problem studied has been modeled as a k-Selection in Radio Networks, in which every contender has to have exclusive access at least once to a shared communication channel. The randomized adaptive pr...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | IMDEA Networks Institute |
| Repositorio: | IMDEA Networks Institute Digital Repository |
| Idioma: | inglés |
| OAI Identifier: | oai:dspace.networks.imdea.org:20.500.12761/1193 |
| Acceso en línea: | http://hdl.handle.net/20.500.12761/1193 https://dx.doi.org/doi:10.1142/S1793830910000796 |
| Access Level: | acceso abierto |
| Palabra clave: | 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 |
| Sumario: | In this paper, contention resolution among k contenders on a multiple-access channel is explored. The problem studied has been modeled as a k-Selection in Radio Networks, in which every contender has to have exclusive access at least once to a shared communication channel. The randomized adaptive protocol presented shows that, for a probability of error 2ε, all the contenders get access to the channel in time (e+ 1 +ξ)k+O(log 2(1/ε)), where ε ≤ 1/(n+ 1), ξ > 0 is any constant arbitrarily close to 0, and n is the total number of potential contenders. The above time complexity is asymptotically optimal for any significant ε. The protocol works even if the number of contenders k is unknown and collisions cannot be detected. |
|---|