Download Now Free registration required
This paper presents an algorithm for mobility in routing protocol along with an Ant Colony Optimization (ACO) to solve path finding problem and reduce packet losses in Mobile Ad hoc NETworks (MANETs). The algorithm can be applied to any Reactive protocols Such as DSR and AODV. Here, ant communication behaviour is the inspiration for solving computational problems which can be reduced to find a good path, and the mobility assisted routing applied over reactive protocol to estimate the number of packet which can traverse before the link failure, by calculating its link life time which in-turn gives route life time. This algorithm reduces the path finding problem, increases packet delivery ratio and throughput.
- Format: PDF
- Size: 536.06 KB