{'fraction_non_alphanumeric': 0.013852813852813853, 'fraction_numerical': 0.0, 'mean_word_length': 5.386740331491713, '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}}
Random Network Coding Based on Adaptive Sliding Window in Wireless Multicast Networks

Network coding offers a promising platform for multicast transmission to improve the throughput. However, the users may not collect a full set of the encoded packets to recover the useful information because of its block processing property, leading to the low throughput under wireless fading channel. While the schemes that using feedback from all the receivers to cover the problem above always causes the huge feedback overhead in large network. Accordingly, in this paper we proposed an adaptive sliding window random network coding(ASWRNC) that introduce RNC with lower triangular coefficient matrix and sliding window to achieve higher network throughput and lower feedback overhead. Particularly, we introduce an adaptive encoding scheme that can let the user decode out partial original packets without collecting the full set of encoded packets. On the other hand, the window sliding scheduling helps the user with better channel decode out more original packets. Further, we discuss in detail the feedback-compete mechanism to decline the feedback overhead.