Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Scalability study of the ad hoc on-demand distance vector routing protocol
International Journal of Network Management
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Congestion Adaptive Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive backup routing for ad-hoc networks
Computer Communications
A low overhead dynamic route repairing mechanism for mobile ad hoc networks
Computer Communications
Dynamic backup routes routing protocol for mobile ad hoc networks
Information Sciences: an International Journal
Load balanced routing in mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
In this paper, a new routing protocol for mobile ad hoc networks, called traffic-aware and low-overhead routing protocol TALORP is proposed. TALORP uses backup routes to mitigate the flooding problem that is frequently used to repair link failures. It also accounts for the traffic flows on different paths towards the destination in order to select the shortest and the least-congested path. The simulation results demonstrated that TALORP achieves better performance compared to similar protocols under a wide range of traffic conditions in terms of packet delivery ratio, end-to-end delay, and the average number of hops used but at the cost of increasing the routing overhead under certain traffic conditions.