TY - GEN
T1 - Topology-aware optimal task allocation for mission critical environment - A decentralized approach
AU - Ahmed, Shameem
AU - Nahrstedt, Klara
AU - Wang, Guijun
PY - 2011
Y1 - 2011
N2 - A typical mission consists of several deadline-driven, inter-dependent tasks which need to adhere to specific resource constraints. This makes Optimal Task Allocation (OTA) of a particular mission a daunting task, even for simple and less-challenging environments. The inherent challenges of Mission Critical Environment (MCE) (e.g., Disconnected, intermittent, and limited communication among nodes, high error rate, node mobility, etc.) make OTA even harder to accomplish. To address this problem, earlier, we proposed an automated approach, namely, Centralized Optimal Task Allocation Algorithm (COTAA). While COTAA performs OTA in an efficient manner, it is based on some assumptions (e.g., nodes must follow publish/subscribe-based communication model, there is no inter-dependency among tasks, and static central unit is solely responsible for task allocation) that make COTAA applicable only to specific MCEs (e.g., post-disaster recovery) and do not work well for other MCEs such as group-based UAV (Unmanned Aerial Vehicle) operation, robot-driven mission, etc. In this paper, we propose another novel automated approach, Decentralized Optimal Task Allocation Algorithm (DOTAA), which relaxes the above-mentioned assumptions and performs OTA in an efficient manner. In DOTAA, we have exploited the concept of application-layer hash and bidding approach to perform the OTA for larger classes of MCEs. We have also evaluated our solution using ns-2 simulator and our results show that DOTAA outperforms COTAA in terms of scalability, task allocation time, and bandwidth consumption.
AB - A typical mission consists of several deadline-driven, inter-dependent tasks which need to adhere to specific resource constraints. This makes Optimal Task Allocation (OTA) of a particular mission a daunting task, even for simple and less-challenging environments. The inherent challenges of Mission Critical Environment (MCE) (e.g., Disconnected, intermittent, and limited communication among nodes, high error rate, node mobility, etc.) make OTA even harder to accomplish. To address this problem, earlier, we proposed an automated approach, namely, Centralized Optimal Task Allocation Algorithm (COTAA). While COTAA performs OTA in an efficient manner, it is based on some assumptions (e.g., nodes must follow publish/subscribe-based communication model, there is no inter-dependency among tasks, and static central unit is solely responsible for task allocation) that make COTAA applicable only to specific MCEs (e.g., post-disaster recovery) and do not work well for other MCEs such as group-based UAV (Unmanned Aerial Vehicle) operation, robot-driven mission, etc. In this paper, we propose another novel automated approach, Decentralized Optimal Task Allocation Algorithm (DOTAA), which relaxes the above-mentioned assumptions and performs OTA in an efficient manner. In DOTAA, we have exploited the concept of application-layer hash and bidding approach to perform the OTA for larger classes of MCEs. We have also evaluated our solution using ns-2 simulator and our results show that DOTAA outperforms COTAA in terms of scalability, task allocation time, and bandwidth consumption.
KW - Mission Critical Environment
KW - Optimal Task Allocation
UR - http://www.scopus.com/inward/record.url?scp=84863064040&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863064040&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2011.6127790
DO - 10.1109/MILCOM.2011.6127790
M3 - Conference contribution
AN - SCOPUS:84863064040
SN - 9781467300810
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 884
EP - 889
BT - 2010 Military Communications Conference, MILCOM 2010
T2 - 2011 IEEE Military Communications Conference, MILCOM 2011
Y2 - 7 November 2011 through 10 November 2011
ER -