Boosting task completion rate for time-sensitive MCS system

被引:3
|
作者
Xu, Zhilin [1 ]
Sun, Hao [1 ]
Han, Weibin [2 ]
机构
[1] Northwestern Polytech Univ, Xian 710072, Shaanxi, Peoples R China
[2] South China Normal Univ, Guangzhou 510000, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Time-sensitive MCS system; Task completion rate; Budget constraints; Coopetition; Dynamic incentive mechanism; STACKELBERG GAME APPROACH; MOBILE;
D O I
10.1016/j.comnet.2024.110636
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In Mobile Crowdsensing system, many sensing tasks are time-sensitive, hence, time validity is essential cause data outside the time frame is useless which will not only increase requesters' costs but also damage requesters' efficiency and utilities. Therefore, it is crucial to design an incentive mechanism to increase system's task completion rate within time limitations. A dilemma arises between requesters and the MCS system due to the trad-off between requester's goal to maximize its own utilities and the MCS system's purpose to increase the whole system's task completion rate. To solve the dilemma, we come up with a dynamic coopetition (competition and cooperation) incentive mechanism where in every stage there are competition to assure requesters' utilities and cooperation to reallocate data to advance the system's task completion rate. During competition, a matching algorithm with budget constraints is presented to derive the optimal matching strategies for requesters and participants without exceeding requesters' budgets while maximizing utilities. After competing, the centralized MCS platform would reallocate requesters' excessive data to those who failed to get enough data on time through a data reallocation algorithm. By simulations, we compare the performance of the coopetition incentive mechanism with different orders and parameters. Regardless of parameters or orders, our algorithm can promise a minimum task completion rate of 94% compared with less than 32% task completion rate with only competition. Among all three orders, emergency degree has the best performance with task completion rate up to 99%.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Time-Sensitive Query Auto-Completion
    Shokouhi, Milad
    Radinsky, Kira
    SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2012, : 601 - 610
  • [2] TSP Race: Minimizing completion time in time-sensitive applications
    Cavdar, Bahar
    Sokol, Joel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (01) : 47 - 54
  • [3] Selective Coflow Completion for Time-sensitive Distributed Applications with Poco
    Luo, Shouxi
    Fan, Pingzhi
    Xing, Huanlai
    Yu, Hongfang
    PROCEEDINGS OF THE 49TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2020, 2020,
  • [4] Time-sensitive POI Recommendation by Tensor Completion with Side Information
    Hui, Bo
    Yan, Da
    Chen, Haiquan
    Ku, Wei-Shinn
    2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 205 - 217
  • [5] Distributed Time-Sensitive Task Selection in Mobile Crowdsensing
    Cheung, Man Hon
    Hou, Fen
    Huang, Jianwei
    Southwell, Richard
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (06) : 2172 - 2185
  • [6] Failure rate analysis for time-sensitive networking
    Xu, Jinpeng
    Luo, Feng
    Shao, Hailun
    PROCEEDINGS OF THE 2016 5TH INTERNATIONAL CONFERENCE ON MEASUREMENT, INSTRUMENTATION AND AUTOMATION (ICMIA 2016), 2016, 138 : 593 - 598
  • [7] Prefix-Adaptive and Time-Sensitive Personalized Query Auto Completion
    Cai, Fei
    Liang, Shangsong
    de Rijke, Maarten
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (09) : 2452 - 2466
  • [8] ITANS: Incremental Task and Network Scheduling for Time-Sensitive Networks
    Arestova, Anna
    Baron, Wojciech
    Hielscher, Kai-Steffen J.
    German, Reinhard
    IEEE OPEN JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 3 : 369 - 387
  • [9] TripRouter: A Time-Sensitive Route Recommender System
    Hsieh, Hsun-Ping
    Li, Cheng-Te
    Lin, Shou-De
    2014 IEEE International Conference on Data Mining Workshop (ICDMW), 2014, : 1207 - 1210
  • [10] Efficient Task-Network Scheduling with Task Conflict Metric in Time-Sensitive Networking
    Xu, Lei
    Xu, Qimin
    Chen, Cailian
    Zhang, Yanzhou
    Wang, Shouliang
    Guan, Xinping
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2024, 20 (02) : 1528 - 1538