摘要

In this paper, we present a mathematical approach based on queuing theory to minimize the average number of allocated tasks to actors that have not been dispatched to actors yet for execution by the singleton network sink node in wireless sensor actor networks with semi-automated architecture. We calculate the best rate of dispatching of tasks by the network sink to allocated actors through a steady state analysis of our proposed model to solve equations and inequalities. We show that this dispatching rate reduces the overall completion time of all tasks in the network too. Experimental results on typical scenarios have shown 53% improvement in reducing the number of waiting tasks and 40% improvement in reducing the network makespan compared to stochastic allocation of tasks to actors. We also show that this makespan improvement results in more power savings in actors.

  • 出版日期2012-1