An Algorithm of Multi-Round Task Scheduling in Wireless Sensor Networks
Zhongjiang Yan · Xi'an Jiaotong Daxue xuebao · 2010
A multi-round task scheduling algorithm(WMTSA) under clustering structure in wireless sensor networks is proposed to fully use the network resources.The WMTSA is based upon the divisible load theory and the tasks in SINK are distributed to every cluster head by multi-round according to the processing capacity of each cluster.The SINK sends tasks of each round to cluster head sequentially to remove performance degradation caused by communications interference.After each cluster finishing its tasks and fusing the data,the cluster heads send results of the round back to the SINK sequentially.The proposed algorithm could overlap the task-performing and the communication phase much better,reduce task completion time,and improve network resource utilization.Simulation results show that the algorithm enables tasks to be reasonably distributed to each node in wireless sensor networks,and effectively reduces both time-consuming and energy-consuming in completing tasks.It is found that with increasing size of networks,the task completion time is reduced by 40%.