TY  - EJOU
AU  - Okhovvat, Morteza 
AU  - Kangavari, Mohammad Reza 

TI  - A Mathematical Task Dispatching Model in Wireless Sensor Actor Networks
T2  - Computer Systems Science and Engineering

PY  - 2019
VL  - 34
IS  - 1
SN  - 

AB  - In this paper, we propose a mathematical task dispatching model to reduce the total tasks completion time, i.e. make-span, in Wireless Sensor Actor
Networks (WSANs). The proposed approach minimizes the completion time of tasks that have been allocated to actors but have not yet been dispatched to
actors for execution in the networks. 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. It is shown that this dispatching rate improves the network lifetime too. Experimental results
with a prototyped simulation of the proposed approach show shorter make-span and longer network lifetime compared to when one of the three famous
task allocation algorithms, namely, the min-min, opportunistic load balancing (OLB), and stochastic allocation algorithms, is used.
KW  - Make-span
KW  -  task dispatching
KW  -  wireless sensor actor network
KW  -  network lifetime

DO  - 10.32604/csse.2019.34.005