已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Online Organizing Large-Scale Heterogeneous Tasks and Multi-Skilled Participants in Mobile Crowdsensing

计算机科学 任务(项目管理) 树(集合论) 匹配(统计) 参与式感知 移动设备 比例(比率) 机器学习 人工智能 人机交互 数据挖掘 数据科学 数学 量子力学 管理 经济 数学分析 物理 操作系统 统计
作者
Lei Han,Zhiwen Yu,Zhiyong Yu,Liang Wang,Houchun Yin,Bin Guo
出处
期刊:IEEE Transactions on Mobile Computing [IEEE Computer Society]
卷期号:22 (5): 2892-2909 被引量:16
标识
DOI:10.1109/tmc.2021.3132616
摘要

Online gathering large-scale heterogeneous tasks and multi-skilled participant can make the tasks and participants to be shared in real time. However, their online gathering will bring many intractable objective requirements, which makes task-participant matching become extremely complex. To cope well with the gathering, we design a hierarchy tree and time-series queue to organize tasks and participants. The data structures we designed can effectively meet all requirements that are brought due to tasks and participants gathering online. In addition, based on the designed data structures, we study online large-scale heterogeneous task allocation problem from three aspects: the computing pattern, the tree creation method, and the extension of matching strategy. Our best method (TsPY) is based on parallel computing in the computing pattern, adopts time first and then space in the tree creation method, and increases the short-distance first strategy in the matching strategy. Finally, we conducted detailed experiments under the conditions of different participant geographical distributions (i.e., uniform distribution, Gaussian distribution, and check-in empirical distribution), different sensing methods (i.e., participatory sensing and opportunistic sensing), and different recommendation methods (i.e., point recommendation and trajectory recommendation). The experimental results show that TsPY has a good performance in multiple indicators such as algorithm running time, task-participant matching rate, participant travel distance, and redundant tasks removed. Compared with serial computing, parallel computing can reduce the algorithm running time by more than 66% on average in our experimental environment. Compared with space first and then time, creating a tree based on time first and then space can increase task-participant matching rate by more than 13% on average. Increasing the short-distance first strategy can reduce the participant travel distance by more than 4% on average.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
Yy123发布了新的文献求助10
8秒前
龙06应助shinn采纳,获得10
13秒前
1111完成签到 ,获得积分10
13秒前
好久不见完成签到 ,获得积分10
19秒前
HS发布了新的文献求助10
22秒前
24秒前
25秒前
科研通AI5应助DD采纳,获得10
26秒前
搞怪的音响完成签到,获得积分10
26秒前
26秒前
看不了一点文献应助shinn采纳,获得10
27秒前
tmrrr发布了新的文献求助10
28秒前
孤独的根号3完成签到,获得积分10
29秒前
思源应助HS采纳,获得10
31秒前
35秒前
38秒前
卢建军应助科研通管家采纳,获得10
38秒前
科研通AI5应助科研通管家采纳,获得10
38秒前
CodeCraft应助科研通管家采纳,获得10
38秒前
38秒前
38秒前
38秒前
39秒前
无辜的惜寒完成签到 ,获得积分10
39秒前
41秒前
看不了一点文献应助shinn采纳,获得10
43秒前
43秒前
rynchee完成签到 ,获得积分0
44秒前
44秒前
45秒前
李咏贤发布了新的文献求助10
46秒前
我是老大应助球球采纳,获得10
47秒前
依惜发布了新的文献求助10
48秒前
cc发布了新的文献求助30
49秒前
Andy完成签到,获得积分10
50秒前
阿乌大王完成签到,获得积分10
54秒前
chen完成签到,获得积分10
54秒前
隐形曼青应助萤照夜清采纳,获得10
57秒前
慕玖淇完成签到 ,获得积分10
58秒前
高分求助中
Picture Books with Same-sex Parented Families: Unintentional Censorship 1000
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 310
宽量程高线性度柔性压力传感器的逆向设计 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3980612
求助须知:如何正确求助?哪些是违规求助? 3524500
关于积分的说明 11221687
捐赠科研通 3261917
什么是DOI,文献DOI怎么找? 1800975
邀请新用户注册赠送积分活动 879568
科研通“疑难数据库(出版商)”最低求助积分说明 807320