Virtual paths routing: a highly dynamic routing protocol for ad hoc wireless networks

We introduce the virtual paths routing (VPR) protocol for ad hoc wireless networks. VPR provides highly dynamic, correct, and efficient paths creation and maintenance between nodes. Innovatively, the protocol utilizes a technique to monitor the mobility of the nodes, and factorizes it in its operations. VPR is a distributed, on-demand, and adaptive protocol that comprises two phases. The first phase is path discovery, in which VPR discovers and creates a virtual path between source and destination nodes. The second phase is path maintenance, in which the protocol monitors the usability of all active paths.

[1]  Ram Ramanathan,et al.  Hierarchically‐organized, multihop mobile wireless networks for quality‐of‐service support , 1998, Mob. Networks Appl..

[2]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[3]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[4]  Wang Heng-jun Routing in AD HOC Networks of Mobile Hosts , 2002 .

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

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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

[8]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

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

[10]  Samir Ranjan Das,et al.  Comparative performance evaluation of routing protocols for mobile, ad hoc networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

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

[12]  Yih-Chun Hu,et al.  Implicit source routes for on-demand ad hoc network routing , 2001, MobiHoc '01.

[13]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[14]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[15]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[16]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[17]  Tony Larsson,et al.  Routing protocols in wireless ad-hoc networks : a simulation study , 1998 .

[18]  Rajendra V. Boppana,et al.  An adaptive distance vector routing algorithm for mobile, 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).

[19]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

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