{'fraction_non_alphanumeric': 0.016025641025641024, 'fraction_numerical': 0.0, 'mean_word_length': 4.8930817610062896, '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 Energy-Efficiency Multicast Routing Algorithm in Wireless Sensor Networks

Routing problem is one of the most important issues to a wireless sensor network (WSN), and multicast communication has become necessary to support some new applications. In the paper, we propose an energy-aware multicast routing algorithm for WSNs. The algorithm is based on geographic routing, and defines the multicast region as rectangle that has smallest area but covers all destination nodes, where an access point is selected as a gateway. The whole routing process includes two phases. The first phase is to seek a minimal energy path from the sink to the access point based on the idea of dynamic programming. The second phase is to search for a broadcast tree between the access point and the destination nodes in the multicast region. Experiments indicate that our algorithm has better performance on energy expends and success rate of tree setup.