DTSWC: A Task Scheduling Algorithm in Wireless Sensor Networks with Co-processor Based on Divisible Load Theory
Wireless sensor networks with co-processor refer to each node can measure and report data simultaneously. To minimize the execution time of a given task, a task scheduling algorithm based on divisible load theory(DTSWC) was proposed under clustering structure in wireless sensor networks with coprocessor. Using this algorithm, the tasks can be reasonably allocated to each node in wireless sensor networks, such that the entire application can be finished in the shortest possible time. The optimal solution for the load allocation ratio on each node, and the closedform solution for the shortest time required by finishing the application are obtained. Simulation results have shown the correctness of our theoretical analysis.
Liang DAI Zhong SHEN Yilin CHANG
State Key Laboratory of Integrated Service Networks Xidian University Xian 710071, China
国际会议
成都
英文
494-497
2010-06-12(万方平台首次上网日期,不代表论文的发表时间)