“…In each set of simulations, there are two selfish nodes, that means 40% selfish nodes are selfish. There are 10 possible combinations, i.e., (0, 1), (0, 2), (0, 3), (0, 4), (1,2), (1,3), (1,4), (2,3), (2,4), and (3,4). Here, (i, j) denotes that the nodes indexed i and j are selfish in this run of simulation.…”