Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find node-disjoint paths to achieve higher fault tolerance capability. By using node-disjoint paths, it is expected that the end-to
- PDF / 224,111 Bytes
- 10 Pages / 430 x 660 pts Page_size
- 92 Downloads / 197 Views
Abstract. Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault tolerance capability. By using nodedisjoint paths, it is expected that the end-to-end delay in each path should be independent of each other. However, because of natural properties of wireless media and medium access mechanisms in ad hoc networks, the end-to-end delay between any source and destination depends on the pattern of communication in the neighborhood region. In this case some of the intermediate nodes should be silent to reverence their neighbors and this matter increases the average of end-to-end delay. To avoid this problem, multi-path routing algorithms can use zone-disjoint paths instead of node-disjoint paths. Two routes with no pair of neighbor nodes are called zone-disjoint paths. In this paper we propose a new multi-path routing algorithm that selects zone-disjoint paths, using omni-directional antenna. We evaluate our algorithm in several different scenarios. The simulation results show that the proposed approach is very effective in decreasing delay and packet loss. Keywords: MANET; Routing Algorithms; Multi-Path Routing; Zone-Disjoint Paths.
1 Introduction Mobile Ad hoc Networks (MANETs) are characterized by dynamic topology, high node mobility, low channel bandwidth and limited battery power. To provide end-toend communication throughout the network, each mobile node acts as an intermediate router forwarding messages received by other nodes. Designing efficient routing protocols is the central challenge in such dynamic wireless networks. However, many ad hoc routing algorithms have been proposed, such as AODV [1], DSR [4]. Routing protocols for MANETs can be broadly classified into reactive (on-demand) and proactive algorithms [1]. In reactive protocols, nodes build and maintain routes as they are needed but proactive routing algorithms usually constantly update routing table among nodes. In on-demand protocols, nodes only compute routes when they are needed. Therefore, on-demand protocols are suitable for dynamic large networks. When a H. Zhang et al. (Eds.): MSN 2007, LNCS 4864, pp. 715–724, 2007. © Springer-Verlag Berlin Heidelberg 2007
716
N.T. Javan and M. Dehghan
node needs a route to another node, it initiates a route discovery process to find a route. On-demand protocols consist of the following two main phases. Route discovery is the process of finding a route between two nodes. Route maintenance is the process of repairing a broken route or finding a new route in the presence of a route failure. Among the on-demand protocols, multi-path protocols have relatively greater ability to reduce the route discovery frequency than single path protocols. On-demand multi-path protocols discover multiple paths between the source and the destination in a single route discovery. Therefore, a new route discovery is needed only when all these paths fail. In contrast, a single path protocol has to invoke new route d
Data Loading...
