{'fraction_non_alphanumeric': 0.014466546112115732, 'fraction_numerical': 0.0, 'mean_word_length': 5.184357541899441, '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}}
Markov Decision Process Based Wireless Multicast Opportunistic Routing

There are more and more pervasive applications of Wireless Multicast Network, such as the video conference, the voice transmission and the software updates etc. The traditional wireless multicast routing method is to construct a multicast tree, which may ignore many available links. This paper presents Markov Decision Process Based Multicast Opportunistic Routing Model. Whether each node of the whole network has received a packet stands for different states of a Markov chains. That is to say that Markov state transition is a routing process. This paper provides a new approach for the study of wireless multicast networks routing. In the reward function of the model, the consumption of Request and ACK among the nodes is abundantly considered. In accordance with each state of the network, the network chooses the optimal forwarding nodes which make the reward function of the model maximum. The experiment and the simulation results proves MDP is most effective routing scheme, and meets with the network system's requirement.