Iterative Route Discovery in AODV

Several protocols for ad hoc network try to reduce redundancy as an effective measure against broadcast problems. Though these protocols ensure good performance in a favorable environment, they perform poorly when node cooperation cannot be guaranteed due to intentional misbehavior or environmental hostility. As a result, the expected behavior of nodes to forward packets, which is the basic assumption of all broadcast approaches, cannot be achieved always. In this paper, we analyze the performance deterioration of these algorithms in hostile environment. As a remedy, we focus on the reverse direction and interestingly find that adding redundancy in a controlled manner can greatly compensate the performance loss due to node misbehavior. Here we propose a novel approach that tune the amount of redundancy so that reachability and routing load both remain at a satisfactory level. Comparing their relative performance we end up with the conclusion that though redundancy is undesired, controlled redundancy is effective in special situations like uncooperative environments.