Unbounded Contention Resolution: k-Selection in Radio Networks
Using k-Selection in Radio Networks as an example of unique-resource dispute among k unknown contenders, the conflict-resolution protocol presented in this paper shows that, for any sensible probability of error ", all of them get access to such resource in asymptotically optimal time (e+1+ )k+...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universidad Rey Juan Carlos |
| Repositorio: | BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos |
| OAI Identifier: | oai:burjcdigital.urjc.es:10115/1965 |
| Acceso en línea: | http://hdl.handle.net/10115/1965 |
| Access Level: | acceso abierto |
| Palabra clave: | Informática 3325 Tecnología de las Telecomunicaciones |
| Sumario: | Using k-Selection in Radio Networks as an example of unique-resource dispute among k unknown contenders, the conflict-resolution protocol presented in this paper shows that, for any sensible probability of error ", all of them get access to such resource in asymptotically optimal time (e+1+ )k+O(log2(1=")), where > 0 is any constant arbitrarily close to 0. This protocol works under a model where not even an upper bound on k is known and conflicts can not be detected by all the contenders. |
|---|