Research Article
[Retracted] A Task Allocation Algorithm for Coal Mine Mobile Crowd Sensing Based on Weighted Undirected Graph
Algorithm 1
Emergency weighted undirected graph algorithm.
(i) | Input: set of users , node coordinates , add task node , define task type , get task time weight , initial task path weight , initialize | (ii) | Output: selected participants | (iii) | For to amount do | (iv) | For = 1 to amount of do | (v) | If , then | (vi) | ←record miner; | (vii) | End if | (viii) | End for | (ix) | End for | (x) | Make the initial node the task node ; | (xi) | Get and record the nodes adjacent to the current node; | (xii) | Calculate the weight of the current node and adjacent node ; | (xiii) | If || , then | (xiv) | ←record the coordinates of the farthest position; | (xv) | Else | (xvi) | Record the weight of the path, update node to the next adjacent node , and return to step (11); | (xvii) | End if | (xviii) | Obtain the position coordinates of miners in miner set ; | (xix) | For to amount do | (xx) | If , then | (xxi) | record miner | (xxii) | End if | (xxiii) | End for | (xxiv) | ←calculate amount of value; | (xxv) | Sort based on in the decreasing order; | (xxvi) | ←number of people before selection; | (xxvii) | Return ; |
|