Research Article
A Node Selection Paradigm for Crowdsourcing Service Based on Region Feature in Crowd Sensing
Algorithm 2
Score the regions based on labor costs.
| Input: Task-featured Region Dataset , and Location of the specific task | | Output: Scores of labor cost of each region | | 1:create a distance vector | | 2:for each do | | 3:while not all nodes in have been visited do | | 4:select one unvisited node from | | 5:set it as visited | | 6:calculate Manhattan distance from this node to | | 7:save the calculating result in with the corresponding node identified number | | 8:end while | | 9:end for | | 10:for each do | | 11:compare the value of with other elements in the vector and rank | | 12:end for | | 13:Based on the order in , score each region with a rule that a shorter calculated distance can have a higher score |
|