Login New user?  
01-Applied Mathematics & Information Sciences
An International Journal
               
 
 
 
 
 
 
 
 
 
 
 

Content
 

Volumes > Volume 9 > No. 1

 
   

A New Zone Disjoint Multi Path Routing Algorithm to Increase Fault-Tolerant in Mobile Ad Hoc Networks

PP: 433-444
Author(s)
Hoda Rafiee Pour, Marjan Kuchaki Rafsanjani, Hamid Saadat,
Abstract
In Mobile Ad-hoc Networks, there is no fixed infrastructure, router and station and so all network operations such as routing are being done with nodes. Some routing algorithms of Mobile Ad-hoc Networks perform routing in a multi-path manner and simultaneously discover and record a number of paths in a path discovery process. In these algorithms, it is possible to send information to destination concurrently using several paths, in order to balance the load in the network, increase end to end bandwidth, and decrease delay. In this case, selecting node disjoint paths is one of the best options because of increasing error tolerability. Given channel access mechanisms, sending information through completely disjoint paths is not fully independent. To solve the problem, we can use zone disjoint paths rather than node disjoint paths. Two paths are fully zone disjoint ones if none of the nodes in a path is adjacent to the nodes in the other. Methods have been proposed to discover zone disjoint paths; one of them is using directional antennas but these are not available in most of current facilities. The other method is Zone Disjoint Ad-hoc On-demand Multipath Distance Vector (ZD AOMDV) which has high overload while routing and additionally we see the very high delay during path discovery phase. A new method will be proposed in this paper which has been applied in the proposed algorithm ”Improved Zone Multipath Ad-hoc Ondemand Distance Vector” (IZM AODV). In the algorithm, it is possible to discover zone disjoint paths using typical, omnidirectional antennas with minimum overload and delay in path discovery phase. In addition, these paths are used to send information concurrently. The proposed algorithm has been simulated in different scenarios using NS2 software and it has been examined and compared with multipath algorithms (AOMDV and ZD AOMDV) and basic algorithm (AODV). Routing overloads, sending packets successfully, and end to end delays have been improved compared to existing methods.

  Home   About us   News   Journals   Conferences Contact us Copyright naturalspublishing.com. All Rights Reserved