A Caching Strategy for Multiple Paths Routing in Mobile Ad Hoc Networks
Ha Duyen Trung, Watit Benjapolakul · 2006
A mobile ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. There are a number of routing schemes that have been proposed and several of these have been already extensively simulated or implemented as well. In this paper, our goal is to utilize position information to provide more reliable as well as efficient routing for ad hoc networks. We hence describe extension based on a caching strategy to location-aided routing (LAR) algorithm. We propose replacing LAR with location-aided multipath routing (LAMR). We have implemented LAMR through simulation using ns-2 and study its efficiency, and other properties. We use random waypoint mobility and compare LAMR approach versus ad hoc on-demand distant vector (AODV), ad hoc on-demand multi-path distant vector (AOMDV) and LAR methods for a range of mobility and communication models. Our simulation results demonstrate the performance benefits of LAMR over LAR and AODV in most movement scenarios. AOMDV delivers more packets than LAMR consistently, but does more frequent flooding of control packets and thus requires higher bandwidth usage than LAMR