Show simple item record

Unbounded Contention Resolution: k-Selection in Radio Networks

dc.contributor.authorFernández Anta, Antonio
dc.contributor.authorMosteiro Rodríguez, Miguel Angel
dc.description.abstractUsing 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
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 España
dc.titleUnbounded Contention Resolution: k-Selection in Radio Networkses
dc.subject.unesco3325 Tecnología de las Telecomunicacioneses
dc.description.departamentoIngeniería Telemática

Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 EspañaExcept where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España