TY - GEN
T1 - Enabling green mobile crowd sensing via optimized task scheduling on smartphones
AU - Wang, Jing
AU - Tang, Jian
AU - Sheng, Xiang
AU - Xue, Guoliang
AU - Yang, Dejun
N1 - Funding Information:
This research was supported in part by NSF grants 1217611, 1218203, 1444059 and 1421685. The information reported here does not reflect the position or the policy of the federal government
PY - 2015
Y1 - 2015
N2 - In a mobile crowd sensing system, a smartphone undertakes many different sensing tasks that demand data from various sensors. In this paper, we consider the problem of scheduling different sensing tasks assigned to a smartphone with the objective of minimizing sensing energy consumption while ensuring Quality of SenSing (QoSS). First, we consider a simple case in which each sensing task only requests data from a single sensor. We formally define the corresponding problem as the Minimum Energy Single-sensor task Scheduling (MESS) problem and present a polynomial-time optimal algorithm to solve it. Furthermore, we address a more general case in which some sensing tasks request multiple sensors to report their measurements simultaneously. We present an Integer Linear Programming (ILP) formulation as well as an effective polynomial-time heuristic algorithm, for the corresponding Minimum Energy Multi-sensor task Scheduling (MEMS) problem. Extensive simulation results show that the proposed algorithms achieve over 79% energy savings on average compared to a widely-used baseline approach, and moreover, the proposed heuristic algorithm produces close-to-optimal solutions.
AB - In a mobile crowd sensing system, a smartphone undertakes many different sensing tasks that demand data from various sensors. In this paper, we consider the problem of scheduling different sensing tasks assigned to a smartphone with the objective of minimizing sensing energy consumption while ensuring Quality of SenSing (QoSS). First, we consider a simple case in which each sensing task only requests data from a single sensor. We formally define the corresponding problem as the Minimum Energy Single-sensor task Scheduling (MESS) problem and present a polynomial-time optimal algorithm to solve it. Furthermore, we address a more general case in which some sensing tasks request multiple sensors to report their measurements simultaneously. We present an Integer Linear Programming (ILP) formulation as well as an effective polynomial-time heuristic algorithm, for the corresponding Minimum Energy Multi-sensor task Scheduling (MEMS) problem. Extensive simulation results show that the proposed algorithms achieve over 79% energy savings on average compared to a widely-used baseline approach, and moreover, the proposed heuristic algorithm produces close-to-optimal solutions.
UR - http://www.scopus.com/inward/record.url?scp=84964902391&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964902391&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2014.7417136
DO - 10.1109/GLOCOM.2014.7417136
M3 - Conference contribution
AN - SCOPUS:84964902391
T3 - 2015 IEEE Global Communications Conference, GLOBECOM 2015
BT - 2015 IEEE Global Communications Conference, GLOBECOM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 58th IEEE Global Communications Conference, GLOBECOM 2015
Y2 - 6 December 2015 through 10 December 2015
ER -