Research Article
A Novel User Selection Strategy with Incentive Mechanism Based on Time Window in Mobile Crowdsensing
Algorithm 1
PJIM incentive mechanism algorithm.
| Input: participant set U, participation time period L, participant bid price B, price pool initial reward D, Participant private target threshold G | | Output: the selected participant set S, the paid reward P or price pool amount D | (1) | S ⟵ Ø, ⟵ Ø, ⟵ Ø, ⟵ Ø | (2) | The participants are ranked and judged by the incrementing start time of the report | (3) | if [, ] | (4) | for i = 1 to n do | (5) | = /2 | (6) | if [0, 6] | (7) | ⟵ | (8) | else if [6, 12] | (9) | ⟵ | (10) | end for | (11) | Calculate whether participants in the set can cover the night time period of the task | (12) | if the participation time of can’t cover the night task | (13) | D ⟵ Calculate the prize pool amount | (14) | ⟵ Calculate satisfied participants set U | (15) | Return (D, ) | (16) | else | (17) | The dynamic programming algorithm is used to select the participant set S and calculate the cost | (18) | for all i U do | (19) | ⟵ 0 | (20) | end for | (21) | for all i S do | (22) | ⟵ cost(U\{i}) − (cost(U) − ) | (23) | end for | (24) | for all i S do | (25) | ⟵ | (26) | ⟵ Calculate extra rewards | (27) | ⟵ Calculate the prize pool amount | (28) | end for | (29) | Return(S, P) | (30) | else | (31) | D ⟵ Calculate the prize pool amount | (32) | ⟵ Calculate satisfied participants set U | (33) | Return(D, ) |
|