A queueing model for analysis of a bursty multiple-access communication channel

1981 ◽  
Vol 27 (3) ◽  
pp. 317-321 ◽  
Author(s):  
J. Sennott ◽  
L. Sennott
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.


Author(s):  
Zlatka Nikolova ◽  
Georgi Iliev ◽  
Miglen Ovtcharov ◽  
Vladimir Poulkov

Signal distortions in communication systems occur between the transmitter and the receiver; these distortions normally cause bit errors at the receiver. In addition interference by other signals may add to the deterioration in performance of the communication link. In order to achieve reliable communication, the effects of the communication channel distortion and interfering signals must be reduced using different techniques. The aim of this paper is to introduce the fundamentals of Orthogonal Frequency Division Multiplexing (OFDM) and Orthogonal Frequency Division Multiple Access (OFDMA), to review and examine the effects of interference in a digital data communication link and to explore methods for mitigating or compensating for these effects.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1508
Author(s):  
Alexander Dudin ◽  
Sergei Dudin ◽  
Valentina Klimenok ◽  
Yuliya Gaidamaka

We consider a MAP/PH/1-type queueing system with server vacations as a model that is useful for the analysis of multiple access systems with polling discipline without transmission interruption. Vacation of the server corresponds to the service providing competitive information flows to the polling system. In this paper, we consider a vacation queueing model under pretty general assumptions about the probabilistic distributions describing the behavior of the system and the realistic assumption, in many real-world systems, that ongoing service cannot be terminated ahead of schedule. We derive the criterion of the stable operation of the system and the stationary distributions of the system states and the waiting time. An illustrative numerical example is presented.


In a code division multiple access (CDMA) system, multiple access interference (MAI) and Inter-symbol interference (ISI) appears if generated spreading codes are not maintained orthogonally and the communication channel is taken as multi-path communication channel. When generated spreading codes are multi-path spread and then channel delay occurs, it shows that ortho-gonality of the spreading codes is not maintained. The effect of MAI can be mitigated by maintaining low cross-correlation values as much as low between the large numbers of spreading codes. The code division multiple technique spreading codes must maintain absolutely impulsive autocorrelation at origin and very low cross correlation other than origin to avoid false synchronisation. i.e autocorrelation must be maximum at origin and cross correlation must be minimum at non origin point. In this paper, we propose multi-objective Genetic Algorithm approach –Genetic Algorithm-II (NSGA-II) to reduce the out-of-phase average mean-square aperiodic autocorrelation and average mean-square aperiodic cross-correlation value of randomly initialized binary spreading code set.


2021 ◽  
Vol 11 (3) ◽  
pp. 1156
Author(s):  
Bader A. Aldawsari ◽  
Jafar Haadi Jafarian

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