{'fraction_non_alphanumeric': 0.02064693737095664, 'fraction_numerical': 0.0, 'mean_word_length': 5.187234042553191, '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}}
Coded Incremental Collision Resolution Multiple Access Protocol-CICRMA for Wireless Environment

In this paper a new MAC protocol is proposed on the lines of the Incremental Collision Resolution Multiple Access (ICRMA) protocol, which we call the Coded Incremental Collision Resolution Multiple Access (CICRMA) protocol. As in the ICRMA, the channel is divided into cycles of variable length; each cycle consists of a contention period and a queue transmission period. The queue transmission period corresponds to a variable-length train of packets, which are transmitted by stations that have been added to the data transmission queue by successfully completing a collision-resolution round in the previous contention period. During the contention period, stations with one or more packets to send compete for the right to be added to the data-transmission queue using a deterministic tree-splitting algorithm. Spreading codes are incorporated for improved BER performance. While ICRMA uses binary tree-splitting algorithm, in the CICRMA protocol an n-ary tree-splitting algorithm is proposed, where n is the number of spreading codes used. Simulation of CICRMA vis-a-vis ICRMA shows that the throughput of CICRMA is marginally lesser than that of ICRMA in an ideal channel, however the throughput performance is found to be better than that of ICRMA when viewed through a practical faded channel. The Jakes fading model is employed for the simulation.