Analysis of task scheduling in wireless sensor networks based on divisible load theory
用可分负载理论分析无线传感器网络任务调度

To accomplish the tasks within a possibly shortest time, and fully use network resources, a task scheduling algorithm(WDTA) based on divisible load theory is proposed under clustering structure in wireless sensor networks. In WDTA, the tasks are distributed to wireless sensor network based on the processing and communication capacity of each sensor by SINK. By removing communication interference between each sensor, this algorithm achieves the reduction of the task-accomplishment time and improves the network resource utilization. Two kinds of heterogeneous clustering network settings are then analyzed in WDTA. The most reasonable scheme for task allocation in all nodes and the shortest time required to accomplish the tasks are also obtained. The limit case of task scheduling in wireless sensor networks is theoretically analyzed. Finally, simulation results show that the algorithm can reasonably distribute tasks to each sensor, and then effectively reduces the time-consumption and energy-consumption in task accomplishment. This scheme can be used as the design principle for large-scale wireless sensor networks.