The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant Hamiltonicity of an interconnection network. Two node-disjoint cycles in a network are called equal if the number of nodes in the...

In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route...

Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an ndimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(m...

We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and link-disjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heu...

This paper is all about finding multipaths available in the network using disjoint edges and disjoint nodes strategy. In single path routing congestion is a big issue, multipath routing is helpful to find less-congested or congestion free route from source to destination. Disjoint nodes means having no repetition of node that are followed earlier by the data packets to avoid packet congestion o...

─ Node-disjoint routing in MANETs is very essential to reduce the end-to-end packet delay and increase the packet delivery ratio. AODV (Ad Hoc On-demand Multipath Distance Vector) which is widely used for MANETs creates single-path route between a pair of source and destination nodes. Node disjoint paths may have worst performance then single path if they interfere with each other due to the br...

An efficient distributed fault-tolerant routing algorithm for the hypercube is proposed based on the existence of a complete set of node-disjoint paths between any two nodes. Node failure and repairs may occur dynamically provided that the total number of faulty nodes at any time is less than the node-connectivity n of the n-cube. Each node maintains for each possible destination which of the a...

Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications such as video and voice MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatical...