{'fraction_non_alphanumeric': 0.010625737898465172, 'fraction_numerical': 0.0, 'mean_word_length': 4.542483660130719, '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}}
Optimal path discovery for two moving sinks with a common junction in a wireless sensor network

A new algorithm is described for determining the optimal round-trip paths for two moving sinks in a wireless sensor network. The algorithm uses binary integer programming to select two non-overlapping shortest paths except having a common junction node to cover all the sensor nodes. The two paths are balanced as nearly equal as possible. That is the sensor nodes along each path are equal or differ by just one depending on whether the total number of sensor nodes excluding the junction node is even or odd. In this method, both the path lengths are made equal or very nearly equal while the total length is minimized. This integrated approach is a novel and unique solution to solve the dual moving sink path problem in a wireless sensor network.