{'fraction_non_alphanumeric': 0.016765285996055226, 'fraction_numerical': 0.0, 'mean_word_length': 5.226993865030675, '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}}
Utility-Based Divisible Sensing Task Scheduling in Wireless Sensor Networks

This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited battery power of sensors, it is desirable that the sensor network can complete a task as quickly as possible. Given a task, each source node processes an appropriate fraction of the entire workload and then transmits the result to the sink node via a set of routing nodes. Two representative network models are presented to illustrate how the workload is scheduled among the sensor nodes so that the finish time of the workload is minimized. Furthermore, we present the energy model for nodes in a two-level hierarchical network topology. Finally, simulation results are presented to demonstrate the effects of selected system parameters such as the number of sensor nodes, measurement, processing, and communication speed on the performance of the sensor network.