为移动人群感知的时间敏感任务分配提供负载平衡

IF 4.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Network and Systems Management Pub Date : 2023-12-07 DOI:10.1007/s10922-023-09783-8
Moirangthem Goldie Meitei, Ningrinla Marchang
{"title":"为移动人群感知的时间敏感任务分配提供负载平衡","authors":"Moirangthem Goldie Meitei, Ningrinla Marchang","doi":"10.1007/s10922-023-09783-8","DOIUrl":null,"url":null,"abstract":"<p>Task allocation is the mechanism which enables the allotment of sensing tasks to participating users in a mobile crowdsensing (MCS) environment. Task allocation plays a vital role in the management of resources in crowdsensed networks which deploy mobile participants or devices. While conventional task allocation techniques focus on maximizing profit for either the platform or the user, our proposed task allocation scheme, called Load Balanced Task Allocation (LBTA) is geared towards user-oriented task allocation in order to mainly address altruistic MCS campaigns in which participants voluntarily contribute towards a common goal such as in citizen science-based projects. This paper deals with the problem of task allocation using a load balanced approach while trying to maximize the allocation of tasks at the same time. For this, we propose and formulate the LBTA algorithm, which is an extension of a greedy algorithm. The proposed LBTA algorithm has been compared with a known algorithm and their relative performances have been analysed. Simulation results demonstrate that the proposed algorithm performs better than the baseline algorithm for time-dependent MCS systems that operate without a budget constraint, and comparatively better up to a certain budget for those systems with budgeting limitations.</p>","PeriodicalId":50119,"journal":{"name":"Journal of Network and Systems Management","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Provisioning Load Balancing in Time-Sensitive Task Allocation for Mobile Crowdsensing\",\"authors\":\"Moirangthem Goldie Meitei, Ningrinla Marchang\",\"doi\":\"10.1007/s10922-023-09783-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Task allocation is the mechanism which enables the allotment of sensing tasks to participating users in a mobile crowdsensing (MCS) environment. Task allocation plays a vital role in the management of resources in crowdsensed networks which deploy mobile participants or devices. While conventional task allocation techniques focus on maximizing profit for either the platform or the user, our proposed task allocation scheme, called Load Balanced Task Allocation (LBTA) is geared towards user-oriented task allocation in order to mainly address altruistic MCS campaigns in which participants voluntarily contribute towards a common goal such as in citizen science-based projects. This paper deals with the problem of task allocation using a load balanced approach while trying to maximize the allocation of tasks at the same time. For this, we propose and formulate the LBTA algorithm, which is an extension of a greedy algorithm. The proposed LBTA algorithm has been compared with a known algorithm and their relative performances have been analysed. Simulation results demonstrate that the proposed algorithm performs better than the baseline algorithm for time-dependent MCS systems that operate without a budget constraint, and comparatively better up to a certain budget for those systems with budgeting limitations.</p>\",\"PeriodicalId\":50119,\"journal\":{\"name\":\"Journal of Network and Systems Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2023-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Systems Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10922-023-09783-8\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Systems Management","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10922-023-09783-8","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

任务分配是一种机制,可将感知任务分配给移动众感应(MCS)环境中的参与用户。在部署了移动参与者或设备的众感应网络中,任务分配在资源管理方面起着至关重要的作用。传统的任务分配技术侧重于平台或用户的利益最大化,而我们提出的任务分配方案,即负载平衡任务分配(LBTA),则是面向用户的任务分配,主要针对利他主义的 MCS 活动,在这些活动中,参与者自愿为一个共同目标做出贡献,如基于公民科学的项目。本文采用负载平衡方法处理任务分配问题,同时试图最大限度地分配任务。为此,我们提出并制定了 LBTA 算法,这是一种贪婪算法的扩展。我们将提出的 LBTA 算法与已知算法进行了比较,并分析了它们的相对性能。仿真结果表明,对于无预算限制的随时间变化的 MCS 系统,拟议算法的性能优于基准算法,而对于有预算限制的系统,在一定预算范围内,拟议算法的性能相对更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Provisioning Load Balancing in Time-Sensitive Task Allocation for Mobile Crowdsensing

Task allocation is the mechanism which enables the allotment of sensing tasks to participating users in a mobile crowdsensing (MCS) environment. Task allocation plays a vital role in the management of resources in crowdsensed networks which deploy mobile participants or devices. While conventional task allocation techniques focus on maximizing profit for either the platform or the user, our proposed task allocation scheme, called Load Balanced Task Allocation (LBTA) is geared towards user-oriented task allocation in order to mainly address altruistic MCS campaigns in which participants voluntarily contribute towards a common goal such as in citizen science-based projects. This paper deals with the problem of task allocation using a load balanced approach while trying to maximize the allocation of tasks at the same time. For this, we propose and formulate the LBTA algorithm, which is an extension of a greedy algorithm. The proposed LBTA algorithm has been compared with a known algorithm and their relative performances have been analysed. Simulation results demonstrate that the proposed algorithm performs better than the baseline algorithm for time-dependent MCS systems that operate without a budget constraint, and comparatively better up to a certain budget for those systems with budgeting limitations.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
65
审稿时长
>12 weeks
期刊介绍: Journal of Network and Systems Management, features peer-reviewed original research, as well as case studies in the fields of network and system management. The journal regularly disseminates significant new information on both the telecommunications and computing aspects of these fields, as well as their evolution and emerging integration. This outstanding quarterly covers architecture, analysis, design, software, standards, and migration issues related to the operation, management, and control of distributed systems and communication networks for voice, data, video, and networked computing.
期刊最新文献
Reinforcement Learning for Real-Time Federated Learning for Resource-Constrained Edge Cluster Availability and Performance Assessment of IoMT Systems: A Stochastic Modeling Approach Attack Detection in IoT Network Using Support Vector Machine and Improved Feature Selection Technique Generative Adversarial Network Models for Anomaly Detection in Software-Defined Networks Decentralized Distance-based Strategy for Detection of Sybil Attackers and Sybil Nodes in VANET
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1