Notice of RetractionDTSWC: A task scheduling algorithm in wireless sensor networks with co-processor based on divisible load theory

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

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 co-processor. 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 closed-form solution for the shortest time required by finishing the application are obtained. Simulation results have shown the correctness of our theoretical analysis.