{'fraction_non_alphanumeric': 0.012417218543046357, 'fraction_numerical': 0.0, 'mean_word_length': 5.430851063829787, '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}}
Opportunistic Scheduling for Wireless Network Coding

This paper addresses a scheduling problem for wireless network coding which has been recently proposed as a novel method to enhance the throughput in wireless networks. The wireless network coding involves broadcast transmission of a network-coded packet which contains unicast data to several receiving nodes. These receiving nodes have time-varying fading links to the transmitting node, which can generate different instantaneous conditions for different links. In this paper, we introduce an opportunistic scheduling for such a wireless network coding, which selects a set of nodes whose packets are network - coded as well as the data rate for the broadcast transmission according to the instantaneous link conditions. We analyze the average capacity of such a scheduling, and discuss the impact of different parameters on the average capacity. We show that the opportunistic scheduling can maximize the average capacity by choosing the appropriate set of network-coded nodes according to the instantaneous link conditions. We also discuss the practical factors which can additionally affect the best scheduling strategy for wireless network coding.