Enhancing Task Assignment in Crowdsensing Systems Based on Sensing Intervals and Location
作者机构：Faculty of Computers and InformationMansoura UniversityMansoura35516Egypt Faculty of Computers and Artificial IntelligenceBenha UniversityBanha13518Egypt Faculty of Computer Science and EngineeringGalala UniversitySuez435611Egypt College of Computer and Information SystemsUmm Al-Qura UniversityMecca715Saudi Arabia
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2022年第71卷第6期
页 面：5619-5638页
核心收录：
学科分类：0710[理学-生物学] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0836[工学-生物工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Mobile crowdsensing online task assignment participatory sensing path planning sensing time intervals ant colony optimization
摘 要：The popularity of mobile devices with sensors is captivating the attention of researchers to modern techniques,such as the internet of things(IoT)and mobile crowdsensing(MCS).The core concept behind MCS is to use the power of mobile sensors to accomplish a difficult task collaboratively,with each mobile user completing much simpler *** paper discusses the task assignment problem in mobile crowdsensing,which is dependent on sensing time and path planning with the constraints of participant travel distance budgets and sensing time *** goal is to minimize aggregate sensing time for mobile users,which reduces energy consumption to encourage more participants to engage in sensing activities and maximize total task *** paper introduces a two-phase task assignment framework called location time-based algorithm(LTBA).LTBA is a framework that enhances task assignment in MCS,whereas assigning tasks requires overlapping time intervals between tasks and mobile users’tasks and the location of tasks and mobile users’*** process of assigning the nearest task to the mobile user’s current path depends on the ant colony optimization algorithm(ACO)and Euclidean *** combines two algorithms:(1)greedy online allocation algorithm and(2)bio-inspired traveldistance-balance-based algorithm(B-DBA).The greedy algorithm was sensing time interval-based and worked on reducing the overall sensing time of the mobile user.B-DBA was location-based and worked on maximizing total task *** results demonstrate that the average task quality is 0.8158,0.7093,and 0.7733 for LTBA,B-DBA,and greedy,*** sensing time was reduced to 644,1782,and 685 time units for LTBA,B-DBA,and greedy,*** the algorithms improves task assignment in MCS for both total task quality and sensing *** results demonstrate that combining the two algorithms in LTBA is the best performance for total task quality and total sensing time,and the greed
维普期刊数据库