作者: Zhijie Wang , Dijiang Huang , Huijun Wu , Yuli Deng , Ailixier Aikebaier
DOI: 10.1109/GLOCOM.2014.7036826
关键词: Mobile device 、 Greedy algorithm 、 Task (project management) 、 Greedy randomized adaptive search procedure 、 Heuristic 、 Distributed computing 、 Quality of service 、 Mobile telephony 、 Heuristic (computer science) 、 Computer science 、 Bees algorithm
摘要: The ubiquitous sensing-capable mobile devices have been fuelling the new paradigm of Mobile Crowd Sensing (MCS) to collect data about their surrounding environment. To ensure timeliness and quality samples in MCS, it is critical select qualified participants maintain sensing coverage ratios over important spatial areas (i.e., hotspots) during time periods interest meet various Quality Service (QoS) requirements applications. In this paper, we examine problems task assignment minimize overall cost maximize total utility MCS while adhering QoS constraints prove that they are NP-hard problems. Consequently, present heuristic greedy approaches as baseline solutions further propose hybrid with algorithm bees combined address them. We demonstrate significantly outperform through extensive simulation analysis given end.