Earticle

초록

영어

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

목차

Abstract
1. Introduction
2. Problem Definition
3. Algorithm
4. Result and Analysis
5. Conclusion
Acknowledgement
References

키워드

저자

• Shathee Akter [ Ph.D Candidate, Department of Electrical and Computer Engineering, University of Ulsan, Ulsan, Korea ]
• Seokhoon Yoon [ Professor, Department of Electrical and Computer Engineering, University of Ulsan, Ulsan, Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Internet, Broadcasting and Communication

• 간기

  계간

• pISSN

  2288-4920

• eISSN

  2288-4939

• 수록기간

  2009~2025

• 십진분류

  KDC 326 DDC 380