Fernández Anta, AntonioMosteiro Rodríguez, Miguel Angel2009-02-182009-02-182008http://hdl.handle.net/10115/1965Using 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.enAtribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/Informáticainfo:eu-repo/semantics/reportinfo:eu-repo/semantics/openAccess3325 Tecnología de las Telecomunicaciones