Abstract

The fault-prone nodes in mobile ad-hoc networks (MANETs) degrade the performance of any routing protocol. Using greedy routing mechanisms that tend to choose a single path every time, may cause major data losses, if there is a breakdown of such a path in a fault-prone environment. On the other hand, using all the available paths causes an undesirable amount of overhead on the system. Designing an effective and efficient fault-tolerant routing protocol is inherently hard, since the problem is NP-complete, due to the unavailability of precise path information in adversarial environments [1]. To address the challenges of effective fault-tolerant routing, we present a fault-tolerant routing algorithm (FTAR), based on the ideas of how swarms of natural ants operate[2]. The algorithm is divided into various stages namely initialization, path selection, pheromone deposition, confidence calculation, evaporation and negative reinforcement. Simulation results show that FTAR achieves high packet delivery ratio and throughput as compared to some of the key protocols which do not do fault-tolerance at all. Most importantly, FTAR beats the best fault-tolerant MANET routing algorithm [1] known currently, with respect to the amount of routing overhead incurred, which is an important consideration.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.