{'fraction_non_alphanumeric': 0.021798365122615803, 'fraction_numerical': 0.0, 'mean_word_length': 5.528888888888889, '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 efficient chunked network code based transmission scheme in wireless networks

Opportunistic routing (OR) is a promising technology to enhance the throughput of wireless networks, which can be implemented in a distributed manner using random linear network coding (RLNC). To reduce the computational cost incurred by RLNC, most previous approaches partition the input packets into disjoint small chunks, apply RLNC within each chunk, and guarantee the decoding reliability by a feedback mechanism. However, a feedback mechanism can incur much transmission overhead, reducing the network performance significantly. Recently, chunked network codes (CC) are proposed to eliminate the requirement of feedback, where a linear block code is applied on the input packets before partitioning the packets into chunks. While several classes of CC can achieve a close-to-optimal encoding/decoding performance, the whole transmission performance depends on how the chunks are transmitted in the absence of feedback, which is little investigated in OR-based wireless networks. In this paper, we propose a simple chunk transmission scheme for CC in a common OR-based wireless network, which does not require any node coordination during the transmission and keep the buffer of the relay node stable. We further optimize the performance of the transmission scheme via linear programming, and demonstrate that our scheme performs near-optimally via extensive numerical evaluations.