{'fraction_non_alphanumeric': 0.012565445026178011, 'fraction_numerical': 0.0, 'mean_word_length': 5.732394366197183, '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}}
Striping scheme for wireless communication systems

Using a communication system composed of multiple links, with different characteristics and throughputs, not only increases the global transmission throughput but also considerably improves the reliability of the system. However, to be fully efficient such a system requires particular schemes, called striping schemes, to split traffic over the links. The allocation of the successive packets towards one or other link can heavily affect delays before retransmission of any lost packets, and finally modifies the final throughput obtained. This paper considers wireless communications with particularly unreliable performances. It proposes an analysis of the effects of possible packets striping methods and presents some simulation results which allow some parameters of our striping algorithm to be optimized. The delays obtained with our method is then compared to those obtained with other schemes.