E. Also suppose a malicious node M can hear A, B, C and D. The attack can be described as follows:[18]
“To start the attack, M changes its MAC address to match A’s, moves closer to and out of the range of A. It then sends an RREP to B that contains a hop count to X that is less than the one sent by C, e.g., zero. Therefore B changes its route to the destination, X, to go through A, as illustrated in Figure. 1.4. M then changes its MAC address to match B ' s, moves closer to and out of range of B , and then sends to C an RREP with a hop-count to X lower than what was advertised by E. C then routes to X through B. At this point a loop is formed and X is unreachable from the four nodes. The attack is possible with a single malicious attacker;
“To start the attack, M changes its MAC address to match A’s, moves closer to and out of the range of A. It then sends an RREP to B that contains a hop count to X that is less than the one sent by C, e.g., zero. Therefore B changes its route to the destination, X, to go through A, as illustrated in Figure. 1.4. M then changes its MAC address to match B ' s, moves closer to and out of range of B , and then sends to C an RREP with a hop-count to X lower than what was advertised by E. C then routes to X through B. At this point a loop is formed and X is unreachable from the four nodes. The attack is possible with a single malicious attacker;