Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Stable Node-Disjoint Multipath Routing with Low Overhead in Mobile Ad Hoc Networks
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
A reverse AODV routing protocol in ad hoc mobile networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Hi-index | 0.00 |
In ad hoc networks most on demand routing protocols concentrate on the single path from a source to a destination. Exhaustively using a single path increases traffic load and faster consumes energy of nodes on the path. Therefore, preventing concentration on a single path and distribution of energy and traffic load on whole network is an important issue on ad hoc networks. Some multipath searching methods have been studied, but finding all available paths from a source to a destination is still a challenging issue. In this study, we provide an efficient and a straightforward node-disjoint multi-path discovery algorithm for searching all available paths. The discovery method is provided based on AODV. We implement simulation models for analyzing efficiency of proposed multi-path discovery method on the NS-2. Simulation results show that the proposed methods can get very good results on multi-path discovery rate.