{'fraction_non_alphanumeric': 0.020771513353115726, 'fraction_numerical': 0.0, 'mean_word_length': 5.529032258064516, '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}}
Internet of Things in Motion: A Cooperative Data Muling Model Under Revisit Constraints

This work considers a case where a team of Unmanned Aerial Vehicles (UAVs) is to successively, persistently fly over a given area of interest, coming from different locations with the mission of collecting sensor readings from these locations, delivering/muling these readings to a fixed location, where a relevant data infrastructure is availed for processing the readings, related information is provided and/or shared as service to the community. We consider a scenario where data delivery guarantee, at the processing location for a period of time called revisit deadline, is a key feature upon which a successful mission depends. The problem of satisfying the revisit constraints for successive delivery is mathematically formulated, justified to be intractable. Heuristics to solve the problem are suggested, compared through numerical simulations. Lastly, the effectiveness of both heuristics is analysed, verified.