Design and development of efficient algorithm for mobile ad hoc networks using cache

Mobile ad hoc network is a collection of mobile nodes that can be dynamically setup anywhere anytime without having pre-existing infrastructure. This paper proposes a new routing algorithm for mobile ad hoc networks, which reduces the usage of the resource while forwarding the data packets from the source to destination with the help of support node. In order to route the data packets, the proposed model uses the tree-based cache model to increase the network throughput. It reduces the number of control message packets and average path-length in the network. The proposed model has been simulated using network simulator (NS-2.33) and has compared with AODV, DSR and DSDV models. The proposed model has shown better results in terms of packet delivery, average path-length and control message packets. The proposed model delivers 82% of the data packets when the mobility is 20 m/sec. If the mobility is 2.5-20 m/sec, then the path-length of the proposed model is 2.2-2.8 whereas DSDV model has 2.1-4, DSR model needs 3.32-3.8 and AODV model with 3.3-3.8.

[1]  Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue , 2006, Comput. Networks.

[2]  Wendi B. Heinzelman,et al.  Exploring long lifetime routing (LLR) in ad hoc networks , 2004, MSWiM '04.

[3]  G. Varaprasad.  New power aware routing algorithm for MANETs using gateway node , 2007, 2007 International Conference on Parallel and Distributed Systems.

[4]  H. Uehara,et al.  Impact of mobility metric on routing protocols for mobile ad hoe networks , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[5]  Lang Tong,et al.  Energy-Aware Adaptive Routing for Large-Scale Ad Hoc Networks: Protocol and Performance Analysis , 2007, IEEE Transactions on Mobile Computing.

[6]  John P. Hayes,et al.  Impact of mobility on connection stability in ad hoc networks , 2005 .

[7]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Yu-Chee Tseng,et al.  On Route Lifetime in Multihop Mobile Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[9]  Zygmunt J. Haas,et al.  Optimizing route-cache lifetime in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Yih-Chun Hu,et al.  Caching strategies in on-demand routing protocols for wireless ad hoc networks , 2000, MobiCom '00.

[12]  Kamesh Namuduri,et al.  Statistical estimation of route expiry times in on-demand ad hoc routing protocols , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[13]  Chita R. Das,et al.  Cooperative cache-based data access in ad hoc networks , 2004, Computer.

[14]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[15]  Tracy Camp,et al.  MANET simulation studies: the incredibles , 2005, MOCO.

[16]  Martin May,et al.  Measurements from an 802.11b mobile ad hoc network , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[17]  Hannes Hartenstein,et al.  Toward a mobility metric for comparable & reproducible results in ad hoc networks research , 2003, MOCO.