I. Introduction
The directed acyclic graph[1] and independent task sets[2] are usually used as modeling tools for task scheduling of wireless sensor networks. Under normal circumstances, these two models of scheduling problems are NP complete, which is in sharp contrast to the divisible load theory [3], [4].