{'fraction_non_alphanumeric': 0.014450867052023121, 'fraction_numerical': 0.0, 'mean_word_length': 5.1875, '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}}
Scheduling under Location and Time Constraints for Data Collection in Sensor Networks ( Work in Progress paper )

Unlike the traditional multihop forwarding approach, an alternative approach for data collection in sensor networks is to exploit the mobility: a mobile node travels through the sensor field and collects data from each sensor when it is at the proximity. In this paper, we define data mule scheduling problem and formulate it as a scheduling problem that has both location constraints and time constraints. We present some initial results on simple cases of data mule scheduling problem and suggest similarities with speed scaling problems such as DVS (Dynamic Voltage Scaling).