{'fraction_non_alphanumeric': 0.01987353206865402, 'fraction_numerical': 0.0036133694670280035, 'mean_word_length': 5.155555555555556, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An approximate analysis of buffered CSMA in fading channels using tagged user analysis

In this paper, we analyze a homogeneous finite-users finite-buffer (FUFB) CSMA system operating in a Rayleigh fading channel using tagged user analysis. Assuming that the system has reached a steady-state condition in a symmetric channel, we select arbitrarily one representative user, called tagged user, and analyze its behavior in the presence of interference from other contending users. The packet service time distribution of this user is found using a state flow graph. This information is then used for the queueing analysis of the tagged user and thus different performance measures, like throughput and packet transmission delay are easily obtained. This approach decouples the channel contention from queueing behavior and greatly simplifies the problem. As shown in the paper, the approach is also transparent to channel model and spatial distribution of users. The analytical results are also verified by comparing with simulation values using a number of examples. Copyright © 2006 John Wiley & Sons, Ltd.