{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:05Z","timestamp":1777965725654,"version":"3.51.4"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> 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\u03b5, all the contenders get access to the channel in time (e+1+\u03be)k + O( log <jats:sup>2<\/jats:sup>(1\/\u03b5)), where \u03b5 \u2264 1\/(n+1), \u03be &gt; 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 \u03b5. The protocol works even if the number of contenders k is unknown and collisions cannot be detected. <\/jats:p>","DOI":"10.1142\/s1793830910000796","type":"journal-article","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T08:21:26Z","timestamp":1295252486000},"page":"445-456","source":"Crossref","is-referenced-by-count":7,"title":["CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS"],"prefix":"10.1142","volume":"02","author":[{"given":"ANTONIO","family":"FERN\u00c1NDEZ ANTA","sequence":"first","affiliation":[{"name":"Institute IMDEA Networks, Madrid, Spain"},{"name":"LADyR, GSyC, Universidad Rey Juan Carlos, M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MIGUEL A.","family":"MOSTEIRO","sequence":"additional","affiliation":[{"name":"Computer Science Department, Rutgers University, Piscataway, NJ, USA"},{"name":"LADyR, GSyC, Universidad Rey Juan Carlos, M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_11"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214125"},{"key":"rf7","first-page":"345","volume":"5","author":"Greenberg R. I.","journal-title":"Adv. Comput. Res."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"rf10","first-page":"303","volume":"31","author":"Koml\u00f2s J.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90133-3"},{"key":"rf14","first-page":"32","volume":"14","author":"Mikhailov V.","journal-title":"Problemy Peredachi Inform"},{"key":"rf15","volume-title":"Elementary Inequalities","author":"Mitrinovi\u0107 D. S.","year":"1964"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:15:41Z","timestamp":1565111741000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S1793830910000796"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000796","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}