Dynamic Path Control Scheme in Mobile Ad Hoc Networks Using On-Demand Routing Protocol

In existing on-demand routing protocols, the generated paths cannot dynamically adapt to the change of network topology even if another route with less hop is available. Routing efficiency affects network performance and lifetime. In this paper, we propose a dynamic path control (DPC) scheme that can actively adapt to network topology change due to node mobility. Each node monitors its active neighboring information and tries to meet the situation when a better local link is available. We evaluate the proposed DPC scheme using analytical modeling and prove that the path available time of existing routing schemes can be significantly improved by the application of the proposed scheme.

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[2]  Chinya V. Ravishankar,et al.  Interactions between TCP and the IEEE 802.11 MAC protocol , 2003, Proceedings DARPA Information Survivability Conference and Exposition.

[3]  J. J. Garcia-Luna-Aceves,et al.  Using minimal source trees for on-demand routing in ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Theodore B. Zahariadis,et al.  Efficient routing in PAN and sensor networks , 2004, MOCO.

[5]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[6]  Prasant Mohapatra,et al.  SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks , 2003, MobiHoc '03.

[7]  Yoshito Tobe,et al.  A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..