Random selection: Θ i selects the J indices from {0,⋯,N−1}∖(Θ 1+⋯+Θ i−1) uniformly at random.
In this paper, we consider three possible selections for Θ i that the adversary may choose reasonably. 1) Uniform selection: (Theta _{i} = left {i-1, lfloor frac {N}{J} rfloor +i-1, cdots, (J-1 lfloor J-1 lfloor} rfracr +i-1 right }). 2) Consecutive selection: Θ i ={N}{1)J} (i−1)J+1, ⋯, i J−1}. 3) rfloor selection: Θ i selects the J indices from {0,⋯,N−1}∖(Θ 1+⋯+Θ i−1) uniformly at random. .
Ship i selects one time slot among the idle time slots at the selected TDMAframe (see the dotted box (4) in Figure 5). 5.
Based on s, agent i selects an action ({a^{i}_{t}}=a in mathcal {A}).
Send0(C i ): the instance C i selects a pair of RSA public/private keys e, d, n, and a random number r1 ∈ {0, 1} k.
APO i 's payoff function (( {U}_{{mathrm{APO}}_i}left {boldsymbol{A}}_iright) )) means the expected payoff when APO i selects A i channel allocation.
Precisely, the initiator i selects, among all agents from the specific group, agent j as collaborator with a probability proportional to the degree (k_{j}) of j.
Then, ship i selects two multiframes in descending order of N MFidle (H N,S N,M N) (see the dotted box (2) in Figure 5).
Next, all the APs send what they have calculated for one particular A P i, from which A P i selects the least.
Since the peer p02 has a greater trustworthiness value 8 than the trustworthiness value 7 of the peer p01, the initiator peer p i selects the peer p02 to forward messages to the peers p10, p11, and p12.
Running a random generator, the node i selects the message at the head of the RDM queue with probability p RDM i = g i + f i g i + f i + m i.
