Competition-Congestion-Aware Stable Worker-Task Matching in Mobile Crowd Sensing

Yang, G. and Wang, B. and He, X. and Wang, J. and Pervaiz, H. (2021) Competition-Congestion-Aware Stable Worker-Task Matching in Mobile Crowd Sensing. IEEE Transactions on Network and Service Management, 18 (3). pp. 3719-3732. ISSN 1932-4537

[img]
Text (论文20210112)
_20210112.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (1MB)

Abstract

Mobile Crowd Sensing is an emerging sensing paradigm that employs massive number of workers’ mobile devices to realize data collection. Unlike most task allocation mechanisms that aim at optimizing the global system performance, stable matching considers workers are selfish and rational individuals, which has become a hotspot in MCS. However, existing stable matching mechanisms lack deep consideration regarding the effects of workers’ competition phenomena and complex behaviors. To address the above issues, this paper investigates the competition-congestion-aware stable matching problem as a multi-objective optimization task allocation problem considering the competition of workers for tasks. First, a worker decision game based on congestion game theory is designed to assist workers in making decisions, which avoids fierce competition and improves worker satisfaction. On this basis, a stable matching algorithm based on extended deferred acceptance algorithm is designed to make workers and tasks mapping stable, and to construct a shortest task execution route for each worker. Simulation results show that the designed model and algorithm are effective in terms of worker satisfaction and platform benefit. IEEE

Item Type:
Journal Article
Journal or Publication Title:
IEEE Transactions on Network and Service Management
Additional Information:
©2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2208
Subjects:
ID Code:
156213
Deposited By:
Deposited On:
16 Jun 2021 13:55
Refereed?:
Yes
Published?:
Published
Last Modified:
24 Oct 2021 06:06