{'fraction_non_alphanumeric': 0.022181146025878003, 'fraction_numerical': 0.0, 'mean_word_length': 4.82258064516129, '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}}
PATH -CONSTRAINED DATA GATHERING SCHEME FOR WIRELESS SENSOR NETWORKS WITH MOBILE ELEMENTS

Wireless Sensor Networks (WSNs) have emerged as a promising solution for variety of applications. Recently, in order to increase the lifetime of the network, many proposals have introduced the use of Mobile Elements (MEs) as a mechanical carrier to collect data. In this paper, we investigate the problem of designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of the mobile element tour is bounded by pre-determined length. Caching can be implemented at various points on the network such that any node in the network is at most k-hops away from one of these caching points. To address this problem, we present heuristic-based solution. Our solution works by partitioning the network such that the depth of each partition is bounded by k. Then, in each partition, the minimum number of required caching points is identified. We compare the resulting performance of our algorithm with the best known comparable schemes in the literature.