{'fraction_non_alphanumeric': 0.019005847953216373, 'fraction_numerical': 0.0, 'mean_word_length': 5.171171171171171, '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}}
Feasible bounds for multi-hop routing in sensor networks with mobile sinks

Mobile sink data collection can be accomplished with varying degrees of multi-hop routing. For a given data generation rate, as the extent of multi-hop routing increases, the round trip time of the sink decreases. At the same time, interference experienced by mobile sink-sensor link increases resulting in higher upload times. In the presence of these competing effects and sink constraints, this paper investigates the problem of determining the multi-hop routing that is feasible for the given network and application parameters through an analytical model and validates the predictions using simulations.