In Mobile Ad hoc Network, path between source and destination node changes too frequently due to unpredictable behavior and movement of mobile nodes. The data delivery to the intended destination becomes very challenging. The paths exist between source and destination node may be various types. Data delivery may be done with single or multiple paths. Single path sometimes not guaranteed about d...

A major issue while computing disjoint multiple paths in an ad hoc environment is of path diminution. In this paper, we have proposed a node disjoint multipath routing (NDMR) and we have discussed schemes to mitigate path diminution. We have compared the performance of NDMR with existing node disjoint multipath routing protocols. We observed that success rate and packet delivery ratio of NDMR a...

Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes in G. This article provides a necessary condition for the K node-disjoint paths problem which combines (1) the structure of the reduced graph associated with G, (2) the structure of each strongly connected component o...

In this paper, we analyse a routing protocol that identifies a maximal set of node-disjoint paths between a given source and a destination in multiple attempts using an approach that is a combination of a single-go routing protocol and an incremental protocol. We prove that doing so preserves the guarantee inherited from the incremental protocol to discover a maximal set of node-disjoint paths....

A path is said to be `-bounded if it contains at most ` edges. We consider two types of `-bounded disjoint paths problems. In the maximum edgeor node-disjoint path problems MEDP(`) and MNDP(`), the task is to find the maximum number of edgeor node-disjoint `-bounded (s, t)-paths in a given graph G with source s and sink t, respectively. In the weighted edgeor node-disjoint path problems WEDP(`)...

In parallel and distributed systems many communications take place concurrently. The efficient delivery of all the messages depends on the routing algorithms as well as the underlying interconnection network topology. The grid is a planar network topology that lends itself for efficient VLSI implementation and therefore is of interest for theoretical analysis. Frequently, networks and switches ...

This paper discusses the multiple node disjoint paths protocol (MNDP) for mobile ad hoc networks. A mobile ad hoc network is a collection of mobile nodes that cooperate without networking infrastructure so as to form a temporary network that meets some immediate needs. The MNDP protocol detects multiple paths and distributes transmitted packets over these paths. Such distribution reduces conges...

In the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s1, t1), . . . , (sk, tk)} of pairs of vertices called demand pairs. The goal is to route the largest possible number of the demand pairs (si, ti), by selecting a path connecting each such pair, so that the resulting paths are node-disjoint. NDP is one of the most basic and extensively stud...

A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...