Title :
QoS-constrained sensing task assignment for mobile crowd sensing
Author :
Zhijie Wang ; Dijiang Huang ; Huijun Wu ; Yuli Deng ; Aikebaier, Ailixier ; Teranishi, Yuuichi
Author_Institution :
Arizona State Univ., Tempe, AZ, USA
Abstract :
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 the timeliness and quality of the data samples in MCS, it is critical to select qualified participants to maintain sensing coverage ratios over important spatial areas (i.e., hotspots) during time periods of interest and meet various Quality of Service (QoS) requirements of sensing applications. In this paper, we examine the problems of sensing task assignment to minimize the overall cost and maximize the total utility in MCS while adhering to the QoS constraints and prove that they are NP-hard problems. Consequently, we present heuristic greedy approaches as the baseline solutions and further propose new hybrid approaches with the greedy algorithm and bees algorithm combined to address them. We demonstrate that the hybrid approaches significantly outperform the greedy approaches through extensive simulation and the analysis is given in the end.
Keywords :
greedy algorithms; minimisation; mobile computing; quality of service; MCS; NP-hard problems; QoS-constrained sensing task assignment; bees algorithm; greedy algorithm; heuristic greedy approaches; mobile crowd sensing; overall cost minimization; sensing task assignment; Greedy algorithms; Minimization; Mobile communication; Quality of service; Sensors; Spatiotemporal phenomena; Vectors;
Conference_Titel :
Global Communications Conference (GLOBECOM), 2014 IEEE
Conference_Location :
Austin, TX
DOI :
10.1109/GLOCOM.2014.7036826