Interval Tree-Based Task Scheduling Method for Mobile Crowd Sensing Systems

Nowadays there is an increasing demand to provide a real-time environmental information. So, the growing number of mobile devices carried by users establish a new and fastgrowing sensing paradigm to satisfy this need, which is called Mobile Crowd Sensing (MCS). The MCS uses different sensing abiliti...

Full description

Bibliographic Details
Main Authors: Ahmed A. A. Gad-ElRab, Almohammady S. Alsharkawy
Format: Article
Language:English
Published: Croatian Communications and Information Society (CCIS) 2018-03-01
Series:Journal of Communications Software and Systems
Subjects:
Online Access:https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/429
Description
Summary:Nowadays there is an increasing demand to provide a real-time environmental information. So, the growing number of mobile devices carried by users establish a new and fastgrowing sensing paradigm to satisfy this need, which is called Mobile Crowd Sensing (MCS). The MCS uses different sensing abilities to acquire local knowledge through enhanced mobile devices. In MCS, it is very important to collect high-quality sensory data that satisfies the needs of all assigned tasks and the task organizers with a minimum cost for the participants. One of the most important factors which affect the MCS cost is how to schedule different sensing tasks which must be assigned to a smartphone with the objective of minimizing sensing energy consumption while ensuring high-quality sensory data. In this paper, the problem of task scheduling the which have mutual sensor is formulated and a scheduling method to minimize the energy consumption by reducing the sensor utilization is proposed. The proposed method will incentive the users to participate in multiple tasks at the same time, which minimizes the total cost of the performed tasks and increases his rewards. The experimental results by using synthetic and real data show that the proposed scheduling method can minimize the energy consumption and preserve the task requirements compared to existing algorithms.
ISSN:1845-6421
1846-6079