IMDEA Networks Institute Publications Repository

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks

Fernández Anta, Antonio and Mosteiro, Miguel A. (2010) Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. [Journal Articles]

[img]
Preview
PDF (Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks) - Published Version
Download (203Kb) | Preview

Abstract

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.

Item Type: Journal Articles
Subjects: 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
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Acosta Angel
Date Deposited: 14 Feb 2012 14:03
Last Modified: 31 Dec 2013 11:19
URI: http://eprints.networks.imdea.org/id/eprint/57

Actions (login required)

View Item View Item