MR-Pareto: A Multiattribute Opportunistic Routing Method Based on Pareto Optimal Solution for Mobile Crowdsensing

Algorithm 1

Select nodes from candidate node set Pareto.

1: Input: Node Set

2: Output: Candidate Node SetPareto

3: Procedure ParetoCandidate

4: Calculate the centrality of node

5: Calculate the correlation of node

6: Calculate the similarity utility of node

7: LET be the first dominating set

 % Non-dominated Sorting

8: for in do

9: let be the dominating set

10: for in do

11:  add to the list when dominates

     add 1 when is dominated by

    take of the individual is 0 be

12: end for

13: end for

14: F.append()

15: SET

16: while F [] do

17: let be the dominated individual set

   Sort

   F.append()

18: end while