Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29527

Select areas to restrict search in scientific publication database:
Reduction of Overheads with Dynamic Caching in Fixed AODV based MANETs
In this paper we show that adjusting ART in accordance with static network scenario can substantially improve the performance of AODV by reducing control overheads. We explain the relationship of control overheads with network size and request patterns of the users. Through simulation we show that making ART proportionate to network static time reduces the amount of control overheads independent of network size and user request patterns.
Digital Object Identifier (DOI):


[1] David B. Johnson. Routing in Ad Hoc Networks of Mobile Hosts. In Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'94), pages 158--163, December 1994.
[2] Hwee Xian TAN. Limiting Control Overheads based on Link Stability for Improved Performance in Mobile Ad Hoc Networks. Department of Computer Science, National University of Singapore
[3] M. Lakshmi andP.E Sankaranarayanan, Performance Analysis of Three Routing Protocols in Mobile Ad Hoc Wireless Networks. Asian Journal of Information Technology 4 (12): 1195-1200, 2005. Department of IT, Sathyabama Institute of Science and Technology, Chennai, India-600 119
[4] Satyadeva P. Konduru and Rajendra V. Boppana. On Reducing Packet Latencies in Ad Hoc Networks. The University of Texas, San Antonio.USA
[5] Mario Cagalj. Performance Evaluation of AODV Routing Protocol: Real-Life Measurements. LCA, EPFL. Alexander Zurkinden, SCC June, 2003,
[6] Samir R. Das, Robert Castaneda, and Jiangtao Yan. Simulation-based Performance Evaluation of Routing Protocols for Mobile Ad Hoc Networks, Department of Electrical and Computer Engineering and Computer Science, University of Cincinnati , OH 45221-0030 USA
[7] P. Chenna Reddy and P. Chandrasekhar Reddy, "Performance Analysis of Ad hoc Network Routing Protocol", JNTU College of Engg, Anantapur, Andhra Pradesh, India
[8] S.R Das, C.E Parkins and E.M Royer, "Performance comparison of two on demand routing protocols for adhoc networks", in IEEE INFOCOM 2000, Mar 2000
[9] K. Kuladinithi, A. Udugama, N. A. Fikouras, Carmelita Görg, "Experimental Performance Evaluation of AODV Implementations in Static Environments",ComNets, Universit├ñt Bremen, Otto-Hahn-Allee NW1, 28359 Bremen, Germany
[10] Network Working Group RFC 3561 Jul 2003
[11] Dan Yu and Hui Li, "A Model for Performance Analysis of Mobile Ad hoc Networks", Siemens AG, ICM N PG SP RC FR, Gustav- Heinemann-Ring 115, 81730 Munchen, Germany
[12] Amitab Chaudhury, "Experimental Wireless Networks", Rensselaer Polytechnic Institute, Troy, New York Dec 2002
[13] Michael Sirivianos1 and Athanasios Leontaris2, "Comparative Evaluation of Ad hoc Routing Protocols in Highly Dynamic Environments", University of California, Irvine1 & San Diego2
[14] http://
[15] Rajenra V. Boppana, "An Adoptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks", The University of Texas at San Antonio, San Antonio, TX 78249-0667
[16] Damla Turgut, S. K. Das and Mainak Chatterjee, " Longevity of Routes in mobile Ad hoc Networks", The University of Texas at Arlington, TX 76019-0015
[17] Claude Richard and C. E Parkins, "Defining an Optimal Active Route Timeout for the AODV Routing Protocol", Nokia Research Centre, Mountain View, California, USA
[18] C.E Parkins and E. M Royer, " Ad-hoc On-demand Distance Vector Routing", Sun Microsystems Labs, Menlo park , CA 94025, USA and University of California, Santa Barbara, CA , USA
[19] Laurent Viennot, Philippe Jacquet and Thomas H. Clausen, " Analyzing Control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity", INRIA Rocquencourt, Project Hipercom, Domaine de Voluceau, Le Chesnay cedex, France
[20] Shao-Cheng Wang and Ahmed Helmy, " Effects of Small Transfers and Traffic Patterns on Performance and Cache Efficacy of Ad Hoc Routing", Department of Electrical Engineering, University of California, USA
[21] Ben Liang1 and Zygmunt J. Haas2 , " Optimizing Route-Cache Lifetime in Ad Hoc Networks", 1University of Toronto, Ontario, Canada and 2School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA
[22] Babar S Kawish, Baber Aslam, Shoab A Khan, "Reducing the Overhead Cost in Fixed & Low Mobility AODV Based", FIMCSIT, Wisla, Poland, 2006 (Under Publication)
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007