Collaborative Mobile Crowdsensing in Opportunistic D2D Networks: A Graph-based Approach

摘要

With the remarkable proliferation of smart mobile devices, mobile crowdsensing has emerged as a compelling paradigm to collect and share sensor data from surrounding environment. In many application scenarios, due to unavailable wireless network or expensive data transfer cost, it is desirable to offload crowdsensing data traffic on opportunistic device-to-device (D2D) networks. However, coupling between mobile crowdsensing and D2D networks, it raises new technical challenges caused by intermittent routing and indeterminate settings. Considering the operations of data sensing, relaying, aggregating, and uploading simultaneously, in this article, we study collaborative mobile crowdsensing in opportunistic D2D networks. Toward the concerns of sensing data quality, network performance and incentive budget, Minimum-Delay-Maximum-Coverage (MDMC) problem and Minimum-Overhead-Maximum-Coverage (MOMC) problem are formalized to optimally search a complete set of crowdsensing task execution schemes over user, temporal, and spatial three dimensions. By exploiting mobility traces of users, we propose an unified graph-based problem representation framework and transform MDMC and MOMC problems to a connection routing searching problem on weighted directed graphs. Greedy-based recursive optimization approaches are proposed to address the two problems with a divide-and-conquer mode. Empirical evaluation on both real-world and synthetic datasets validates the effectiveness and efficiency of our proposed approaches.