Name
Abstract | ||
|---|---|---|
Proper allocation of tasks between actors is one of the critical issues for Wireless Sensor and Actor Networks (WSANs), which can improve the execution efficiency of the network, prolong the network life and so on. Traditional task allocation algorithms assume that the underlying network of the wireless systems are always connected, thus the only thing they should consider is how to improve the performance of task allocation. However, due to the movements of the actors, the assumption is hard to come into existence in WSANs. To solve this problem, we proposed a task allocation algorithm named MIA-TA in this paper. This approach consists of two stages. We apply the improved connected dominating set (CDS) formation algorithm MIA to construct the backbone of the network firstly. Tasks are assigned on the basic of CDS in the second stage. By considering the network conditions of executor’s leave and arrive positions, we can ensure the entire network’s connectivity. Simulation results confirm that MIA-TA algorithm can be used to solve both task allocation and connectivity maintenance problems with reasonable movements and messages generated in the whole process. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.adhoc.2019.03.006 | Ad Hoc Networks |
Keywords | Field | DocType |
WSAN,CDS,Task allocation,Network connectivity | Executor,Wireless,Wireless systems,Computer science,Computer network,Allocation algorithm,Connected dominating set,Network conditions,Distributed computing | Journal |
Volume | ISSN | Citations |
89 | 1570-8705 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Guo | 1 | 6 | 5.89 |
| Y. Zhang | 2 | 288 | 39.66 |
| Zhenqiang Mi | 3 | 5 | 6.54 |
| Yang Yang | 4 | 612 | 174.82 |
| Mohammad S. Obaidat | 5 | 2190 | 315.70 |