首页> 外文期刊>Computer Communications >A stability-based group recruitment system for continuous mobile crowd sensing
【24h】

A stability-based group recruitment system for continuous mobile crowd sensing

机译:基于稳定度的团体招募系统,用于连续移动人群感知

获取原文
获取原文并翻译 | 示例
           

摘要

With the proliferation of Mobile Crowd Sensing (MCS), many domain applications that answer different sensing requests, have been benefiting from the availability of participants in areas of interest (AoI). These requests have been commonly classified as one time sensing or continuous sensing requests. In the former, one-time reading from the devices of the recruited participants is needed to answer the request, while in the latter, readings are needed over a given time interval, making recruitment challenging, particularly when considering participants' mobility. Ideally, the process of recruiting participants for a given continuous sensing task should determine the best set of participants to answer the sensing requests, while satisfying two important constraints including (1) a given level of quality of information (QoI) and 2) within a given budget. This selection is also sensitive to parameters such as requirements of the sensing task with regards to the AoI coverage, and participants' mobility and distribution. To address this challenge, we propose a novel, stability-based group recruitment system for continuous sensing (Stable-GRS) that employs a genetic algorithm to select groups of participants considering their mobility patterns. The proposed system selects the most stable group of participants in the AoI that can achieve a certain level of QoI, where stability reflects the group's temporal and spatial availability. The process of recruitment is dynamic; it involves adding and removing participants throughout the sensing period to preserve the QoI requirement. Cooperative game theory, specifically the Shapley value, is used to reward selected workers based on their respective contribution. Simulations are conducted using real-life datasets and the results establish that our approach outperforms an individual-based recruitment system (IRS), which employs greedy algorithms to recruit participants for all key performance metrics, such as the QoI and costs.
机译:随着移动人群感应(MCS)的激增,响应不同感应请求的许多域应用程序已从感兴趣区域(AoI)的参与者的可用性中受益。这些请求通常被分类为一次感测或连续感测请求。在前者中,需要从被招募参与者的设备中一次性读取信息以回答请求,而在后者中,需要在给定的时间间隔内进行读数,这使得招募具有挑战性,特别是在考虑参与者的流动性时。理想情况下,针对给定的连续感测任务招募参与者的过程应确定回答感应请求的最佳参与者集,同时满足两个重要的约束条件,包括(1)给定水平的信息质量(QoI)和2)。给定预算。此选择还对参数敏感,例如有关AoI覆盖范围的传感任务要求以及参与者的移动性和分布。为了解决这一挑战,我们提出了一种新颖的,基于稳定性的连续感测小组招募系统(Stable-GRS),该系统采用遗传算法来选择考虑其活动性模式的参与者组。拟议的系统在AoI中选择最稳定的参与者组,可以实现一定水平的QoI,其中稳定性反映了该组的时间和空间可用性。招聘过程是动态的;它涉及在整个感测期间添加和删除参与者,以保持QoI要求。合作博弈理论(特别是Shapley值)用于根据选定的工人各自的贡献来奖励他们。使用真实的数据集进行仿真,结果表明我们的方法优于基于个人的招聘系统(IRS),后者采用贪婪算法为所有关键绩效指标(例如QoI和成本)招聘参与者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号