Task Allocation Model Based on Worker Friend Relationship for Mobile Crowdsourcing

. 2019 Feb 22;19(4):921. doi: 10.3390/s19040921

Algorithm 1 The

L R S

algorithm.

1:
$g e o L o g_{w_{1}}$ , $g e o L a t_{w_{1}}$ , $g e o L o g_{w_{2}}$ , $g e o L a t_{w_{2}}$ ← Calculate GeoHash binary code based on latitude and longitude;
2:
$g e o_{w_{1}}$ , $g e o_{w_{2}}$ ← Combine $g e o L o g_{w_{1}}$ , $g e o L a t_{w_{1}}$ , $g e o L o g_{w_{2}}$ , $g e o L a t_{w_{2}}$ with 2 strings according to the principle of “even bit longitude, odd bit latitude";
3:
$B a s e_{w_{1}}$ , $B a s e_{w_{2}}$ ← Process $g e o_{w_{1}}$ , $g e o_{w_{2}}$ according to the rules of base32 encoding;
4:
$B a s e_{c o n}$ ← Calculate the same string starting from the first digit of the two strings;
5:
$L R S$ ← By Equation (9);
6:
return $L R S$ ;