On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

Author(s):  
Reuven Bar-Yehuda ◽  
Oded Goldreich ◽  
Alon Itai
Author(s):  
Ravi Prakash ◽  
Yoav Sasson ◽  
Mansoor Mohsin ◽  
David Cavin ◽  
Andre Schiper

2010 ◽  
Vol 02 (04) ◽  
pp. 445-456 ◽  
Author(s):  
ANTONIO FERNÁNDEZ ANTA ◽  
MIGUEL A. MOSTEIRO

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.


2014 ◽  
Vol 1 ◽  
pp. 652-655
Author(s):  
Takumi.Matsui Takumi.Matsui ◽  
Mikio.Hasegawa Mikio.Hasegawa ◽  
Hiroshi.Hirai Hiroshi.Hirai ◽  
Kiyohito.Nagano Kiyohito.Nagano ◽  
Kazuyuki.Aihara Kazuyuki.Aihara

Sign in / Sign up

Export Citation Format

Share Document