Cooperative packet caching and shortest multipath routing in mobile ad hoc networks
Citations Over TimeTop 10% of 2004 papers
Abstract
A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route breakdowns. Simulation results reveal that by using a five-packet data cache, CHAMP exhibits excellent improvement in packet delivery, outperforming AODV and DSR by at most 30% in stressful scenarios. Furthermore, end-to-end delay is significantly reduced while routing overhead is lower at high mobility rates.
Related Papers
- → Multipath Routing Algorithms for Congestion Minimization(2007)149 cited
- → Research of optimization model of fault-tolerant routing with bilinear path protection criterion(2017)4 cited
- PATH IDENTIFICATION IN MULTIPATH ROUTING(2011)
- → Constrained Multipath Routing Algorithm Based on Satellite Network(2021)1 cited