CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS

2010 ◽  
Vol 02 (04) ◽  
pp. 445-456 ◽  
Author(s):  
ANTONIO FERNÁNDEZ ANTA ◽  
MIGUEL A. MOSTEIRO
Keyword(s):  
Time Complexity ◽  
Multiple Access ◽  
Communication Channel ◽  
Radio Networks ◽  
Multiple Access Channel ◽  
Contention Resolution ◽  
Probability Of Error ◽  
Multiple Access Channels ◽  
Adaptive Protocol ◽  
Access Channel

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.

scholarly journals Gaussian Multiple Access Channels with One-Bit Quantizer at the Receiver

Entropy ◽  
2018 ◽  
Vol 20 (9) ◽  
pp. 686 ◽  
Author(s):  
Borzoo Rassouli ◽  
Morteza Varasteh ◽  
Deniz Gündüz
Keyword(s):  
Lower Bound ◽  
Multiple Access ◽  
Input Power ◽  
Multiple Access Channel ◽  
Capacity Region ◽  
Sum Capacity ◽  
Multiple Access Channels ◽  
Access Channel ◽  
Analogue To Digital ◽  
Time Division

The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analogue-to-digital converter (ADC). It is proven that the input distributions of the two transmitters that achieve the boundary points of the capacity region are discrete. Based on the position of a boundary point, upper bounds on the number of the mass points of the corresponding distributions are derived. Furthermore, a lower bound on the sum capacity is proposed that can be achieved by time division with power control. Finally, inspired by the numerical results, the proposed lower bound is conjectured to be tight.

scholarly journals A Jamming-Resilient and Scalable Broadcasting Algorithm for Multiple Access Channel Networks

2021 ◽  
Vol 11 (3) ◽  
pp. 1156
Author(s):  
Bader A. Aldawsari ◽  
Jafar Haadi Jafarian
Keyword(s):  
Multiple Access ◽  
Communication Channel ◽  
Multiple Access Channel ◽  
Jamming Attacks ◽  
Network Growth ◽  
Channel Networks ◽  
Access Channel ◽  
Packet Latency ◽  
Environment Type ◽  
Broadcasting Algorithm

Multiple access channel (MAC) networks use a broadcasting algorithm called the Binary Exponential Backoff (BEB) to mediate access to the shared communication channel by competing nodes and resolve their collisions. While the BEB achieves fair throughput and average packet latency in jamming-free environments and relatively small networks, its performance noticeably degrades when the network is exposed to jamming or its size increases. This paper presents an alternative broadcasting algorithm called the K-tuple Full Withholding (KTFW), which significantly increases MAC networks’ resilience to jamming attacks and network growth. Through simulation, we compare the KTFW with both the BEB and the Queue Backoff (QB), an efficient and high-throughput broadcasting algorithm. We compare the three approaches against two different traffic injection models, each approximating a different environment type. Our results show that the KTFW achieves higher throughput and lower average packet latency against jamming attacks than both the BEB and the QB algorithms. The results also show that the KTFW outperforms the BEB for larger networks with or without jamming.

Sign in / Sign up

Export Citation Format

Share Document