A collection of mobile nodes in different speeds, transmission range random movement in absence of any static support of infrastructure is called a mobile adhoc network or MANET. In MANET, nodes have to announce their presence periodically and listen for their neighbors announcements broadcast to discover and learn how to reach each other. A new node is not familiar with its network topology at the beginning. Mobility and scalability are the main challenges in MANETs, with mobility implying a non predictable topology and stale routes, while scalability means more traffic and overhead control packets. Hence, efficient routing algorithms are needed to make the communication between the mobile nodes possible, easy and reliable over multi-hop paths, consisting of several links, dynamic and non predictable topology in a way that saves the network resources as much as necessary. We have previously developed and presented a multipath zones routing protocol (MDVZRP). It is based on a technique that provides multiple alternative paths between each source and destination in a network; the benefit of this bandwidth, and security improvements. In this paper, the MDVZRP algorithm is changed from zones based technique to threshold technique. The significance of the selection of MDVZRP's parameters optimum values of RREQ Threshold and RREQ Time Out Delay came from the observation in simulation time of various scenarios using RWP technique.
[1]
Eryk Dutkiewicz,et al.
A review of routing protocols for mobile ad hoc networks
,
2004,
Ad Hoc Networks.
[2]
Joseph P. Macker,et al.
Mobile ad hoc networking and the IETF
,
1999,
MOCO.
[3]
Arthur L. Liestman,et al.
A Zonal Algorithm for Clustering An Hoc Networks
,
2003,
Int. J. Found. Comput. Sci..
[4]
Charles E. Perkins,et al.
Performance comparison of two on-demand routing protocols for ad hoc networks
,
2001,
IEEE Wirel. Commun..
[5]
Robert Pooley,et al.
Performance Evaluation of Routing Protocols for MANET
,
2009,
2009 Fourth International Conference on Systems and Networks Communications.
[6]
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.
[7]
Andrew S. Tanenbaum,et al.
Computer Networks
,
1981
.
[8]
Charles E. Perkins,et al.
Performance comparison of two on-demand routing protocols for ad hoc networks
,
2001,
IEEE Wirel. Commun..
[9]
Paolo Santi,et al.
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
,
2003,
IEEE Trans. Mob. Comput..
[10]
Esa Hyytiä,et al.
Random Waypoint Model in Wireless Networks
,
2005
.