Adaptive Tasks Balancing in Wireless Sensor Networks

In this paper, we extend our CPU-scheduling algorithm which is based on topology information of the network. In wireless sensor network applications, the nodes closer to the network´s central point have to perform forwarding operations. Concurrently, they also have to process their own sensing packets. In high rate application, such nodes suffer from CPU overloading. In the priority scheduling scheme, which solves the overloading in simple FIFO CPU-scheduling in wireless sensor nodes, it is not ensured that these nodes will have fair chance to process their local sensing packets if the forwarding operations will be prioritized over their local processing. To guarantee processing and then sending the local packets, we introduce the scheme of switching in the priority according to the routing information in such nodes, so that they are able to complete their local tasks also. Our proposal enhances the fairness of the distributed sensing.