{'fraction_non_alphanumeric': 0.020075282308657464, 'fraction_numerical': 0.0, 'mean_word_length': 5.138461538461539, '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}}
Real Time Scheduling for Wireless Sensor Networks

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS). This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network to achieve better power management and stable routes in case of failure. RTS delays packets at intermediate hops (not just prioritizes them) for a duration that is a function of their deadline. Delaying packets allows the network to avoid hot spotting while maintaining deadline-faithfulness. We compare RTS with another prioritizing and scheduling algorithm for real-time data dissemination in sensor networks. This paper simulates RTS based on two typical routing protocols, shortest path routing and greedy forwarding with J-Sim.