Task Allocation approach to reduce Makespan in Wireless Sensor and Flying Robot Networks

In this paper, we present a mathematical solution based on queuing theory to minimize the network makespan in wireless sensor and flying robot networks. We compute the bestrate of distribution of tasks by the network sink to allocated flying robots through a steady state analysis of our proposedmodel to solve equations and inequalities. It is shown that this distribution rate lessens the network makespan. Experimental results on a typical scenario have shown approximately 40%improvement in reducing the makespan and 20% enlargement in reserving energies of the flying robots compared to stochastic allocation of tasks to the flying robots

کلیدواژه ها:

Wireless Sensor and Flying Robot Networks ، Task Allocation ، Queuing System ،