Performance improvement of dynamic source routing protocol the mobility effect of nodes in cache management

In this paper we propose a new method of improving the performance of dynamic source routing (DSR) protocol. In DSR, as well as other on-demand routing protocols, every established path is considered as temporary to reflect the mobility effect, therefore, once a path is established, it is associated with an expiration time. After that expiration time the path is deleted from the route cache of the nodes. In practice the mobility of nodes are not equal all the time and we propose to treat paths differently according to their stationary, rather than deleting them after every expiration time to improve performance. By simulation we show that this method improves the performance of DSR

[1]  Wenjing Lou,et al.  The effects of cache organizations on the performance of on-demand routing protocols in ad hoc networks , 2002, MILCOM 2002. Proceedings.

[2]  H. T. Mouftah,et al.  An efficient energy aware clusterhead formation infrastructure protocol for MANETs , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[3]  Amit Kumar Saha,et al.  Routing improvement using directional antennas in mobile ad hoc networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[4]  Xin Yu,et al.  A distributed adaptive cache update algorithm for the dynamic source routing protocol , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  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).

[6]  Yuguang Fang,et al.  Predictive Caching Strategy for On-Demand Routing Protocols in Wireless Ad Hoc Networks , 2002, Wirel. Networks.

[7]  Mari Carmen Domingo,et al.  A cooperation model between ad hoc networks and fixed networks for service differentiation , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[8]  Mario Gerla,et al.  Global state routing: a new routing scheme for ad-hoc wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[9]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

[10]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[11]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[12]  Alhussein A. Abouzeid,et al.  The impact of traffic patterns on the overhead of reactive routing protocols , 2005, IEEE Journal on Selected Areas in Communications.

[13]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[14]  Mario Joa-Ng,et al.  A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[15]  Ashraf S. Hasan Mahmoud,et al.  Simulation-Based Comparative Study of On Demand Routing Protocols for MANET , 2005 .

[16]  M.R. Shikh-Bahaei,et al.  Interference cancellation in W-CDMA cellular structures using statistical processing , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[17]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[18]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[19]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..