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 条
  • [41] Architecture of a time-sensitive provisioning system for cloud-native software
    Venkateswaran, Sreekrishnan
    Bauskar, Adwait
    Sarkar, Santonu
    SOFTWARE-PRACTICE & EXPERIENCE, 2022, 52 (05): : 1170 - 1198
  • [42] Modelling time-sensitive linking mechanisms
    Heimbürger, A
    INFORMATION MODELLING AND KNOWLEDGE BASES XIV, 2003, 94 : 26 - 42
  • [43] Answering General Time-Sensitive Queries
    Dakka, Wisam
    Gravano, Luis
    Ipeirotis, Panagiotis G.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (02) : 220 - 235
  • [44] Node Immunization with Time-Sensitive Restrictions
    Cui, Wen
    Gong, Xiaoqing
    Liu, Chen
    Xu, Dan
    Chen, Xiaojiang
    Fang, Dingyi
    Tang, Shaojie
    Wu, Fan
    Chen, Guihai
    SENSORS, 2016, 16 (12)
  • [45] Time-sensitive networking for industrial applications
    Raveling, Alan
    Control Engineering, 2022, 69 (04): : 44 - 47
  • [46] SHOPPING MODEL OF THE TIME-SENSITIVE CONSUMER
    UMESH, UN
    PETTIT, KL
    BOZMAN, CS
    DECISION SCIENCES, 1989, 20 (04) : 715 - 729
  • [47] Weighted Scheduling of Time-Sensitive Coflows
    Brun, Olivier
    El-Azouzi, Rachid
    Luu, Quang-Trung
    De Pellegrini, Francesco
    Prabhu, Balakrishna J.
    Richier, Cedric
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2024, 12 (02) : 644 - 658
  • [48] Satisficing in Time-Sensitive Bandit Learning
    Russo, Daniel
    Van Roy, Benjamin
    MATHEMATICS OF OPERATIONS RESEARCH, 2022, 47 (04) : 2815 - 2839
  • [49] Modeling Time-Sensitive Swarm Dynamics
    Sasaki, Hideyasu
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [50] Time-sensitive sampling for spam filtering
    Fu, CL
    Silver, D
    ADVANCES IN ARTIFICIAL INTELLIGENCE, 2004, 3060 : 551 - 553