An SETM Algorithm for Combating SSDF Attack in Cognitive Radio Networks

Algorithm 1

Input: SU₁^r to SU_S^r from ts₀ to ts_k, ∈ , is integer, w(i).

Output: FCO: Final decision of FC, categorisation of types of MUs and genuine SUs.

 (1) Pile the sensing reports of ‘S’ SUs for the mentioned timeslot in the table

 (2) Compute the FCO by majority voting

 (3) Let d(i) be the FCO output at ts_i

 (4) Let w(i) represent the count of participation in sensing

 (5) for d(i) = 0 or 1 & w(i) = k,

   if SU_i^r = 1 ∀ ts_k, then

    SU_i = MU₁ (ALWAYS YES MU)

  else go to next step

 (6) for d(i) = 0 or 1 & w(i) = k,

   If SU_i^r = 0 ∀ ts_k, then

    SU_i = MU₂ (ALWAYS NO MU)

  else go to next

 (7) for w(i) = k,

   if d(i) = 0 and SU_i^r = 1 ∀ ts_i &

   if d(i) =1 and SU_i^r = 0 ∀ ts_i

  then SU_i = MU₃ (ALTERNATOR)

  else go to next step

 (8) for d(i) = 0 or 1 & w(i) ≠ k,

   then SU_i = MU₄ (SELFISH)

     else SU_i = Random or genuine