Task allocation to actors in wireless sensor actor networks: an energy and time aware technique

Abstract Task allocation is a critical issue in proper engineering of cooperative applications in embedded systems with latency and energy constraints, as in wireless sensor and actor networks (WSANs). Existing task allocation algorithms are mostly concerned with energy savings and ignore time constraints and thus increase the makespan of tasks in the network as well as the probability of malfunctioning of the network. In this paper we take both energy awareness and reduction of actor tasks’ times to completion in WSANs into account and propose a two-phase task allocation technique based on Queuing theory. In the first phase, tasks are equally assigned to actors just to measure the capability of each actor to perform the assigned tasks. Tasks are then allocated to actors according to their measured capabilities in such a way to reduce the total completion times of all tasks in the network. The results of simulations on typical scenarios shows 45% improvement in the makespan of tasks in a network compared to the wellknown opportunistic load balancing (OLB) task allocation algorithm that is generally used in distributed systems. It is shown that our algorithms provide better tradeoffs between load balancing and completion times of all tasks in a WSAN compared to OLB.

[1]  Viktor K. Prasanna,et al.  Energy-Balanced Task Allocation for Collaborative Processing in Wireless Sensor Networks , 2005, Mob. Networks Appl..

[2]  Mohsen Sharifi,et al.  A New Approach to Task Allocation in Wireless Sensor Actor Networks , 2009, 2009 First International Conference on Computational Intelligence, Communication Systems and Networks.

[3]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[4]  Jean Mairesse,et al.  Joint Burke's Theorem and RSK Representation for a Queue and a Store , 2003, DRW.

[5]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[6]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[7]  Feng Xia,et al.  Wireless Sensor/Actuator Network Design for Mobile Control Applications , 2007, Sensors.

[8]  Mohamed F. Younis,et al.  Optimization of task allocation in a cluster-based sensor network , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[9]  Anthony A. Maciejewski,et al.  Static mapping of subtasks in a heterogeneous ad hoc grid environment , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[10]  Daeyoung Kim,et al.  Battery aware real time task scheduling in wireless sensor networks , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[11]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[12]  Yutaka Takahashi,et al.  A queue management algorithm for fair bandwidth allocation , 2007, Comput. Commun..

[13]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[14]  Eylem Ekici,et al.  Energy-constrained task mapping and scheduling in wireless sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[15]  P. Burke.  The Output of a Queuing System , 1956 .

[16]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[17]  Mohsen Sharifi,et al.  A Graph Transformation-based Approach to Task Allocation in Wireless Sensor Actor Networks , 2009, SEKE.