Secure and Fair Cluster Head Selection Protocol for Enhancing Security in Mobile Ad Hoc Networks

Algorithm 1

Secure cluster head selection algorithm.

Initiate node state

Cluster formation   // assumption one hop clusters

NL = {𝑛₁, 𝑛₂, 𝑛₃,…, 𝑛_𝑛}  // node’s Neighbour Lists

𝑉_𝑖= {𝑣₁, 𝑣₂, 𝑣₃,…, 𝑣_𝑛}  // Clustering variable Score

If (NL.size > max-cluster-size) then

   Truncate NL to max-cluster-size

   Sort NL based on 𝑉_𝑖;

For each node 𝑖 in NL:

   if (𝑁_𝑓/deg_𝑖≤2/3) then

   Neighbour is suspect node

   Calculate 𝑉_𝑖 with 𝑐_𝑡<0 from (1)

   Classify whether normal or attacker by reputation system

   Else if (𝑁_𝑓/deg_𝑖>2/3) then

   Node is normal node

   Calculate 𝑉_𝑖 with 𝑐_𝑡>0 from (1)

   Else if (deg_𝑖 > network-size) then

   Node is attacker node

   exclude node from decision

CH = neighbour node with maximum 𝑣_𝑖