Research Of Task Assignment And Scheduling Algorithms In Wireless Sensor Networks

In recently several years, it is increasingly important that wireless sensor networks (WSN) be able to achieve detecting and transiting data information of environment, in particular, which is widely applied to field of civil and military, which has more advantage than traditional networks. Sensor nodes play the role of sensing event and collected data of environment, and transit data information toward cluster head node or sink node by one-hop or multi-hop router, then transit it to base station or data center. Suppose looking upon processing information as a task of node, we consider power constraints of node, and node use way of awaking/sleeping, during awaking we assure that sensor node accomplish task and cluster head node can schedule multi-task of sensor node. In this paper, we will resolve such problem: before satisfying multi-tasks deadline invaliding of sensor node, how to feasibly schedule task by cluster head node? We present schedule algorithm of improving Rate-Monotonic (RM) and dynamic Preemptive Earliest Deadline First Algorithm, via concrete example, we explain process of algorithm achieving, result indicate that the algorithms are simple and can reduce lateness of task, moreover, making feasible schedule of node task.