CN114971047A - Mobile crowd sensing-oriented user collaborative optimization method - Google Patents
Mobile crowd sensing-oriented user collaborative optimization method Download PDFInfo
- Publication number
- CN114971047A CN114971047A CN202210626610.7A CN202210626610A CN114971047A CN 114971047 A CN114971047 A CN 114971047A CN 202210626610 A CN202210626610 A CN 202210626610A CN 114971047 A CN114971047 A CN 114971047A
- Authority
- CN
- China
- Prior art keywords
- user
- task
- sensing
- fitness
- users
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 20
- 238000000034 method Methods 0.000 title claims abstract description 18
- 241000287127 Passeridae Species 0.000 claims abstract description 4
- 238000010845 search algorithm Methods 0.000 claims abstract description 4
- 230000008569 process Effects 0.000 abstract description 4
- 238000011160 research Methods 0.000 abstract description 3
- 230000008447 perception Effects 0.000 description 19
- 238000013480 data collection Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 4
- 230000001965 increasing effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000001953 sensory effect Effects 0.000 description 2
- 241000282461 Canis lupus Species 0.000 description 1
- 241000283153 Cetacea Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000000739 chaotic effect Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000007115 recruitment Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000007670 refining Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001502 supplementing effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/101—Collaborative creation, e.g. joint development of products or services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Molecular Biology (AREA)
- General Health & Medical Sciences (AREA)
- Evolutionary Computation (AREA)
- Computational Linguistics (AREA)
- Biophysics (AREA)
- Biomedical Technology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
现有移动群智感知中如何在保证感知质量、降低成本的前提下,快速地将感知任务分配给最优执行用户的任务分配问题是研究的重点。为了解决这一问题,本文提出了一种基于麻雀搜索算法的选择感知用户的CSSA优化方法。该方法首先对感知用户进行建模,提出用户适应度的概念,将用户的基础信息依次归为位置、电量、设备和信誉四个方面,依次计算适应度。其次,依据这些适应度值综合考虑感知用户的优先级,依据用户优先级对用户进行分类,采用智能优化算法模拟用户完成任务的过程,最后选出适合感知任务的最优用户。通过本文提出的算法与其他优化算法在相同环境下的对比实验,结果表明在求解任务分配问题时具有更高的性能。
In the existing mobile crowd sensing, how to quickly assign sensing tasks to optimal executing users on the premise of ensuring sensing quality and reducing costs is the focus of the research. To solve this problem, this paper proposes a choice-aware user CSSA optimization method based on the sparrow search algorithm. The method firstly models the perceived user, and proposes the concept of user fitness. The basic information of the user is classified into four aspects: location, power, equipment and reputation, and the fitness is calculated in turn. Secondly, according to these fitness values, the priority of the perceived user is comprehensively considered, the users are classified according to the user priority, the intelligent optimization algorithm is used to simulate the process of the user completing the task, and finally the optimal user suitable for the perceived task is selected. Through the comparison experiments between the algorithm proposed in this paper and other optimization algorithms in the same environment, the results show that it has higher performance in solving the task assignment problem.
Description
技术领域technical field
本发明属于移动群智感知领域,具体涉及一种基于智能优化算法的用户协同优化方法。The invention belongs to the field of mobile crowd intelligence perception, and in particular relates to a user collaborative optimization method based on an intelligent optimization algorithm.
背景技术Background technique
移动群智感知(Mobile Crowd Sensing,MCS)作为一种新的感知范式,它将人工智能与物联网相结合,利用具有智能设备(包括移动电话、智能汽车、可穿戴设备等)的移动用户来执行任务请求者所请求的传感任务。移动用户固有的移动性使移动群体感知(MCS)成为一个通用平台,可以取代或补充现有的静态感知基础设施。通过这些数据采集使MCS在交通监测、环境现象观察和移动医疗等领域发挥着举足轻重的作用。感知系统由平台、任务发布者和参与者用户组成,任务发布者可以是机器或人员,参与感知任务需要消耗参与者的时间和设备的感知、计算和通信资源。为了刺激用户广泛的参与,一些MCS系统提供奖励以回报用户提交的有价值的传感报告。激励可以有不同的形式,包括金钱,通过游戏获得的娱乐,或系统提供的服务。这些任务预算分配给完成传感任务的参与者,其依据是感知数据所花费的时间或交付的传感报告的质量。因此想要提升感知任务的数据质量和降低任务成本,选择合适的用户是极为重要的前提条件。As a new perception paradigm, Mobile Crowd Sensing (MCS) combines artificial intelligence with the Internet of Things to utilize mobile users with smart devices (including mobile phones, smart cars, wearable devices, etc.) Execute the sensing task requested by the task requester. The inherent mobility of mobile users makes Mobile Crowd Sensing (MCS) a common platform that can replace or complement existing static sensing infrastructure. Through these data collection, MCS plays a pivotal role in the fields of traffic monitoring, environmental phenomenon observation and mobile medical treatment. The perception system is composed of a platform, a task publisher and a participant user. The task publisher can be a machine or a person. Participating in a perception task requires the participant's time and the device's perception, computing and communication resources. To stimulate broad user participation, some MCS systems offer rewards in return for valuable sensory reports submitted by users. Incentives can take different forms, including money, entertainment through games, or services provided by the system. These task budgets are allocated to participants completing sensing tasks based on the time spent sensing data or the quality of the sensing reports delivered. Therefore, in order to improve the data quality of the perception task and reduce the task cost, selecting the appropriate user is an extremely important prerequisite.
移动群智感知系统中通过用户参与任务,利用移动感知设备采集数据上传到平台,从而完成数据的采集。如何合适的用户,对于整个任务完成有着关键的影响。在任务分配过程中,通过分析用户的属性找到用户与任务之间的契合度,可以看作寻找一个在随机环境下满足若干约束条件的最优用户选择方案。以往的方法往往集中在增加用户数量,寻找单用户的最优解,而群智感知的任务需要多个用户完成,如任务需要多种类型的感知数据,单用户往往难以满足任务需求,以往的多用户收集同类型数据会造成成本的增加以及数据冗余的情况。In the mobile crowd sensing system, users participate in tasks and use mobile sensing devices to collect data and upload it to the platform, so as to complete the data collection. The right user has a key impact on the completion of the entire task. In the task assignment process, finding the fit between the user and the task by analyzing the attributes of the user can be regarded as finding an optimal user selection scheme that satisfies several constraints in a random environment. The previous methods often focus on increasing the number of users and finding the optimal solution for a single user, while the task of crowdsensing requires multiple users to complete. Collecting the same type of data by multiple users can lead to increased costs and data redundancy.
任务分配是MCS的主要的一个研究方向,通过移动用户收集感知数据,获得感知结果从而完成任务。一般来说,影响任务质量的因素很多,包括数据采集量、任务持续时间和任务时空覆盖。收集的传感数据越多,通常意味着任务质量越高;合适的任务时空覆盖通常也意味着更高的任务质量。影响任务成本的因素也很多,包括用户招聘成本、用户移动成本以及数据传输成本。为了提高感知数据质量和减少任务激励预算,可以通过分析用户与任务之间的匹配程度,分析用户的适应值,从而对用户进行任务分配。Task allocation is one of the main research directions of MCS, which collects perception data from mobile users and obtains perception results to complete tasks. In general, there are many factors that affect the quality of tasks, including the amount of data collection, task duration, and task spatiotemporal coverage. More sensory data collected generally means higher mission quality; suitable mission spatiotemporal coverage also generally means higher mission quality. There are also many factors that affect the cost of tasks, including user recruitment costs, user mobility costs, and data transfer costs. In order to improve the quality of perceived data and reduce the task incentive budget, tasks can be allocated to users by analyzing the matching degree between users and tasks, and analyzing the user's fitness value.
近些年来,随着SI(swarm intelligence)优化算法得到了迅速发展,越来越多性能优越的智能优化算法被提出,如灰狼优化(GWO)算法、鲸鱼优化算法(WOA)、引力搜索算法(GSA)等。目前逐渐成为解决群智感知中任务分配问题的另一个主要方法,已经有不少将SI优化算法与群智感知的任务分配结合的方法。In recent years, with the rapid development of SI (swarm intelligence) optimization algorithms, more and more intelligent optimization algorithms with superior performance have been proposed, such as gray wolf optimization (GWO) algorithm, whale optimization algorithm (WOA), and gravity search algorithm. (GSA) et al. At present, it has gradually become another main method to solve the task assignment problem in crowdsensing, and there are already many methods that combine SI optimization algorithm with the task assignment of crowdsensing.
发明内容SUMMARY OF THE INVENTION
多用户之间协同合作对于提升感知性能还有很大的研究空间,本文结合智能优化算法中性能优异的麻雀搜索算法,提出一种新的框架CSSA(Crowd sensing SparrowSearch Algorithm)用于进行感知任务的用户选择,提升感知数据质量和分配效率。如图1所示,通过协同多个用户,分别利用自身的感知设备收集数据进行汇总,能够进一步提高收集的感知数据质量。There is still a lot of research space for multi-user collaboration to improve sensing performance. In this paper, combined with the excellent performance of the sparrow search algorithm in the intelligent optimization algorithm, a new framework CSSA (Crowd sensing SparrowSearch Algorithm) is proposed for sensing tasks. User selection to improve perceived data quality and distribution efficiency. As shown in Figure 1, by cooperating with multiple users and using their own sensing devices to collect data for aggregation, the quality of the collected sensing data can be further improved.
本文提出了一种用户选择框架,该框架综合考虑了用户的多种属性对于任务感知数据质量的影响,以及多用户之间的协同合作问题。本策略的目标是在保证任务成本的情况下提升感知数据质量,同时也考虑用户选择的时间,本文将影响因素主要归结于以下几个方面:用户与任务之间的距离关系;用户设备传感器种类与任务的契合程度;用户设备的运行情况;用户的信誉。This paper proposes a user selection framework, which comprehensively considers the impact of multiple user attributes on task-aware data quality, as well as the collaborative cooperation between multiple users. The goal of this strategy is to improve the quality of perceptual data while ensuring the task cost, and also consider the time selected by the user. In this paper, the influencing factors are mainly attributed to the following aspects: the distance relationship between the user and the task; the types of user equipment sensors Fit to the task; how well the user's device is performing; the user's reputation.
由于需要解决问题复杂度较高,因此对上述影响因素提出适应度概念,通过适应度值作为衡量用户优先级和匹配程度的参考。而所需获取的数据信息分为通过定位获取到的用户位置信息、通过用户设备状态上传的设备剩余电量以及设备传感器种类信息、平台则依据用户的历史任务完成数据记录对当前用于的信誉值进行估算,从而完成对任务数据质量的把控,分析用户是否适合完成当前任务,这些适应度值作为智能优化算法的重要参考标准,如图2所示。Due to the high complexity of the problem to be solved, the concept of fitness is proposed for the above influencing factors, and the fitness value is used as a reference to measure user priority and matching degree. The data information to be obtained is divided into the user location information obtained through positioning, the remaining battery power of the device uploaded through the user device status, and the device sensor type information. Estimate, so as to complete the control of task data quality, and analyze whether the user is suitable for completing the current task. These fitness values are used as an important reference standard for intelligent optimization algorithms, as shown in Figure 2.
移动群智感知平台有许多感知用户组成,U表示在任务发布时系统中可参与的用户集合,F=(f1, f2, f3,…, fn)表示当前所有用户对该任务的适应度值,对此值大小排序,用户集合为。U=(u1, u2, u3,…, un)按比例将用户划分为探索者和追随者,分别依据不同的职责进行任务感知,最后依据智能优化算法筛选出合适的感知用户。The mobile crowdsensing platform is composed of many sensing users, U represents the set of users who can participate in the system when the task is released, and F=(f 1 , f 2 , f 3 ,..., f n ) represents the current participation of all users on the task The fitness value, sorted by the size of this value, the user set is . U=(u 1 , u 2 , u 3 ,…, u n ) divides users into explorers and followers in proportion, and performs task perception according to different responsibilities, and finally selects suitable perception users according to the intelligent optimization algorithm.
同时为了提升用户选择效率和数据质量,本文采用参与者协作的方式完成任务。分析当前任务所需要感知的数据类型,依据用户的传感器不同让用户分别负责其可提供的信息种类,然后平台结合多用户上传的内容进行总结分析完成感知数据的采集。该算法利用了群体之间相互协作的特征,这一特点利于群智感知中参与者用户群体合作完成感知任务,同时对感知用户的位置、设备等多属性与用户的匹配程度进行综合分析。在群智感知中,通过分析多影响因素以及用户之间的协作配合的用户选择策略可以提高感知数据质量和任务分配时间,对于群智感知平台的性能有重大提升。At the same time, in order to improve the efficiency of user selection and data quality, this paper adopts the way of participant collaboration to complete the task. Analyze the type of data that needs to be sensed for the current task, and let the user be responsible for the types of information they can provide according to the user's sensor, and then the platform combines the content uploaded by multiple users to summarize and analyze to complete the collection of sensing data. The algorithm makes use of the characteristics of mutual cooperation between groups, which is conducive to the cooperation of participant user groups in crowd sensing to complete the sensing task, and at the same time, comprehensively analyzes the matching degree of the perceived user's location, equipment and other attributes with the user. In crowdsensing, the user selection strategy based on the analysis of multiple influencing factors and the cooperation between users can improve the quality of perception data and task allocation time, which greatly improves the performance of the crowdsensing platform.
附图说明Description of drawings
图1为用户协作的提升示意图。FIG. 1 is a schematic diagram of enhancing user collaboration.
图2为本发明的整体流程图。FIG. 2 is an overall flow chart of the present invention.
图3为传感器种类覆盖关系图。FIG. 3 is a diagram showing the relationship between sensor types and coverage.
具体实施方式Detailed ways
位置适应度,通过计算任务与用户之间的位置关系是否匹配,当用户距离任务较远时,用户所需要移动的距离就会增加,从而提升了任务完成时间和更高的任务花费成本。针对该情况,本文引入了位置适应度这一概念,比较用户与任务之间的距离作为衡量适应度的指标。计算公式如下:locFiti=(dmax-di)/ dmax(di≤dmax) 其中di为用户和任务之间的距离,采用欧式距离进行计算。当用户的原有路径途径任务感知区域时,随着与任务之间的不断接近,用户与任务之间的位置适应度就会不断提升,该用户想要执行此任务的意向也就越来越大,因此用户可能会主动提升速度,降低移动时间,从而降低了任务的完成速度,提升整体效率。Location fitness, by calculating whether the location relationship between the task and the user matches, when the user is far away from the task, the distance the user needs to move will increase, thereby increasing the task completion time and higher task cost. In view of this situation, this paper introduces the concept of location fitness, and compares the distance between the user and the task as an indicator to measure the fitness. The calculation formula is as follows: locFit i =(d max -d i )/ d max (d i ≤d max ) where d i is the distance between the user and the task, and the Euclidean distance is used for calculation. When the user's original path passes through the task-aware area, as the user gets closer to the task, the positional fitness between the user and the task will continue to improve, and the user's intention to perform the task will become more and more Therefore, the user may actively increase the speed and reduce the movement time, thereby reducing the completion speed of the task and improving the overall efficiency.
电量适应度,作为移动设备剩余电量的考量,因为在完成任务的过程中需要不断利用传感器感知数据,并通过通信网络上传实时向平台传输感知数据,这个过程需要不断消耗移动设备的电量。因此,电量适应度也是一个很重要的考量参数,决定着移动设备是否有能力完成感知数据采集,当电量较低时,用户也很可能没有意愿参与任务。电量适应度的计算依照电量剩余百分比表示为[0,1]内的数据进行规范表示,公式如下:eltFiti=CEi/Ei。Power fitness is a consideration for the remaining power of the mobile device, because in the process of completing the task, it is necessary to continuously use the sensor to sense data, and upload the sensed data to the platform in real time through the communication network. This process needs to continuously consume the power of the mobile device. Therefore, the battery fitness is also an important consideration parameter, which determines whether the mobile device has the ability to complete the sensing data collection. When the battery is low, the user is likely not willing to participate in the task. The calculation of the power fitness is standardized according to the data in [0,1] expressed as the remaining power percentage, and the formula is as follows: eltFit i =CE i /E i .
设备适应度,根据任务需要感知的数据类别不同,对感知用户设备的需求也不尽相同,因此需要对候选参与者的感知设备上所需传感器的可用性进行考量,这会显著影响数据的可靠性和传感结果质量。为了量化匹配程度,用设备适应度来表示用户与任务之间的硬件能力匹配程度,依次将任务分配给最佳用户,不但能减少任务所需的成本,也能提高数据质量,设备信息和感知内容的匹配程度如图3所示。其中,SameSeni=UserSeni∩TaskSen为传感器重合集,表示用户设备传感器种类集和任务感知内容集重合的部分。其中有部分为不可缺少的传感器,其他的非关键种类则是重合度越改越好,因此传感器重合度为:equFiti=η1*(Sigi/Sigmax)+η2*(SameSeni/TaskSen),每个感知用户并不需要具备所有的所需感知传感器种类,可以通过多用户之间的协同合作完成多种类感知数据的采集。Equipment fitness, depending on the types of data that the task needs to perceive, the requirements for sensing user equipment are also different. Therefore, it is necessary to consider the availability of sensors required on the sensing equipment of candidate participants, which will significantly affect the reliability of the data. and quality of sensing results. In order to quantify the matching degree, device fitness is used to represent the matching degree of hardware capabilities between users and tasks, and tasks are assigned to the best users in turn, which can not only reduce the cost of tasks, but also improve data quality, device information and perception. The degree of content matching is shown in Figure 3. Among them, SameSen i =UserSen i ∩TaskSen is the sensor overlap set, which represents the overlapped part of the user equipment sensor type set and the task-aware content set. Some of them are indispensable sensors, and other non-critical types are the better the degree of coincidence, so the degree of sensor coincidence is: equFit i =η 1 *(Sig i /Sig max )+η 2 *(SameSen i / TaskSen), each sensing user does not need to have all the required sensing sensor types, and the collection of various types of sensing data can be completed through the cooperation among multiple users.
信誉适应度,因此根据用户之前参与感知任务的情况,对其声誉进行评估。评估标准包括他们是否致力于完成分配给他们的任务,以及他们成功完成这些任务的能力。下述公式分别用于评估每个参与者的声誉参数:CTi=Spti/Cti,SCTi=Scti/Fti。Spti其中代表用户参加的任务合集,Cti代表用户被选择的任务合集,Scti代表用户成功完成的一组任务,Fti代表用户完成的任务集合。由于这两个参数以相对的方式变化,它们的集合平均值被用来给定参与者的总体声誉。因此每个用户的个体信誉适应度计算公式如下:repFiti=sqrt(CTi*SCTi)。Reputation fitness, so the user's reputation is evaluated based on their previous participation in the perception task. Evaluation criteria include their commitment to completing the tasks assigned to them and their ability to successfully complete those tasks. The following formulas were used to evaluate the reputation parameters of each participant respectively: CT i =Spt i /Ct i , SCT i =Sct i /Ft i . Among them, Spt i represents the set of tasks that the user participated in, Ct i represents the set of tasks selected by the user, Sct i represents a set of tasks successfully completed by the user, and Ft i represents the set of tasks completed by the user. Since these two parameters vary in a relative manner, their collective mean is used to give a participant's overall reputation. Therefore, the calculation formula of the individual reputation fitness of each user is as follows: repFit i =sqrt(CT i *SCT i ).
当感知任务发布时,有参加任务意愿的感知用户上报平台,参与者集合为U=(u1,u2, u3,…, un),平台首先根据用户属性、历史数据通过公式Fi=locFiti+eltFiti+equFiti+repFiti计算每个用户的适应度值Fi。初始化所有用户在优化算法中的位置,为了提升算法的全局搜索能力,避免迭代后期种群多样性降低,因此采用混沌映射的方法代替随机数生成,使得位置更具有随机性和规律性,其公式如下:ui+1=ui*μ*(1-ui),μ∈[3.5,4],ui∈(0,1),将n名参与者在d维度下的位置采用矩阵记录,同时分别计算出对应的适应度值。When the sensing task is released, the sensing users who have the willingness to participate in the task report to the platform. The set of participants is U=(u 1 , u 2 , u 3 ,…, u n ). The platform first uses the formula F i according to user attributes and historical data. =locFit i +eltFit i +equFit i +repFit i to calculate the fitness value F i of each user. Initialize the positions of all users in the optimization algorithm. In order to improve the global search ability of the algorithm and avoid the reduction of population diversity in the later iteration, the method of chaotic mapping is used instead of random number generation to make the positions more random and regular. The formula is as follows : u i+1 =u i *μ*(1-u i ), μ∈[3.5,4], u i∈(0,1), the positions of n participants in the d dimension are recorded by a matrix, At the same time, the corresponding fitness values are calculated respectively.
通过适应度值Fi将用户进行排序,通过设定值Pr对用户划分为探索者和追随者两种不同的身份。通过数组ID[n]记录当前用户的身份,0代表追随者,1代表探索者。其中探索者由于拥有高的任务适应度,因此负责主要的感知数据采集,作为感知任务的主要完成者;而追随者与探索者身份相对应,由于适应度较低,跟随探索者进行数据采集,负责补充数据和完善感知数据类型。如:当Pr的值设定为0.2时,则探索者和追随者的比例为2:8。其中,探索者的位置更新如下:当Pn<CT时,Ui,j t+1= Ui,j t*exp(-i/α*itermax);当Pn≥CT时,Ui,j t+1=Ui,j t+Q·L。其中,t代表当前迭代次数,j=1,2,,d,表示当前所在的维度,Ui,j t表示第i名感知用户在迭代t时的第j维的位置,itermax是迭代次数最多的常数。α∈(0,1)是一个随机数,Pn(Pn∈[0,1])和CT(CT∈[0.5,1.0])分别代表着子区域的任务完成度和子区域的完成阈值。Q是一个服从正态分布的随机数,I是一个1*d维的矩阵,其中每一个元素都为1。当Pn<CT时,意味着当前的区域任务完成人数未达到阈值,当前搜索者可以继续在子区域内完成任务;当 Pn≥CT 时,意味着当前区域参与者数量满足任务完成的要求,所有探索者需要到其他子区域完成感知任务。Users are sorted by fitness value Fi, and users are divided into two different identities, explorer and follower, by setting value Pr. Record the identity of the current user through the array ID[n], 0 for followers and 1 for explorers. Among them, the explorer has a high task fitness, so he is responsible for the main perception data collection, as the main completer of the perception task; while the follower corresponds to the explorer's identity, due to the low fitness, follow the explorer to collect data, Responsible for supplementing data and refining perception data types. For example, when the value of Pr is set to 0.2, the ratio of explorers and followers is 2:8. Among them, the position of the explorer is updated as follows: when Pn<CT, U i,j t+1 = U i,j t *exp(-i/α*iter max ); when Pn≥CT, U i,j t+1 =U i,j t +Q·L. Among them, t represents the current iteration number, j=1,2, ,d, represents the current dimension, U i,j t represents the position of the i-th perception user in the j-th dimension during iteration t, and iter max is the constant with the most iterations. α∈(0,1) is a random number, and Pn (Pn∈[0,1]) and CT (CT∈[0.5,1.0]) represent the task completion degree of the sub-region and the completion threshold of the sub-region, respectively. Q is a random number that obeys a normal distribution, and I is a 1*d-dimensional matrix, where each element is 1. When Pn<CT, it means that the number of completed tasks in the current region has not reached the threshold, and the current searcher can continue to complete tasks in the sub-region; when Pn≥CT, it means that the number of participants in the current region meets the requirements for task completion, all Explorers need to go to other sub-areas to complete perception tasks.
至于追随者,跟随者探索者在其附近移动,辅助完成任务,当发现当前探索者的适应度值低于自己时,发生竞争关系,二者的身份会发生转变,当前用户ID[i]的值也会取反,当i>n/2时,位置Ui,j t+1=Q*exp((Uworst t-Ui,j t)/i2);当i≤n/2时,Ui,j t+1= Up t+1+|Ui,j t- Up t+1|*A+*L。其中,Up探索者占据的最佳位置,Uworst表示当前全局最差的位置。A代表一个1*d维的矩阵,其中每个元素随机分配值为1或-1,并且A+=AT(AAT)-1。当适应度值合适时,在当前探索者所在位置附近移动;当i>n/2 时,这表示该追随者在当前感知用户队列中有着很低的适应度值,无法完成当前任务,继而寻找其他区域的感知任务。As for the follower, the follower explorer moves around to assist in completing the task. When the current explorer's fitness value is found to be lower than his own, a competition relationship occurs, and the identities of the two will change. The current user ID[i]'s The value will also be inverted, when i>n/2, the position U i,j t+1 =Q*exp((U worst t -U i,j t )/i 2 ); when i≤n/2 , U i,j t+1 = U p t+1 +|U i,j t - U p t+1 |*A + *L. Among them, U p is the best position occupied by the explorer, and U worst represents the current global worst position. A represents a 1*d dimensional matrix where each element is randomly assigned a value of 1 or -1, and A + =A T (AA T ) -1 . When the fitness value is appropriate, move near the current explorer's location; when i>n/2, it means that the follower has a very low fitness value in the current perceived user queue and cannot complete the current task, and then searches for Perception tasks in other regions.
另外在所有任务参与者中选取一部分作为监视者,他们在人群中随机产生,负责防止用户集中在最优感知位置,陷入局部最优,选取10%~20%的感知用户作为监视者,当fi≠fg时,Ui,j t+1= Up t+1+β*(Uworst t- Ubest t); 当fi=fg时,Ui,j t+1= Up t+1+β*(Ui,j t- Ubest t)。其中Ubest,和Uworst分别代表当前的全局最优位置和最差位置,β作为步长控制参数,是服从均值为0方差为1的正态分布随机数,fi是当前麻雀个体的适应度值,fg是当前全局最佳适应度值。为了防止陷入局部最优,如果该用户处于最优位置,则逃离到最优位置与最差位置之间的随机位置,否则逃离到自己与随机位置之间的随机位置。In addition, some of the task participants are selected as monitors. They are randomly generated in the crowd and are responsible for preventing users from concentrating on the optimal sensing position and falling into a local optimum. 10%~20% of the sensing users are selected as monitors. When f When i ≠f g , U i,j t+1 = U p t+1 +β*(U worst t - U best t ); when f i =f g , U i,j t+1 = U p t+1 +β*(U i,j t - U best t ). Among them, U best , and U worst represent the current global optimal position and the worst position, respectively. β is used as a step size control parameter, which is a normal distribution random number that obeys the mean value of 0 and the variance of 1. f i is the adaptation of the current sparrow individual. degree value, f g is the current global best fitness value. In order to prevent falling into the local optimum, if the user is in the optimum position, it escapes to a random position between the optimum position and the worst position, otherwise it escapes to a random position between itself and the random position.
基于上述用户选择模型,在考虑数据质量、任务成本、分配时间的前提下,本文的用户选择问题可定义为:F=max∑i=1 k[(equFiti+eltFiti)*repFiti],满足min∑i=1 k(di)、∑i=1 kMi=IBased on the above user selection model, under the premise of considering data quality, task cost and allocation time, the user selection problem in this paper can be defined as: F=max∑ i=1 k [(equFit i +eltFit i )*repFit i ], Satisfy min∑ i=1 k (d i ), ∑ i=1 k M i =I
其中,I为1*j的全1矩阵,用于控制所有用户传感器种类之和满足任务所需种类,其中j为任务所需的种类个数,∑i=1 k(di)为所有用户与任务距离的总和,通过最小化总距离,可以减小感知用户完成任务的移动距离,从而减小成本。通过优化算法目的是寻找目标函数的最大值,也就是找到最契合任务需求的用户,进而提升数据质量。Among them, I is an all-one matrix of 1*j, which is used to control the sum of all user sensor types to meet the types required by the task, where j is the number of types required by the task, ∑ i=1 k (d i ) is all users The sum of the distance to the task, by minimizing the total distance, can reduce the perceived user's moving distance to complete the task, thereby reducing the cost. The purpose of optimizing the algorithm is to find the maximum value of the objective function, that is, to find the user that best meets the task requirements, thereby improving the data quality.
上述实施方法为本发明较佳的实施方式,但本发明的实施方式并不受上述方法的限制,其他的任何未背离本发明的精神实质与原理下所作的改变、修饰、替代、组合、简化,均应为等效的置换方式,都包含在本发明的保护范围之内。The above-mentioned implementation method is a preferred embodiment of the present invention, but the implementation of the present invention is not limited by the above-mentioned method, and any other changes, modifications, substitutions, combinations, and simplifications made without departing from the spirit and principle of the present invention , all should be equivalent replacement modes, and all are included in the protection scope of the present invention.
Claims (3)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210626610.7A CN114971047A (en) | 2022-06-04 | 2022-06-04 | Mobile crowd sensing-oriented user collaborative optimization method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210626610.7A CN114971047A (en) | 2022-06-04 | 2022-06-04 | Mobile crowd sensing-oriented user collaborative optimization method |
Publications (1)
Publication Number | Publication Date |
---|---|
CN114971047A true CN114971047A (en) | 2022-08-30 |
Family
ID=82960083
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210626610.7A Pending CN114971047A (en) | 2022-06-04 | 2022-06-04 | Mobile crowd sensing-oriented user collaborative optimization method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114971047A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115865476A (en) * | 2022-11-29 | 2023-03-28 | 中南大学 | A Believable Data Awareness Method Based on Participant Reliability and Task Matching |
CN119441907A (en) * | 2025-01-13 | 2025-02-14 | 长春理工大学 | A matching method that considers both task and participant preferences |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110210903A (en) * | 2019-05-31 | 2019-09-06 | 南京邮电大学 | A kind of intelligent perception motivational techniques based on user location and credit worthiness |
CN111432361A (en) * | 2020-03-19 | 2020-07-17 | 长春理工大学 | A method and system for determining user incentive strategy based on crowd-sensing network |
CN113344464A (en) * | 2021-07-12 | 2021-09-03 | 哈尔滨理工大学 | Task and user potential relation mining method facing mobile crowd sensing system |
CN113516229A (en) * | 2021-07-09 | 2021-10-19 | 哈尔滨理工大学 | Credible user optimization selection method facing crowd sensing system |
WO2021213293A1 (en) * | 2020-04-24 | 2021-10-28 | 西北工业大学 | Ubiquitous operating system oriented toward group intelligence perception |
CN114501470A (en) * | 2022-01-11 | 2022-05-13 | 南京邮电大学 | A swarm intelligence spectrum monitoring method based on two-stage user selection |
-
2022
- 2022-06-04 CN CN202210626610.7A patent/CN114971047A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110210903A (en) * | 2019-05-31 | 2019-09-06 | 南京邮电大学 | A kind of intelligent perception motivational techniques based on user location and credit worthiness |
CN111432361A (en) * | 2020-03-19 | 2020-07-17 | 长春理工大学 | A method and system for determining user incentive strategy based on crowd-sensing network |
WO2021213293A1 (en) * | 2020-04-24 | 2021-10-28 | 西北工业大学 | Ubiquitous operating system oriented toward group intelligence perception |
CN113516229A (en) * | 2021-07-09 | 2021-10-19 | 哈尔滨理工大学 | Credible user optimization selection method facing crowd sensing system |
CN113344464A (en) * | 2021-07-12 | 2021-09-03 | 哈尔滨理工大学 | Task and user potential relation mining method facing mobile crowd sensing system |
CN114501470A (en) * | 2022-01-11 | 2022-05-13 | 南京邮电大学 | A swarm intelligence spectrum monitoring method based on two-stage user selection |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115865476A (en) * | 2022-11-29 | 2023-03-28 | 中南大学 | A Believable Data Awareness Method Based on Participant Reliability and Task Matching |
CN115865476B (en) * | 2022-11-29 | 2024-04-16 | 中南大学 | A credible data perception method based on participant reliability and task matching |
CN119441907A (en) * | 2025-01-13 | 2025-02-14 | 长春理工大学 | A matching method that considers both task and participant preferences |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Wolfrath et al. | Haccs: Heterogeneity-aware clustered client selection for accelerated federated learning | |
CN114971047A (en) | Mobile crowd sensing-oriented user collaborative optimization method | |
CN111754000A (en) | Quality-aware edge intelligent federated learning method and system | |
Irtija et al. | Energy efficient edge computing enabled by satisfaction games and approximate computing | |
Kumar et al. | CNN-SSPSO: a hybrid and optimized CNN approach for peripheral blood cell image recognition and classification | |
CN108595267A (en) | A kind of resource regulating method and system based on deeply study | |
Jiang et al. | Federated learning based mobile crowd sensing with unreliable user data | |
CN110120888B (en) | Cloud crowdsourcing platform mass service resource combination optimization method and system | |
Yao et al. | Inherent redundancy in spiking neural networks | |
CN110097190B (en) | Crowd sensing task allocation method based on double time limits | |
CN108776863B (en) | A crowdsensing incentive method based on user base maximization | |
Abed et al. | A hybrid classification algorithm approach for breast cancer diagnosis | |
CN110288075A (en) | A Feature Selection Method Based on Improved Hybrid Leapfrog Algorithm | |
Liu et al. | Multi-strategy brain storm optimization algorithm with dynamic parameters adjustment | |
Gong et al. | Adaptive clustered federated learning for heterogeneous data in edge computing | |
Aoudia et al. | A multi-population genetic algorithm for adaptive QoS-aware service composition in fog-IoT healthcare environment. | |
Pacifico et al. | An evaluation of k-means as a local search operator in hybrid memetic group search optimization for data clustering | |
Wen et al. | A Many-objective Joint Device Selection and Aggregation Scheme for Federated Learning in IoV | |
Reddy et al. | A Beginner's Guide to Federated Learning | |
Islam et al. | FedClust: Tackling Data Heterogeneity in Federated Learning through Weight-Driven Client Clustering | |
Senthilkumar | Energy-aware task scheduling using hybrid firefly-bat (ffabat) in big data | |
CN108596359A (en) | Rehabilitation doctor's advice task assigns optimization method, device and equipment | |
Thakur et al. | Hardware-algorithm co-design of energy efficient federated learning in quantized neural network | |
CN105005501B (en) | A kind of second order optimizing and scheduling task method towards cloud data center | |
Rothman et al. | An RL-Based Model for Optimized Kubernetes Scheduling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
WD01 | Invention patent application deemed withdrawn after publication | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20220830 |