CN105243501B - Space crowdsourcing network node location method for secret protection - Google Patents
Space crowdsourcing network node location method for secret protection Download PDFInfo
- Publication number
- CN105243501B CN105243501B CN201510676264.3A CN201510676264A CN105243501B CN 105243501 B CN105243501 B CN 105243501B CN 201510676264 A CN201510676264 A CN 201510676264A CN 105243501 B CN105243501 B CN 105243501B
- Authority
- CN
- China
- Prior art keywords
- cluster
- cluster head
- worker
- task
- virtual
- 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.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses a kind of space crowdsourcing network node location method for secret protection, includes the following steps：S1 requestors send demand for services to server；S2 worker executes sub-clustering according to oneself position；S3 cluster heads generate virtual cluster center according to cluster membership location's information；S4 cluster heads randomly choose a cluster member and as factorage person and are sent to virtual cluster center location information；S5 factorage persons report virtual cluster center location information to server；S6 servers select the virtual cluster center nearest from demand for services place, and assign the task to the factorage person corresponding to the virtual cluster center；S7 factorage persons will receive task and be transmitted to cluster head；S8 cluster heads assign the task to the cluster member nearest from demand for services place；The cluster member that S9 receives an assignment executes task and feedback information.Effect is：Principle is simple, and it is convenient to realize, efficiently avoids the leakage of worker's location privacy, algorithm performance is reliable and stable.
Description
Technical field
The present invention relates to network information security technologies, specifically, being a kind of space crowdsourcing network node location privacy guarantor
Maintaining method.
Background technology
Crowdsourcing refers to the task that a company or mechanism are executed the past by employee, by freely it is voluntary in the form of outside
It wraps to the way of unspecific (and being typically large-scale) public network.Although each contributor is only completed a small portion of task
Point, but the result that everybody makes great efforts will produce unexpected achievement.Just because of crowdsourcing, which can be significantly reduced, completes required by task
Cost, and it is more sufficiently effective utilize labour and resource, so being widely used in various activities.
In such applications, often with promising one kind, it is referred to one group of space tasks crowdsourcing space crowdsourcing right and wrong
To the process of a group worker, and so-called space tasks are related to specific position, and worker needs to physically go to these positions
Set execution inter-related task.Classical space crowdsourcing network includes 3 parts：Task requester, worker and a space crowdsourcing
Central server, this server connect registered task requester and the person of working online, then according to certain criterion point
Dispensing worker's space tasks.
In order to complete task, the distance that worker needs to go to the position of required by task, and walked is for a worker
It receives and performs and is necessary Consideration and crucial cost cost for a task.Existing space crowdsourcing is generally divided into
Two kinds of operating modes：Worker selects task (WST) pattern and server to distribute task (SAT) pattern.Under WST patterns, clothes
Task is published on the net by business device after receiving task, their closer tasks of the chosen distance that worker can be autonomous without
Will with server communication and report themselves current location.But this pattern is possible to will produce a kind of drawback, that is, is permitted
Multiplexing author selects to execute identical a task, is stalled without any worker so as to cause some other tasks
The enthusiasm to them is represented, this is because worker is usually more prone to apart from their closer tasks.In SAT patterns
In, worker usually requires to report their position to server, and server will be according to the global information that it is grasped
A matching algorithm is executed to distribute task to suitable worker.This pattern more sufficiently effective can utilize worker
Labour to obtain higher task completion rate, but need worker that their current positions are supplied to server,
However server is not completely credible, so the location privacy of worker is possible to be leaked.If the position of worker is believed
Breath reveals disclosure by server, and attacker probably accesses and be inferred to the sensitive information of worker.For example, in certain journey
On degree, if attacker has grasped the place at the current place of worker and residing time, they can get worker's
Hobby and interest.Attacker can also track the location of worker, when these positions are exactly such as hospital, church etc
When specific position, can the privacies such as its physical condition or religious belief be carried out with some specific deductions.So location privacy
Protection has become a necessary part of space crowdsourcing application, if the location privacy of worker cannot ensure well, he
Also would not gladly go participate in correlation space task.
Invention content
In order to cope with the worry that location privacy is revealed during the crowdsourcing of space, the present invention proposes a kind of space crowdsourcing network
Node location method for secret protection, specific technical solution are as follows：
A kind of space crowdsourcing network node location method for secret protection, key are to include the following steps：
S1：The step of requestor sends demand for services to server；
S2：The step of worker executes sub-clustering according to oneself position；
S3：The step of cluster head generates virtual cluster center according to cluster membership location's information；
S4：Cluster head randomly chooses a cluster member and as factorage person and is sent to virtual cluster center location information
Step；
S5：The step of factorage person reports virtual cluster center location information to server；
S6：Server selects the virtual cluster center nearest from demand for services place, and assigns the task in the virtual cluster
The step of factorage person corresponding to the heart；
S7：Factorage person will receive the step of task is transmitted to cluster head；
S8：Cluster head assigns the task to the step of cluster member nearest from demand for services place；
S9：The cluster member to receive an assignment executes the step of task and feedback information.
Information exchange is carried out based on the above method, after the completion of the registered person's of working online sub-clustering stage, server receives
Be virtual cluster centre coordinate, which is sent out as agency to server by a randomly selected member in a cluster
It send, when a requestor sends a space tasks to server, execution is also the distribution of two-stage space tasks, in first fraction
With in the stage, server is appointed according to the virtual cluster centre coordinate position collected to be chosen as worker's distribution of agency to those
Business, in the allocated phase of the second level, cluster head receives task from factorage person, and according to the accurate location of worker in cluster come
Task is distributed to some cluster member nearest apart from task point.Therefore, in the assigning process of entire space tasks, each
The specific location privacy of worker is all underground for requestor and server, to reach location privacy protection
Purpose.
As a kind of executive mode, worker actively executes sub-clustering in step S2, specially：
S21：The registered person of working online periodically generates the random number between one (0,1) respectively, if this
Number is less than predetermined threshold value P, then the worker is identified as cluster head；
S22：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, the cluster head request packet
Cluster head location information is contained；
S23：The operated adjacent person selection one for receiving cluster head solicited message is added apart from nearest cluster head where it
In cluster；
S24：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes that the position of itself is believed
Breath.
As another executive mode, worker executes sub-clustering on demand in step S2, specially：
S21'：Server receives and broadcasts one to all registered persons of working online after the demand for services of requestor's transmission
Sub-clustering enabling signal；
S22'：The registered person of working online receive between one (0,1) is generated after sub-clustering enabling signal respectively with
Machine number, if this number is less than predetermined threshold value P, which is identified as cluster head；
S23'：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, the cluster head solicited message
Contain cluster head location information；
S24'：The operated adjacent person selection one for receiving cluster head solicited message is added apart from nearest cluster head where it
In cluster；
S25'：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes the position of itself
Information.
In the process of implementation, cluster head calculates the location information at virtual cluster center according to following formula in step S3：
Wherein,For cluster CjVirtual cluster center abscissa,For cluster CjVirtual cluster center ordinate, xiFor cluster
CjIn i-th of cluster member WiAbscissa, yiFor cluster CjIn i-th of cluster member WiOrdinate, NjFor cluster CjMiddle cluster member's is total
Number.
The present invention remarkable result be：Principle is simple, and it is convenient to realize, by the position for reporting virtual cluster center to server
Information is distributed to replace the accurate location of worker using two-stage task, and worker's location privacy is efficiently avoided
Leakage, average task response-time is short, and average task expense is small, and algorithm performance is reliable and stable.
Description of the drawings
Fig. 1 is the network topology structure figure of the present invention；
Fig. 2 is the algorithm performance comparison diagram of different sub-clustering modes.
Specific implementation mode
Specific embodiment and working principle of the present invention will be described in further detail below in conjunction with the accompanying drawings.
As shown in Figure 1, crowdsourcing network in space is mainly by requestor requester, worker worker, server
It constitutes, for server distributes mission mode, requestor sends demand for services, clothes to server first when needing service
The task is distributed to some specific worker further according to the position situation of each worker and wanted in above process by business device
Think that the location privacy protection of realization worker, the present invention propose a kind of space crowdsourcing network node location method for secret protection,
Specifically execute according to the following steps：
S1：The step of requestor sends demand for services to server；
S2：The step of worker executes sub-clustering according to oneself position has been divided into n cluster, cluster 1 ... in figure
cluster n；
S3：The step of cluster head generates virtual cluster center according to cluster membership location's information；
S4：Cluster head randomly chooses a cluster member and as factorage person and is sent to virtual cluster center location information
Step, cluster head is head in figure, and factorage person is agent；
S5：The step of factorage person reports virtual cluster center location information to server；
S6：Server selects the virtual cluster center nearest from demand for services place, and assigns the task in the virtual cluster
The step of factorage person corresponding to the heart；
S7：Factorage person will receive the step of task is transmitted to cluster head；
S8：Cluster head assigns the task to the step of cluster member nearest from demand for services place；
S9：The cluster member to receive an assignment executes the step of task and feedback information.
As an implementation, worker actively executes sub-clustering in step S2, specially：
S21：The registered person of working online periodically generates the random number between one (0,1) respectively, if this
Number is less than predetermined threshold value P, then the worker is identified as cluster head；
S22：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, the cluster head request packet
Cluster head location information is contained；
S23：The operated adjacent person selection one for receiving cluster head solicited message is added apart from nearest cluster head where it
In cluster；
S24：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes that the position of itself is believed
Breath.
As another executive mode, worker executes sub-clustering on demand in step S2, specially：
S21'：Server receives and broadcasts one to all registered persons of working online after the demand for services of requestor's transmission
Sub-clustering enabling signal；
S22'：The registered person of working online receives random between generating one (0,1) after sub-clustering enabling signal respectively
Number, if this number is less than predetermined threshold value P, which is identified as cluster head, predetermined threshold value P (such as P=0.08)
It is the percentage of cluster head in the registered person of working online, is controlled using threshold value, each worker is likely to become cluster head,
This threshold value also determines the average anonymity degree of location privacy protection, i.e. 1/P；
S23'：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, the cluster head solicited message
Contain cluster head location information；
S24'：The operated adjacent person selection one for receiving cluster head solicited message is added apart from nearest cluster head where it
In cluster；
S25'：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes the position of itself
Information.
For the different sub-clustering mode of above two, in active sub-clustering mode, the registered person of working online passes through a little
Communication link to point periodically carries out space cluster algorithm in a manner of single-hop, this mode compared to on-demand sub-clustering mode and
Speech, can faster respond task, but it will produce higher communication overhead.And sub-clustering mode is compared to actively on demand
Lower communication overhead can be generated for sub-clustering mode, but brings response time longer disadvantage.
In executing above-mentioned algorithm, cluster head calculates the location information at virtual cluster center according to following formula in step S3：
Wherein,For cluster CjVirtual cluster center abscissa,For cluster CjVirtual cluster center ordinate, xiFor cluster
CjIn i-th of cluster member WiAbscissa, yiFor cluster CjIn i-th of cluster member WiOrdinate, NjFor cluster CjMiddle cluster member's is total
Number.
For the performance for the scheme that research institute proposes, we are using NS-2 simulation softwares to active sub-clustering and on-demand sub-clustering two
Kind mode is emulated.We represent mobile worker, worker using random way point models in an experiment
Node is randomly placed in the network of a 4000m × 4000m, and wireless transmission model is using the free space that range is 200m
Model.
During the secondary distribution stage, if the worker finally to receive an assignment be in entire cluster member position closest to complete
At required by task in-position, it is accurate that we, which are considered as current task distribution,.From Fig. 2 we can observe that actively
Distribution accuracy with on-demand is average 98% or more, so it is proposed that algorithm reliable Service Quality can be provided
Amount.
Although reference be made herein to invention has been described for the embodiment of the present invention, however, it is to be understood that art technology
Personnel can be designed that a lot of other modification and implementations, these modifications and implementations will be fallen in original disclosed in the present application
Then within scope and spirit.
Claims (4)
1. a kind of space crowdsourcing network node location method for secret protection, it is characterised in that include the following steps：
S1：The step of requestor sends demand for services to server；
S2：The step of worker executes sub-clustering according to oneself position；
S3：The step of cluster head generates virtual cluster center according to cluster membership location's information；
S4：Cluster head randomly chooses a cluster member as factorage person and is sent to the step of virtual cluster center location information
Suddenly；
S5：The step of factorage person reports virtual cluster center location information to server；
S6：Server selects the virtual cluster center nearest from demand for services place, and assigns the task to the virtual cluster center institute
The step of corresponding factorage person；
S7：Factorage person will receive the step of task is transmitted to cluster head；
S8：Cluster head assigns the task to the step of cluster member nearest from demand for services place；
S9：The cluster member to receive an assignment executes the step of task and feedback information.
2. crowdsourcing network node location method for secret protection in space according to claim 1, which is characterized in that in step S2
Worker actively executes sub-clustering, specially：
S21：The registered person of working online periodically generates the random number between one (0,1) respectively, if this number is small
In predetermined threshold value P, then the worker is identified as cluster head；
S22：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, which includes
Cluster head location information；
S23：The operated adjacent person selection one for receiving cluster head solicited message is added apart from nearest cluster head in the cluster where it；
S24：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes the location information of itself.
3. crowdsourcing network node location method for secret protection in space according to claim 1, which is characterized in that in step S2
Worker executes sub-clustering on demand, specially：
S21'：Server receives and broadcasts a sub-clustering to all registered persons of working online after the demand for services of requestor's transmission
Enabling signal；
S22'：The registered person of working online receives the random number generated respectively after sub-clustering enabling signal between one (0,1),
If this number is less than predetermined threshold value P, which is identified as cluster head；
S23'：The worker for regarding as cluster head broadcasts a cluster head solicited message in a manner of single-hop, which includes
Cluster head location information；
S24'：Receive cluster head solicited message operated adjacent person select one it is added apart from nearest cluster head where cluster
In；
S25'：Non- cluster head worker sends confirmation message to the cluster head of affiliated cluster, which includes the location information of itself.
4. the space crowdsourcing network node location method for secret protection according to claim 1-3 any one, feature exist
In cluster head calculates the location information at virtual cluster center according to following formula in step S3：
Wherein,For cluster CjVirtual cluster center abscissa,For cluster CjVirtual cluster center ordinate, xiFor cluster CjIn
I-th of cluster member WiAbscissa, yiFor cluster CjIn i-th of cluster member WiOrdinate, NjFor cluster CjThe total number of middle cluster member.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510676264.3A CN105243501B (en) | 2015-10-13 | 2015-10-13 | Space crowdsourcing network node location method for secret protection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510676264.3A CN105243501B (en) | 2015-10-13 | 2015-10-13 | Space crowdsourcing network node location method for secret protection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105243501A CN105243501A (en) | 2016-01-13 |
| CN105243501B true CN105243501B (en) | 2018-11-09 |
Family
ID=55041138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510676264.3A Active CN105243501B (en) | 2015-10-13 | 2015-10-13 | Space crowdsourcing network node location method for secret protection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105243501B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105825333A (en) * | 2016-03-14 | 2016-08-03 | 南京邮电大学 | Crowdsourcing service system based on anonymous places of cloud platform and task distribution method |
| CN107222302B (en) * | 2017-07-03 | 2019-05-07 | 深圳大学 | The space crowdsourcing task distribution system and method constructed with part homomorphic encryption scheme |
| CN107257381B (en) * | 2017-07-03 | 2021-03-26 | 深圳大学 | Task allocation system model for privacy protection space crowdsourcing and implementation method |
| CN107360146B (en) * | 2017-07-03 | 2021-03-26 | 深圳大学 | Privacy protection space crowdsourcing task allocation system and method for receiving guarantee |
| CN107196974B (en) * | 2017-07-26 | 2018-04-20 | 安徽大学 | A kind of space crowdsourcing worker's location privacy protection method based on difference privacy |
| CN108809961A (en) * | 2018-05-24 | 2018-11-13 | 南京大学 | A method of protecting privacy of user in crowdsourcing system |
| CN109033865B (en) * | 2018-06-20 | 2021-10-01 | 苏州大学 | Task allocation method for privacy protection in space crowdsourcing |
| CN110620772B (en) * | 2019-09-20 | 2021-06-25 | 西安电子科技大学 | Block chain-based spatial crowdsourcing multi-level position privacy protection method |
| CN111784211B (en) * | 2020-08-04 | 2021-04-27 | 中国人民解放军国防科技大学 | Cluster-based group multitask allocation method and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102013957A (en) * | 2010-11-30 | 2011-04-13 | 北京邮电大学 | Transmission method based on clustering wireless sensor network |
| CN104507048A (en) * | 2014-12-24 | 2015-04-08 | 福建师范大学 | Location privacy protection method based on l-inquiry |
| CN104822143A (en) * | 2015-05-04 | 2015-08-05 | 东南大学 | Source node position privacy protection method with anti-flow-analysis-attack function |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140214607A1 (en) * | 2013-01-29 | 2014-07-31 | Microsoft Corporation | Global currency of credibility for crowdsourcing |
| US9842307B2 (en) * | 2013-11-19 | 2017-12-12 | Xerox Corporation | Methods and systems for creating tasks |
-
2015
- 2015-10-13 CN CN201510676264.3A patent/CN105243501B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102013957A (en) * | 2010-11-30 | 2011-04-13 | 北京邮电大学 | Transmission method based on clustering wireless sensor network |
| CN104507048A (en) * | 2014-12-24 | 2015-04-08 | 福建师范大学 | Location privacy protection method based on l-inquiry |
| CN104822143A (en) * | 2015-05-04 | 2015-08-05 | 东南大学 | Source node position privacy protection method with anti-flow-analysis-attack function |
Non-Patent Citations (1)
| Title |
|---|
| A novel location privacy framework without trusted third party based on location anonymity prediction;Scheikh Iqbal Ahamed,etc;《ACM》;20120430;第12卷(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105243501A (en) | 2016-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105243501B (en) | Space crowdsourcing network node location method for secret protection | |
| Zhou et al. | Cyber-physical-social systems: A state-of-the-art survey, challenges and opportunities | |
| Wang et al. | Personalized privacy-preserving task allocation for mobile crowdsensing | |
| Savazzi et al. | Federated learning with cooperating devices: A consensus approach for massive IoT networks | |
| Guo et al. | Distributed machine learning for multiuser mobile edge computing systems | |
| Feng et al. | NOMA-based UAV-aided networks for emergency communications | |
| Bui et al. | Game theoretic approach on Real‐time decision making for IoT‐based traffic light control | |
| Misra et al. | Mils-cloud: A sensor-cloud-based architecture for the integration of military tri-services operations and decision making | |
| Song et al. | Networking systems of AI: On the convergence of computing and communications | |
| Meena et al. | Reliability analysis of mobile ad hoc networks using universal generating function | |
| CN107196974A (en) | A kind of space mass-rent worker's location privacy protection method based on difference privacy | |
| Shi et al. | A novel deep Q-learning-based air-assisted vehicular caching scheme for safe autonomous driving | |
| Basu et al. | A post-disaster demand forecasting system using principal component regression analysis and case-based reasoning over smartphone-based DTN | |
| To et al. | PrivGeoCrowd: A toolbox for studying private spatial crowdsourcing | |
| Cho et al. | Energy efficient IoT based on wireless sensor networks | |
| Goudarzi et al. | Dynamic resource allocation model for distribution operations using SDN | |
| Selvakumar et al. | An intelligent energy aware secured algorithm for routing in wireless sensor networks | |
| Wang et al. | A source location privacy protection scheme based on ring-loop routing for the IoT | |
| Tang et al. | A trust-based model for security cooperating in vehicular cloud computing | |
| Cao et al. | AI agent in software-defined network: Agent-based network service prediction and wireless resource scheduling optimization | |
| Narayanan et al. | Collective intelligence using 5G: Concepts, applications, and challenges in sociotechnical environments | |
| Ding et al. | Distributed machine learning for uav swarms: Computing, sensing, and semantics | |
| Gupta et al. | Contract-Theory-Based Incentive Design Mechanism for Opportunistic IoT Networks | |
| Lukic et al. | Robot coordination for energy-balanced matching and sequence dispatch of robots to events | |
| Higashino et al. | Mobile agent migration based on code caching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201214 Address after: Room 801, 85 Kefeng Road, Huangpu District, Guangzhou City, Guangdong Province Patentee after: Yami Technology (Guangzhou) Co., Ltd Address before: 400044 No. 174 Sha Jie street, Shapingba District, Chongqing Patentee before: Chongqing University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220411 Address after: 430000 No. 6 Hanyang Street, Sino-French Ecological City, Caidian District, Wuhan City, Hubei Province Patentee after: Wuhan Kexun Zhijing Technology Co.,Ltd. Address before: Room 801, 85 Kefeng Road, Huangpu District, Guangzhou City, Guangdong Province Patentee before: Yami Technology (Guangzhou) Co.,Ltd. |
|
| TR01 | Transfer of patent right |