Interior Angle Computation for detecting Adversary Sensor in Wireless Sensor Networks

After being distributed over a wireless sensor network (WSN), the sensor nodes in the network normally remain in the same place permanently. An attacker who compromises a subset of the nodes is not essential to stand by the same restriction. This article introduces Interior Angle Computation for detecting adversary sensor (IACD) in WSN. The main awareness of this scheme for applying the angle-based method is to decide the adversary node. In this case, the sender wishes to transmit the information to the receiver, and the sender selects the neighbor node that will serve as the next hop in the network. The subsequent hop chooses, from among the neighbors of the sender node, the sensor node that is geographically closest to the recipient. The sender selected the neighboring node, and the sensor node that was physically closest to it created the triangle. In this triangle, the three inner angles add up to a total of 180 degrees, and in order to achieve a value of 180 degrees for the triangle, each of these three nodes must be a genuine sensor node. If it is not, then the node is an opponent. In addition, this approach applies a binary tree algorithm to improve the routing efficiency. It improves routing efficiency. The simulation results explain that the IACD has a better packet rate and increases the remaining energy in the network. In addition, it increases the adversary detection ratio in the WSN.