A Multi Task Allocation Based Time Optimization Framework Using Social Networks in Mobile Crowd Sensing

Q3 Engineering
Sasireka Veerapathiran, S. Ramachandran
{"title":"A Multi Task Allocation Based Time Optimization Framework Using Social Networks in Mobile Crowd Sensing","authors":"Sasireka Veerapathiran, S. Ramachandran","doi":"10.18280/i2m.210605","DOIUrl":null,"url":null,"abstract":"The quality of data and its sensing cost is the important concern for task allocation in crowd sensing. The sensing capabilities of a device to send the collection of sensor data to a cloud requires crowd sensing in order to receive reliable data. Crowd sensing is used in many areas such as traffic monitoring, smart cities, health care, transportations, environmental monitoring and many more. Most of existing works are only based on assumptions in task scheduling about the number of candidate users and are mainly performed optimization of single task allocation. If the candidate users are few, then the completion of task with in the schedule can be difficult for many sensor applications. In this work, we proposed a social network-based task allocation scheme for the optimization of multi task allocation. The main idea of the proposed work is to maximize the task completion within the allocated schedule. It is evident that the task scheduling algorithms are NP-hard and we introduced a decreasing threshold task allocation (DTT) and fast greedy selections (FGS) algorithms along with Crow COOT Foraging Optimization (CCFO) algorithm to allocate the tasks parallelly with maximum efficiency. The proposed algorithms such as C-DTT (CCFO-DTT) and C-FGS (CCFO-FGS_ are used for the efficient allocation of tasks. The combination of these algorithms can be helpful in selecting the candidate users who will perform the completion of maximum tasks. Due to the selection of proper users in each round, the time consumption of the tasks to be completed is greatly reduced. The experimental results also indicates that the proposed work performs well in the optimization of multi task allocation than the other state of the art models.","PeriodicalId":38637,"journal":{"name":"Instrumentation Mesure Metrologie","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Instrumentation Mesure Metrologie","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18280/i2m.210605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

The quality of data and its sensing cost is the important concern for task allocation in crowd sensing. The sensing capabilities of a device to send the collection of sensor data to a cloud requires crowd sensing in order to receive reliable data. Crowd sensing is used in many areas such as traffic monitoring, smart cities, health care, transportations, environmental monitoring and many more. Most of existing works are only based on assumptions in task scheduling about the number of candidate users and are mainly performed optimization of single task allocation. If the candidate users are few, then the completion of task with in the schedule can be difficult for many sensor applications. In this work, we proposed a social network-based task allocation scheme for the optimization of multi task allocation. The main idea of the proposed work is to maximize the task completion within the allocated schedule. It is evident that the task scheduling algorithms are NP-hard and we introduced a decreasing threshold task allocation (DTT) and fast greedy selections (FGS) algorithms along with Crow COOT Foraging Optimization (CCFO) algorithm to allocate the tasks parallelly with maximum efficiency. The proposed algorithms such as C-DTT (CCFO-DTT) and C-FGS (CCFO-FGS_ are used for the efficient allocation of tasks. The combination of these algorithms can be helpful in selecting the candidate users who will perform the completion of maximum tasks. Due to the selection of proper users in each round, the time consumption of the tasks to be completed is greatly reduced. The experimental results also indicates that the proposed work performs well in the optimization of multi task allocation than the other state of the art models.
基于社交网络的移动人群感知多任务分配时间优化框架
数据质量及其感知成本是群体感知中任务分配的重要问题。设备将传感器数据集合发送到云的传感能力需要群体传感才能接收可靠的数据。人群传感应用于许多领域,如交通监控、智慧城市、医疗保健、交通、环境监测等。现有的工作大多只是基于任务调度中对候选用户数量的假设,主要是对单个任务的分配进行优化。如果候选用户很少,那么对于许多传感器应用来说,在时间表内完成任务可能会很困难。在这项工作中,我们提出了一种基于社会网络的任务分配方案来优化多任务分配。建议工作的主要思想是在分配的时间表内最大限度地完成任务。由于任务调度算法是np困难的,我们引入了递减阈值任务分配(DTT)和快速贪婪选择(FGS)算法以及Crow COOT觅食优化(CCFO)算法,以最大效率并行分配任务。提出的C-DTT (CCFO-DTT)和C-FGS (CCFO-FGS_)算法用于任务的高效分配。这些算法的组合可以帮助选择将完成最大任务的候选用户。由于每轮都选择了合适的用户,大大减少了要完成任务的时间消耗。实验结果还表明,该方法在多任务分配优化方面优于现有的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Instrumentation Mesure Metrologie
Instrumentation Mesure Metrologie Engineering-Engineering (miscellaneous)
CiteScore
1.70
自引率
0.00%
发文量
25
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信