Research Article
Secure and Fair Cluster Head Selection Protocol for Enhancing Security in Mobile Ad Hoc Networks
Algorithm 2
Byzantine agreement node classification algorithm.
| Input: NL = , , ,…, node’s Neighbour Lists | | Output: Classification of the Node | | foreach Member Node in NL do | | if CH checks the over is less than or equal to the threshold | | Suspect = node | | if become good then | | Classified suspect node as normal | | else | | Penalized the suspect node by reducing its score | | if advertised degree is equal to network size and the threshold is exceeded | | Classified node as attacker | | Node Excluded from network | | if advertised ratio of degree greater than threshold | | Node is classified as normal |
|
